• Citer

Complexity of Distributed Petri Net Synthesis

par Devillers, Raymond ;Tredup, Ronny
Référence Lecture notes in computer science, 13299 LNCS, page (15-28)
Publication Publié, 2022-12-01

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

Distributed Petri Net Synthesis corresponds to the task to decide, for a transition system A (with event set E) and a natural number κ, whether there exists a surjective location map λ: E→ { 1, ⋯, κ} and a Petri net N (with transition set E) such that, if two transitions e, e′∈ E share a common pre-place, then they have the same location (λ(e) = λ(e′) ), whose reachability graph is isomorphic to A (in which case such a solution should be produced as well). In this paper, we show that this problem is NP -complete.