par Best, Eike 
;Devillers, Raymond
Référence Fundamenta informaticae, 140, 1, page (39-59)
Publication Publié, 2015-07
;Devillers, Raymond Référence Fundamenta informaticae, 140, 1, page (39-59)
Publication Publié, 2015-07
Article révisé par les pairs
| Résumé : | This paper presents a dedicated Petri net synthesis algorithm for the case that a transition system is finite, live, and persistent. In particular, the paper delineates exactly when and how a structurally persistent net may be constructed, by crystallising, out of a general region-theoretic approach, a minimised set of simplified systems of linear inequalities. This extends previous results where reversibility, instead of liveness, played an important role. |
