Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,286,837 papers from all fields of science
Search
Sign In
Create Free Account
Communicating finite-state machine
In computer science, a communicating finite-state machine is a finite state machine labeled with "receive" and "send" operations over some alphabet…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Computer science
Concurrency (computer science)
Finite-state machine
Petri net
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
On Verification of Communicating Finite State Machines Using Residual Languages
El maati Chabbar
,
M. Bouhdadi
Autonome Mobile Systeme
2007
Corpus ID: 16189748
FIFO channel languages of communicating finite state machines are useful for protocol verification. The reachability set is the…
Expand
2001
2001
Diagnosing Multiple Faults in Communicating Finite State Machines
K. El-Fakih
,
N. Yevtushenko
,
G. Bochmann
Formal Techniques for (Networked and) Distributed…
2001
Corpus ID: 15213132
In this paper, we propose a method for diagnostic test derivation when the system specification and implementation are given in…
Expand
1993
1993
Diagnosis of single transition faults in communicating finite state machines
A. Ghedamsi
,
G. Bochmann
,
R. Dssouli
[] Proceedings. The 13th International Conference…
1993
Corpus ID: 870554
The authors propose a generalized diagnostic algorithm for the case where more than one fault (output or transfer) may be present…
Expand
Highly Cited
1991
Highly Cited
1991
Data flow analysis of communicating finite state machines
W. Peng
,
S. Iyer
TOPL
1991
Corpus ID: 18415928
Let ( F’l, Pz, . . . . Pm) be a network of n finite state machines, communicating with each other asynchronously using typed…
Expand
1987
1987
On deadlock detection in systems of communicating finite state machines
M. Gouda
,
E. Gurari
,
T. Lai
,
L. Rosier
1987
Corpus ID: 56672181
Dans le systeme de machines a etats finis considere, les communications se font exclusivement par echange de messages sur des…
Expand
1986
1986
Proving liveness for networks of communicating finite state machines
M. Gouda
,
Chung-Kuo Chang
ACM Transactions on Programming Languages and…
1986
Corpus ID: 18305675
Consider a network of communicating finite state machines that exchange messages over unbounded FIFO channels. Each machine in…
Expand
1985
1985
Modeling physical layer protocols using communicating finite state machines
M. Gouda
,
Khe-Sing The
Conference on Applications, Technologies…
1985
Corpus ID: 18429400
We illustrate the usefulness of communicating finite state machines in modeling a number of physical layer protocols that include…
Expand
Highly Cited
1984
Highly Cited
1984
Closed Covers: To Verify Progress for Communicating Finite State Machines
M. Gouda
IEEE Transactions on Software Engineering
1984
Corpus ID: 17677005
Consider communicating finite state machines which exchange messages over unbounded FIFO channels. We discuss a technique to…
Expand
1984
1984
Communicating Finite State Machines with Priority Channnels
M. Gouda
,
L. Rosier
International Colloquium on Automata, Languages…
1984
Corpus ID: 46481162
Consider a network of two communicating finite state machines which exchange messages over two one-directional, unbounded…
Expand
Highly Cited
1982
Highly Cited
1982
Deadlock Detection for a Class of Communicating Finite State Machine
Yao-Tin Yu
,
M. Gouda
Protocol Specification, Testing and Verification
1982
Corpus ID: 34371838
Let M and N be two communicating finite state machines which exchange one type of message. We develope a polynomial algorithm to…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE