par Devillers, Raymond 
Référence Proceedings (International Conference on Application of Concurrency to System Design), 16, page (65-73)
Publication Publié, 2016-06-22
Référence Proceedings (International Conference on Application of Concurrency to System Design), 16, page (65-73)
Publication Publié, 2016-06-22
Article révisé par les pairs
| Résumé : | It is well-known that the reachability graph of a sumof disjoint Petri nets is the disjoint product of the reachabilitygraphs of the components. We shall consider here the converseproblem, i.e., determine when and how a transition system maybe decomposed in non-trivial concurrent factors, and extend thetheory to more general labelled transition systems. Meanwhile, weshall develop interesting algebraic properties of disjoint products. |
