Results 1  10
of
290
The Theory of Hybrid Automata
, 1996
"... A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied on pur ..."
Abstract

Cited by 685 (12 self)
 Add to MetaCart
A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied
A Fast AutomatonBased Method for Detecting Anomalous Program Behaviors
 In Proceedings of the 2001 IEEE Symposium on Security and Privacy
, 2001
"... Forrest et al introduced a new intrusion detection approach that identifies anomalous sequences of system calls executed by programs. Since their work, anomaly detection on system call sequences has become perhaps the most successful approach for detecting novel intrusions. A natural way for learnin ..."
Abstract

Cited by 224 (5 self)
 Add to MetaCart
for learning sequences is to use a finitestate automaton (FSA). However, previous research seemed to indicate that FSAlearning is computationally expensive, that it cannot be completely automated, or that the space usage of the FSA may be excessive. We present a new approach in this paper that overcomes
1 THE COMPLEXITY OF A COUNTING FINITESTATE AUTOMATON
"... Abstract. A counting finitestate automaton is a nondeterministic finitestate automaton which, on an input over its input alphabet, (magically) writes in binary the number of accepting computations on the input. We examine the complexity of computing the counting function of an NFA, and the complex ..."
Abstract
 Add to MetaCart
Abstract. A counting finitestate automaton is a nondeterministic finitestate automaton which, on an input over its input alphabet, (magically) writes in binary the number of accepting computations on the input. We examine the complexity of computing the counting function of an NFA
THE COMPLEXITY OF A COUNTING FINITESTATE AUTOMATON
, 1988
"... Dear Professor Csirik, Thank you for accepting our paper entitled ”The complexity of a counting finitestate automaton” publication in Acta Cybernetica. The following lines constitute a plain TeX source for producing our pa as it was originally submitted. Figure 4.1 was not produced by TeX, but was ..."
Abstract
 Add to MetaCart
Dear Professor Csirik, Thank you for accepting our paper entitled ”The complexity of a counting finitestate automaton” publication in Acta Cybernetica. The following lines constitute a plain TeX source for producing our pa as it was originally submitted. Figure 4.1 was not produced by Te
Does a Rock Implement Every FiniteState Automaton?
, 1996
"... Putnam has argued that computational functionalism cannot serve as a foundation for the study of the mind, as every ordinary open physical system implements every finitestate automaton. I argue that Putnam's argument fails, but that it points out the need for a better understanding of the brid ..."
Abstract

Cited by 50 (1 self)
 Add to MetaCart
Putnam has argued that computational functionalism cannot serve as a foundation for the study of the mind, as every ordinary open physical system implements every finitestate automaton. I argue that Putnam's argument fails, but that it points out the need for a better understanding
Operating Guidelines for FiniteState Services
 ICATPN 2007. LNCS
, 2007
"... We study services modeled as open workflow nets (oWFN) and describe their behavior as service automata. Based on arbitrary finitestate service automata, we introduce the concept of an operating guideline, generalizing the work of [1,2] which was restricted to acyclic services. An operating guideli ..."
Abstract

Cited by 67 (27 self)
 Add to MetaCart
We study services modeled as open workflow nets (oWFN) and describe their behavior as service automata. Based on arbitrary finitestate service automata, we introduce the concept of an operating guideline, generalizing the work of [1,2] which was restricted to acyclic services. An operating
Incremental Construction and Maintenance of Minimal FiniteState Automata
"... Daciuk et al. [Computational Linguistics 26(1):3–16 (2000)] describe a method for constructing incrementally minimal, deterministic, acyclic finitestate automata (dictionaries) from sets of strings. But acyclic finitestate automata have limitations: For instance, if one wants a linguistic applicat ..."
Abstract
 Add to MetaCart
application to accept all possible integer numbers or Internet addresses, the corresponding finitestate automaton has to be cyclic. In this article, we describe a simple and equally efficient method for modifying any minimal finitestate automaton (be it acyclic or not) so that a string is added to or removed
On abstract finitestate morphology
 In Proceedings of the Sixth Conference of the European Chapter of the Association for Computational Linguistics
, 1993
"... Aspects of abstract finitestate morphology are introduced and demonstrated. The use of twoway finite automata for Arabic noun stem and verb root inflection leads to abstractions based on finitestate transition network topology as well as the form and content of network arcs. Nonconcatenative morp ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Aspects of abstract finitestate morphology are introduced and demonstrated. The use of twoway finite automata for Arabic noun stem and verb root inflection leads to abstractions based on finitestate transition network topology as well as the form and content of network arcs. Nonconcatenative
Optimization Construction of Region Automaton
"... Model checking is one of the most practical techniques of automatic formal verification to ensure the correctness of design specifications. The problem that the number of states can become too large for modelchecking realtime system is known as the statespace explosion problem. An optimization de ..."
Abstract
 Add to MetaCart
definition of clock equivalence, the key to model checking realtime, was described for model checking timed automaton in this paper. And then region automaton that the finitestate model resulted from timed automaton by Alur and Dill’s algorithm exist a lot of states which can't be reached or can
Inference of finite automata using homing sequences (Extended Abstract)
, 1989
"... We present new algorithms for inferring an unknown finitestate automaton from its input/output behavior in the absence of a means of re~rttinp the machine to a start date. A key technique used is inference of a homing sequence for the unknown automaton. Our infknrnce procedufes experiment with the ..."
Abstract

Cited by 194 (6 self)
 Add to MetaCart
We present new algorithms for inferring an unknown finitestate automaton from its input/output behavior in the absence of a means of re~rttinp the machine to a start date. A key technique used is inference of a homing sequence for the unknown automaton. Our infknrnce procedufes experiment
Results 1  10
of
290