A methodology for constructing communication protocols with multiple concurrent functions
From MaRDI portal
Publication:1112596
DOI10.1007/BF01788565zbMath0659.68042MaRDI QIDQ1112596
Publication date: 1988
Published in: Distributed Computing (Search for Journal in Brave)
safety properties; communication protocols; extended communicating finite-state machines; merged networks; protocol composition
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68N25: Theory of operating systems
Cites Work
- Unnamed Item
- An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets
- Boundedness, empty channel detection, and synchronization for communicating finite automata
- Closed Covers: To Verify Progress for Communicating Finite State Machines
- Protocol Verification via Projections
- On Communicating Finite-State Machines