• Citer

Factorisation of Petri net solvable transition systems

par Devillers, Raymond ;Schlachter, Uli
Référence Lecture notes in computer science, 10877 LNCS, page (82-98)
Publication Publié, 2018

Article révisé par les pairs

• Détails
• Contenu

Résumé :

In recent papers, general conditions were developed to characterise when and how a labelled transition system may be factorised into non-trivial factors. These conditions combine a local property (strong diamonds) and a global one (separation), the latter being of course more delicate to check. Since one of the aims of such a factorisation was to speed up the synthesis of Petri nets from such labelled transition systems, the problem arises to analyse if those conditions (and in particular the global one) could be simplified, or even dropped, in the special case of Petri net solvable behaviours, i.e., when Petri net synthesis is possible. This will be the subject of the present paper.