An algebraic system for process structuring and interprocess communication
Takayuki Dan Kimura · 1976
An extension of regular expressions is introduced to represent the activities of synchronizing concurrent processes. A communication link is defined as an automaton (infinite) with one-to-one partial transformations, and communication protocol as an assignment of events to actions of a communication link. A synchronization problem is defined as a problem of concurrent decomposition of a process into a deadlock-free family of processes sharing a communication protocol.