On Communicating Finite-State Machines
Daniël Brand, P. Zafiropulo · Journal of the ACM · 1983
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.