par Devillers, Raymond 
Référence Lecture notes in computer science, 12734 LNCS, page (274-291)
Publication Publié, 2021-02-01
Référence Lecture notes in computer science, 12734 LNCS, page (274-291)
Publication Publié, 2021-02-01
Article révisé par les pairs
| Résumé : | Instead of synthesising a labelled transition system into a weighted Petri net, we shall here consider the larger class of nets with reset arcs, allowing to instanciate a larger class of transition systems. We shall also target an extension of choice-free nets with reset arcs, since choice-free nets appeared to be especially interesting in terms of properties, synthesis and implementation. In addition to a general algorithm, we shall analyse how to speed it up by reducing the number and complexity of the linear systems of constraints to be solved and how to set up a pre-synthesis phase. We shall also envisage how to implement the result of such a synthesis as a concurrent program. |
