Abstract : We present a Petri net interpretation of the pi-graphs - a graphical variant of the picalculus where recursion and replication are replaced by iteration. The concise and syntax-driven translation can be used to reason in Petri net terms about open reconfigurable systems. We demonstrate that the pi-graphs and their translated high-level 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.
https://hal.archives-ouvertes.fr/hal-00819095
Contributor : Frédéric Davesne
<>
Submitted on : Tuesday, April 30, 2013 - 9:59:23 AM
Last modification on : Monday, October 28, 2019 - 11:00:23 AM
Frédéric Peschanski, Hanna Klaudel, Raymond Devillers. A petri net interpretation of open reconfigurable systems. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2013, 122 (1-2), pp.85--117. ⟨10.3233/FI-2013-784⟩. ⟨hal-00819095⟩
