par Best, Eike
;Devillers, Raymond ![](/vufind/images/ULB/publications_list.png)
Référence Lecture notes in computer science, 8370 LNCS, page (161-172)
Publication Publié, 2014
![](/vufind/images/ULB/publications_list.png)
![](/vufind/images/ULB/publications_list.png)
Référence Lecture notes in computer science, 8370 LNCS, page (161-172)
Publication Publié, 2014
Article révisé par les pairs
Résumé : | The structure of the reachability graph of a live and bounded marked graph Petri net is fully characterised. A dedicated synthesis procedure is presented which allows the net and its bounds to be computed from its reachability graph. © 2014 Springer International Publishing. |