论文信息 - A Petri Net Interpretation of Open Reconfigurable Systems

A Petri Net Interpretation of Open Reconfigurable Systems

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.

Raymond R. Devillers | Hanna Klaudel | Frédéric Peschanski

[1] Maciej Koutny,et al. A compositional Petri net translation of general π-calculus terms , 2008, Formal Aspects of Computing.

[2] Davide Sangiorgi,et al. Communicating and Mobile Systems: the π-calculus, , 2000 .

[3] Raymond R. Devillers,et al. A Decidable Characterization of a Graphical Pi-calculus with Iterators , 2010, INFINITY.

[4] Karen A. Frenkel,et al. An interview with Robin Milner , 1993, CACM.

[5] R. Gorrieri. A Petri Net Semantics for -calculus ? , 1995 .

[6] Roberto Gorrieri,et al. On the Relationship between π-Calculus and Finite Place/Transition Petri Nets , 2009, CONCUR.

[7] Maurizio Gabbrielli,et al. Comparing Recursion, Replication, and Iteration in Process Calculi , 2004, ICALP.

[8] Marco Pistore,et al. History-Dependent Automata: An Introduction , 2005, SFM.

[9] Frédéric Peschanski,et al. Modelling and Verifying Mobile Systems Using pi-Graphs , 2009, SOFSEM.

[10] Roberto Gorrieri,et al. Distributed semantics for the pi-calculus based on Petri nets with inhibitor arcs , 2009, J. Log. Algebraic Methods Program..

[11] Corrado Priami,et al. Causality for Mobile Processes , 1995, ICALP.

[12] Roberto Gorrieri,et al. A Petri Net Semantics for pi-Calculus , 1995, CONCUR.