On the progress of communication between two finite state machines

DOI10.1016/S0019-9958(84)80014-5zbMath0591.68057OpenAlexW2092352752MaRDI QIDQ3719838

Eric G. Manning, Yao-Tin Yu, Mohamed G. Gouda

Publication date: 1984

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(84)80014-5

zbMATH Keywords

protocolssequential processesdecidability algorithmcommunicating finite state machinescommunicating machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of operating systems (68N25)

Related Items (8)

Automated verification of automata communicating via FIFO and bag buffers ⋮ Indistinguishability of finite automata with constrained behavior ⋮ Unnamed Item ⋮ An interface theory for service-oriented design ⋮ On the Undecidability of Asynchronous Session Subtyping ⋮ On the bound of algorithmic resolvability of correctness problems of automaton interaction through communication channels ⋮ Connecting open systems of communicating finite state machines ⋮ Verification of programs with half-duplex communication

This page was built for publication: On the progress of communication between two finite state machines