A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of...

In computer science, a communicating finite-state machine is a finite-state machine labeled with "receive" and "send" operations over some alphabet of...

channel system is a finite-state machine similar to communicating finite-state machine in which there is a single system communicating with itself instead...

v t e In computation, a finite-state machine (FSM) is event driven if the transition from one state to another is triggered by an event or a message....

basic X-machine model, each of which generalized the finite-state machine in a slightly different way. In the most general model, an X-machine is essentially...

UML state machine, formerly known as UML statechart, is an extension of the mathematical concept of a finite automaton in computer science applications...

{\displaystyle u+v\in \mathbb {N} ^{d}} . Petri net Finite-state machine Communicating finite-state machine Kahn process networks Process calculus Actor model...

standard). Finite-state machine models are used to formally describe the possible interactions of the protocol. and communicating finite-state machines For communication...

again allowing new data to be read. A process can be modeled as a finite state machine that is in one of two states: Active; the process computes or writes...

Machine Replication voluntarily restrict their implementations to use finite-state machines to simplify error recovery. Determinism is an ideal characteristic...

computation have been proposed, including vector addition systems, communicating finite-state machines, Kahn process networks, process algebra, the actor model...

complexity theory, such as with finite state machines, Mealy machines, push-down automata, and Turing machines. Abstract machines are typically categorized...

Tristan le Gall and Bertrand Jeannet (Mar 2007). Analysis of Communicating Infinite State Machines Using Lattice Automata (PDF) (Publication Interne). Institut...

has more than one closed communicating class, its stationary distributions will not be unique (consider any closed communicating class C i {\displaystyle...

modeling use finite-state machines (FSM) to model the behavior of the distributed entities (see also Communicating finite-state machines). However, this...

In computer science, communicating sequential processes (CSP) is a formal language for describing patterns of interaction in concurrent systems. It is...

groundwork for how AIs and machine learning algorithms work under nodes, or artificial neurons used by computers to communicate data. Other researchers who...

Issue: 4, Apr 1980 ) M.G. Gouda and Y.T. Yu, Synthesis of communicating Finite State Machines with guaranteed progress, IEEE Trans. on Comm., vol. Com-32...

functional programming ideas with ideas from finite-state automata. Automata are used to structure communicating programs into a series of "boxes", where...

deterministic finite automata string search deterministic finite automaton (DFA) deterministic finite state machine deterministic finite tree automaton...

models, so Markov chains, are mainly constructed of 2 artifacts : the finite-state machine (FSM) which represents all possible usage scenario of the tested...

complex mechanisms and data structures, among them suffix trees and finite-state machines. Character strings are such a useful datatype that several languages...

communicating classes. A class is closed if the probability of leaving the class is zero. A Markov chain is irreducible if there is one communicating...

input language: a system is described as Network of Extended Finite State Machines communicating via shared variables and unbuffered channels. Does not contain...

processes of fixed topology communicating numbers and strings using synchronous communication. The original communicating sequential processes (CSP) model...

workbench. The CIP-model is basically a finite-state machine, or more precisely, an extended finite-state machine (processes can store and modify variables...

Eilenberg's X-machine, an extended finite-state machine for processing data of the type X, the Stream X-Machine is a kind of X-machine for processing...

protocol descriptions specified as finite state machines. Networks of communicating automata, i.e., finite state machines running in parallel and synchronized...

environment based on Harel statecharts. SCXML is able to describe complex finite-state machines. For example, it is possible to describe notations such as sub-states...

Each layer is made up by a set of processors that are augmented finite-state machines (AFSM), the augmentation being added instance variables to hold...