par Devillers, Raymond 
Référence Acta informatica, 55, 4, page (339-362)
Publication Publié, 2018-06
Référence Acta informatica, 55, 4, page (339-362)
Publication Publié, 2018-06
Article révisé par les pairs
| Résumé : | It is well-known that the reachability graph of a sum of disjoint Petri nets is the disjoint product of the reachability graphs of the components. We shall consider here the converse problem, i.e., determine when and how a transition system may be decomposed in non-trivial concurrent factors, and extend the theory to more general labelled transition systems. Meanwhile, we shall develop interesting algebraic properties of disjoint products. The present paper is an extended version of Devillers (in: Desel, Yakovlev (eds) Proceedings 16th international conference on application of concurrency to system design (ACSD 2016), 2016). |
