In: Acta Cybern., Vol. 8, No. 3, pages 293-311. 1987.
Abstract: The paper introduces a noninterleaving type of semantics for communicating processes. In contrast to other approaches, concurrency is expressed here explicitly and is distinguished from nondeterminism. Semantics of programs are obtainable by equations in this model. A comparison is also given with respect to labelled event structures and Petri nets.