par Peschanski, Frédéric;Klaudel, Hanna;Devillers, Raymond 
Référence Lecture notes in computer science, 6709 LNCS, page (208-227)
Publication Publié, 2011
Référence Lecture notes in computer science, 6709 LNCS, page (208-227)
Publication Publié, 2011
Article révisé par les pairs
| Résumé : | 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. |
