In: Proceedings of the 10th International Conference on Application and Theory of Petri Nets, 1989, Bonn, Germany, pages 348-370. 1989.
Abstract: A construction is given which for all 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 interleaving semantics but with respect to the distributed operational semantics.