Representing CCS (Calculus of Communicating Systems) Programs by Finite Petri Nets (Re-Announcement of TIB-B89-80679)

摘要

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 usual interleaving semantics is retrievable from the net semantics. Partial order semantics and equivalence notions for labelled P/T-systems are discussed. This shows how the intuitive causal dependencies in a CCS program are represented via the net semantics. (Copyright (c) GMD 1988.)