Results 11  20
of
41,632
The Structure of Finite State Machines
"... We have a number of good algorithms to manipulate FSMs and to test their properties. Alas, these machines have one serious drawback: they don’t have any nice internal structure and they are somewhat difficult to describe (other than by a brute force table). It would be nice if we could somehow build ..."
Abstract
 Add to MetaCart
theory. The theorem says, in essence, that every deterministic automaton can be decomposed into simple components. Alas, the argument uses algebra quite heavily (the simple components are machines corresponding to finite simple groups plus a 2state flipflop automaton). Recently, some actual
Hierarchical Finite State Machines with Multiple Concurrency Models
 IEEE Transactions on Computeraided Design of Integrated Circuits and Systems
, 1999
"... This paper studies the semantics of hierarchical finite state machines (FMS's) that are composed using various concurrency models, particularly dataflow, discreteevents, and synchronous/reactive modeling. It is argued that all three combinations are useful, and that the concurrency model can b ..."
Abstract

Cited by 146 (43 self)
 Add to MetaCart
This paper studies the semantics of hierarchical finite state machines (FMS's) that are composed using various concurrency models, particularly dataflow, discreteevents, and synchronous/reactive modeling. It is argued that all three combinations are useful, and that the concurrency model can
In vitro Implementation of FiniteState Machines
"... . We explore the information processing capabilities and efficiency of DNA computations by giving two different types of implementations of finitestate machines. A ligationbased approach allows input of arbitrary length and can be readily implemented with current biotechnology, but requires sequen ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
. We explore the information processing capabilities and efficiency of DNA computations by giving two different types of implementations of finitestate machines. A ligationbased approach allows input of arbitrary length and can be readily implemented with current biotechnology, but requires
Markovian Analysis of Large Finite State Machines
 IEEE Transactions on CAD
, 1996
"... Regarding finite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal verification problems. In this paper we present symbolic algorithms to compute the steadystate probabilities for very large finite state machines (up to 10 ..."
Abstract

Cited by 77 (7 self)
 Add to MetaCart
Regarding finite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal verification problems. In this paper we present symbolic algorithms to compute the steadystate probabilities for very large finite state machines (up to 10
Supervisory Control of Finite State Machines
, 1995
"... . We address a problem of finding a finite state machine (FSM), which composed with a given FSM, satisfies a given specification. The composition we use is the standard synchronous automata composition restricted to cases which correctly model hardware interconnection. For the satisfaction relation, ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
. We address a problem of finding a finite state machine (FSM), which composed with a given FSM, satisfies a given specification. The composition we use is the standard synchronous automata composition restricted to cases which correctly model hardware interconnection. For the satisfaction relation
Cartesian Composition in Bipolar Fuzzy Finite State Machines
"... In this paper we introduce Cartesian composition in bipolar fuzzy finite state machines and study their properties. Keywords: Bipolar Fuzzy finite state machines, Retrievability, Separability, Cartesian composition, Connectivity. 1. ..."
Abstract
 Add to MetaCart
In this paper we introduce Cartesian composition in bipolar fuzzy finite state machines and study their properties. Keywords: Bipolar Fuzzy finite state machines, Retrievability, Separability, Cartesian composition, Connectivity. 1.
Subsystem in Bipolar Fuzzy Finite State Machines
"... In this paper we introduce various types of subsystem, strong subsystem in bipolar fuzzy finite state machines. We study some equivalent conditions on subsystem. Keywords: Bipolar fuzzy finite state machines, Subsystem, Strong subsystem. ..."
Abstract
 Add to MetaCart
In this paper we introduce various types of subsystem, strong subsystem in bipolar fuzzy finite state machines. We study some equivalent conditions on subsystem. Keywords: Bipolar fuzzy finite state machines, Subsystem, Strong subsystem.
Stability of Deterministic Finite State Machines
"... Abstract — We approach deterministic finite state machines from a systems point of view and we consider three notions of input/output stability: finite gain input/output stability, external stability and incremental input/output stability, as they apply to this class of systems. We propose linear pr ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Abstract — We approach deterministic finite state machines from a systems point of view and we consider three notions of input/output stability: finite gain input/output stability, external stability and incremental input/output stability, as they apply to this class of systems. We propose linear
Ants: Mobile Finite State Machines
 IN ARXIV.ORG
, 2013
"... Consider the Ants Nearby Treasure Search (ANTS) problem introduced by Feinerman, Korman, Lotker, and Sereni (PODC 2012), where n mobile agents, initially placed at the origin of an infinite grid, collaboratively search for an adversarially hidden treasure. In this paper, the model of Feinerman et al ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
al. is adapted such that the agents are controlled by a (randomized) finite state machine: they possess a constantsize memory and are able to communicate with each other through constantsize messages. Despite the restriction to constantsize memory, we show that their collaborative performance
On Abstraction in Finite State Machine Models
, 2003
"... Information hiding is a long established principle in software engineering. However, in the context of finite state machines a contrary principle of information exposure has been suggested. Using a simple example, we examine why a proven abstraction mechanism which works well in other areas may be l ..."
Abstract
 Add to MetaCart
Information hiding is a long established principle in software engineering. However, in the context of finite state machines a contrary principle of information exposure has been suggested. Using a simple example, we examine why a proven abstraction mechanism which works well in other areas may
Results 11  20
of
41,632