Encoding Asynchronous Interactions Using Open Petri Nets
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
On the Relationship between η-Calculus and Finite Place/Transition Petri Nets
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
Fundamenta Informaticae - Petri Nets 2008
A petri net interpretation of open reconfigurable systems
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Petruchio: from dynamic networks to nets
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
Fundamenta Informaticae - Petri Nets 2008
A polynomial translation of π-calculus (FCP) to safe petri nets
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
A Petri Net Interpretation of Open Reconfigurable Systems
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2011
| Hi-index | 0.00 |
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.