On Communicating Finite-State Machines

Abstract

A model of Communications 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. © 1983, ACM. All rights reserved.