A Process Calculus for Expressing Finite Place/Transition Petri Nets

Roberto Gorrieri
Cristian Versari

We introduce the process calculus Multi-CCS, which extends conservatively CCS with an operator of strong prefixing able to model atomic sequences of actions as well as multiparty synchronization. Multi-CCS is equipped with a labeled transition system semantics, which makes use of a minimal structural congruence. Multi-CCS is also equipped with an unsafe P/T Petri net semantics by means of a novel technique. This is the first rich process calculus, including CCS as a subcalculus, which receives a semantics in terms of unsafe, labeled P/T nets. The main result of the paper is that a class of Multi-CCS processes, called finite-net processes, is able to represent all finite (reduced) P/T nets.

In Sibylle Fröschle and Frank D. Valencia: Proceedings 17th International Workshop on Expressiveness in Concurrency (EXPRESS'10), Paris, France, August 30th, 2010, Electronic Proceedings in Theoretical Computer Science 41, pp. 76–90.
Published: 28th November 2010.

ArXived at: http://dx.doi.org/10.4204/EPTCS.41.6 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org