par Peschanski, Frédéric;Klaudel, Hanna;Devillers, Raymond
Référence Fundamenta informaticae, 122, 1-2, page (85-117)
Publication Publié, 2013
Article révisé par les pairs
Résumé : 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.