In: Acta Informatica, Vol. 27, pages 533-565. 1990.
Abstract: A construction is given which for CCS programs (in which every choice and recursion starts sequentially) yields a finite and strict predicate/transition net. Consistency of this construction is proved not only with respect to the standard interleaving semantics but with respect to the distributed operational semantics of Degano et al. which additionally models the concurrency explicitly.
Keywords: representing CCS programs; predicate/transition net; interleaving semantics; distributed operational semantics.