Arbeitspapiere der GMD Nr. 467, pages 1-24 pp.. St. Augustin: Gesellschaft für Mathematik und Datenverarbeitung mbH, July 1990.
Also in: Lecture Notes in Computer Science, Vol. 469; Semantics of Systems of Concurrent Processes. Proceedings of the LITP Spring School on Theoretical Computer Science, 1990, La Roche-Posay, France, pages 334-357. Berlin: Springer-Verlag, 1990.
Abstract: In the usual semantics of CCS-like languages, parallelism is reduced to non-deterministic interleaving of actions. As an alternative semantic model for CCS with a clear distinction between concurrency and non-determinism, Petri nets may be used. The paper gives an introduction to Petri net semantics for CCS. Two approaches are considered: a compositional approach where semantic operations are defined for Petri nets explicitly, and an operational approach using Plotkin-style transition rules which is particularly convenient for infinite processes. It is discussed which class of CCS programs is representable by finite nets.
Keywords: net semantics (for) CCS; compositional approach (for semantics); operational approach (for semantics); Plotkin-style transition rule.
Back to the Petri Nets Bibliography