par Devillers, Raymond 
Référence Lecture notes in computer science, 11522 LNCS, page (113-126)
Publication Publié, 2019-08-01
Référence Lecture notes in computer science, 11522 LNCS, page (113-126)
Publication Publié, 2019-08-01
Article révisé par les pairs
| Résumé : | In order to speed up the synthesis of Petri nets from labelled transition systems, a divide and conquer strategy consists in defining LTS decomposition techniques and corresponding PN composition operators to recombine the solutions of the various components. The paper explores how an articulation decomposition, possibly combined with a product and addition technique developed in previous papers, may be used in this respect and generalises sequence operators, as well as looping ones. |
