par Best, Eike 
;Devillers, Raymond ;Schlachter, Uli
Référence Acta informatica, 55, 7, page (575-611)
Publication Publié, 2018-11-01
;Devillers, Raymond ;Schlachter, UliRéférence Acta informatica, 55, 7, page (575-611)
Publication Publié, 2018-11-01
Article révisé par les pairs
| Résumé : | This paper describes a synthesis procedure dedicated to the construction of choice-free Petri nets from finite persistent transition systems, whenever possible. Taking advantage of the properties of choice-free Petri nets, a two-step approach is proposed. A pre-synthesis step checks necessary structural properties of the transition system and constructs some data structures needed for the second step. Then, a minimised set of simplified systems of linear inequalities is distilled from a general region-theoretic approach. This leads to a substantial narrowing of the sets of states for which linear inequalities must be solved, and allows an early detection of failures, supported by constructive error messages. The performance of the resulting algorithm is measured and compared numerically with existing synthesis tools. |
