In: Chytil, M.P.; Janiga, L.; Koubek, V.: Mathematical Foundations of Computer Science 1988, Lecture Notes in Computer Science, Vol. 324, pages 339-350. Berlin, Heidelberg, New York: Springer-Verlag, 1988.
Abstract: A non-interleaving semantics for a subset of CCS using finite place/transition-systems is presented. Straightforward constructions on nets for CCS operations are given. When restricting the language appropriately, these operations yield a net semantics with a clear distinction of concurrency and nondeterminism. It is shown that the ususal interleaving semantics is retrievable from the net semantics.