Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
A Petri Net Semantics for pi-Calculus
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Causality for Mobile Processes
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
A compositional Petri net translation of general π-calculus terms
Formal Aspects of Computing
Modelling and Verifying Mobile Systems Using π -Graphs
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
On the Relationship between η-Calculus and Finite Place/Transition Petri Nets
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
History-dependent automata: an introduction
SFM-Moby'05 Proceedings of the 5th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: mobile computing
A polynomial translation of π-calculus (FCP) to safe petri nets
CONCUR'12 Proceedings of the 23rd 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 present a Petri net interpretation of the pi-graphs - a graphical variant of the pi-calculus. Characterizing labelled transition systems, the translation can be used to reason in Petri net terms about open reconfigurable systems. We demonstrate that the pi-graphs and their translated Petri nets agree at the semantic level. In consequence, existing results on pi-graphs naturally extend to the translated Petri nets, most notably a guarantee of finiteness by construction.