Abstract
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. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Peschanski, F., Klaudel, H., & Devillers, R. (2011). A Petri net interpretation of open reconfigurable systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6709 LNCS, pp. 208–227). Springer Verlag. https://doi.org/10.1007/978-3-642-21834-7_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
