A compositional Petri net translation of general π -calculus terms
- 1 July 2008
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 20 (4-5), 429-450
- https://doi.org/10.1007/s00165-008-0079-2
Abstract
We propose a finite structural translation of possibly recursive π -calculus terms into Petri nets. This is achieved by using high-level nets together with an equivalence on markings in order to model entering into recursive calls, which do not need to be guarded. We view a computing system as consisting of a main program ( π -calculus term) together with procedure declarations (recursive definitions of π -calculus identifiers). The control structure of these components is represented using disjoint high-level Petri nets, one for the main program and one for each of the procedure declarations. The program is executed once, while each procedure can be invoked several times (even concurrently), each such invocation being uniquely identified by structured tokens which correspond to the sequence of recursive calls along the execution path leading to that invocation.Keywords
This publication has 18 references indexed in Scilit:
- A Petri Net Semantics of a Simple Process Algebra for MobilityElectronic Notes in Theoretical Computer Science, 2006
- General parameterised refinement and recursion for the M-net calculusTheoretical Computer Science, 2003
- Canonical Prefixes of Petri Net UnfoldingsLecture Notes in Computer Science, 2002
- An Introduction to the π-CalculusPublished by Elsevier BV ,2001
- M-nets: An algebra of high-level Petri nets, with an application to the semantics of concurrent programming languagesActa Informatica, 1998
- A multiset semantics for the pi-calculus with replicationTheoretical Computer Science, 1996
- Concurrent Semantics for the π-calculusElectronic Notes in Theoretical Computer Science, 1995
- A calculus of mobile processes, IInformation and Computation, 1992
- Petri net systems and their closure propertiesLecture Notes in Computer Science, 1990
- Sequential and concurrent behaviour in Petri net theoryTheoretical Computer Science, 1987