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

A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model 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...

{\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...

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

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...

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

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

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

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

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

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...

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

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

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

Law of Finite Chains Between Events in the Combined Ordering (without using the axiom of choice.) The law of discreteness rules out Zeno machines and is...

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

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...

of extremely parallel processing on a superposition of a quantum state with a finite number of qubits. The main strategy is to carry out an iterative...

global state. The global state approach was continued in automata theory for finite-state machines and push down stack machines including their nondeterministic...