A Petri Net Interpretation of Open Reconfigurable Systems

Issue title: Applications and Theory of Petri Nets and Other Models of Concurrency, 2011

Article type: Research Article

Authors: Peschanski, Frédéric | Klaudel, Hanna | Devillers, Raymond

Affiliations: LIP6 – Université Pierre et Marie Curie, Paris, France | IBISC – Université d'Évry-Val-d'Essonne, Évry, France | QUALSEC – Université Libre de Bruxelles, Belgium

Note: [] Address for correspondence: LIP6 – Université Pierre et Marie Curie, Paris, France

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.

Keywords: Reconfigurable systems, Pi-calculus, Iteration, Petri nets

DOI: 10.3233/FI-2013-784

Journal: Fundamenta Informaticae, vol. 122, no. 1-2, pp. 85-117, 2013