In: Baeten, J.C.M.; et al.: Lecture Notes in Computer Science, Vol. 458; CONCUR'90, Theories of Concurrency: Unification and Extension. (Conference, 1990, Amsterdam, The Netherlands), pages 2-30. Berlin, Germany: Springer-Verlag, 1990.
Abstract: A simple calculus of Place/Transition Petri Nets, called SCONE, is introduced. Relationships between SCONE and the subset of CCS without restriction and relabelling, called RCCS, are studied by showing that RCCS can be implemented onto the net calculus. The implementation is given by means of a suitable mapping from RCCS transitions to SCONE computations, resulting in a finite net representation for RCCS agents. By quotienting the transition system of RCCS with restpect to the implementation mapping, the authors induce also a ``true concurrent'' semantics for RCCS.
Keywords: SCONE, calculus (of nets); RCCS, (subset of) CCS; true concurrency.
Back to the Petri Nets Bibliography