On Communicating Finite-State Machines
@article{Brand1983OnCF, title={On Communicating Finite-State Machines}, author={D. Brand and P. Zafiropulo}, journal={J. ACM}, year={1983}, volume={30}, pages={323-342} }
A model of commumcations protocols based on finite-state machines is investigated. The problem addressed is how to ensure certain generally desirable properties, which make protocols "wellformed," that is, specify a response to those and only those events that can actually occur. It is determined to what extent the problem is solvable, and one approach to solving it ts described. Categories and SubJect Descriptors' C 2 2 [Computer-Conununication Networks]: Network Protocols-protocol… CONTINUE READING
1,089 Citations
A technique for proving liveness of communicating finite state machines with examples
- Computer Science
- PODC '84
- 1984
- 12
Decidability of the termination problem for completely specified protocols
- Computer Science
- Distributed Computing
- 2005
- 67
A Relational Algebraic Approach to Protocol Verification
- Computer Science
- IEEE Trans. Software Eng.
- 1988
- 23