par Best, Eike
;Devillers, Raymond 
Référence Lecture notes in computer science, 8489, page (111-129)
Publication Publié, 2014


Référence Lecture notes in computer science, 8489, page (111-129)
Publication Publié, 2014
Article révisé par les pairs
Résumé : | This paper presents efficient, specialised synthesis and reengineering algorithms for the case that a transition system is finite, persistent and reversible. It also shows by means of a complex example that structural properties of the synthesised Petri nets may not necessarily be entailed. |