par Best, Eike 
;Devillers, Raymond
Référence Leibniz international proceedings in informatics, 42, page (128-141)
Publication Publié, 2015
;Devillers, Raymond Référence Leibniz international proceedings in informatics, 42, page (128-141)
Publication Publié, 2015
Article révisé par les pairs
| Résumé : | This paper describes a synthesis algorithm tailored to the construction of choice-free Petri nets from finite persistent transition systems. With this goal in mind, a minimised set of simplified systems of linear inequalities is distilled from a general region-theoretic approach, leading to algorithmic improvements as well as to a partial characterisation of the class of persistent transition systems that have a choice-free Petri net realisation. |
