par Devillers, Raymond
;Klaudel, Hanna;Koutny, Maciej
Référence Lecture notes in computer science, 4281 LNCS, page (138-152)
Publication Publié, 2006
;Klaudel, Hanna;Koutny, MaciejRéférence Lecture notes in computer science, 4281 LNCS, page (138-152)
Publication Publié, 2006
Article révisé par les pairs
| Résumé : | In this paper, we propose a finite structural translation of possibly recursive π-calculus terms into Petri nets. This is achieved by using high level nets together with an equivalence on markings in order to model entering into recursive calls, which do not need to be guarded. © Springer-Verlag Berlin Heidelberg 2006. |



