A multiset semantics for the pi-calculus with replication
Theoretical Computer Science - Special volume on Petri nets
Petri net algebra
Communication and Concurrency
Asynchronous Links in the PBC and M-Nets
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
A Petri Net Semantics for pi-Calculus
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
The box calculus: a new causal algebra with multi-label communication
Advances in Petri Nets 1992, The DEMON Project
Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Models for Name-Passing Processes: Interleaving and Causal
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Fundamenta Informaticae
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
Fundamenta Informaticae - Petri Nets 2008
| Hi-index | 0.00 |
In this paper we propose a translation into high level Petri nets of the terms of a finite fragment of the π-calculus. Our construction renders in a compositional way the control flow aspects present in π-calculus process expressions, by adapting the existing graph-theoretic net composition operators. Those aspects which are related to term rewriting, as well as name binding, are handled through special inscriptions of places, transitions and arcs, together with a suitable choice of the initial marking.