The Synthesis Problem for Elementary Net Systems is NP-Complete

Eric Badouel 1 Luca Bernardinello 1 Philippe Darondeau 1
1 MICAS - Modèles et implémentation des calculs syntaxiques
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires
Abstract : The so-called synthesis problem consists in deciding for a class of nets whether a given graph is isomorphic to the case graph of some net and then constructing the net. This problem has been solved for various classes of nets, ranging from elementary nets to Petri nets. The general principle is to compute regions in the graph, i.e. subsets of nodes liable to represent extensions of places of an associated net. The naive method of synthesis which relies on this principle leads to exponential algorithms for an arbitrary class of nets. In an earlier study, we gave algorithms that solve the synthesis problem in polynomial time for the class of bounded Petri nets. We show here that in contrast the synthesis problem is indeed NP-complete for the class of elementary nets. This result is independent from the results of Kunihiko Hiraishi, showing that both problems of separation and inhibition by regions at a given node of the graph are NP-complete.
Type de document :
[Research Report] RR-2558, INRIA. 1995
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:33:52
Dernière modification le : jeudi 11 janvier 2018 - 06:21:19
Document(s) archivé(s) le : dimanche 4 avril 2010 - 21:53:24



  • HAL Id : inria-00074122, version 1



Eric Badouel, Luca Bernardinello, Philippe Darondeau. The Synthesis Problem for Elementary Net Systems is NP-Complete. [Research Report] RR-2558, INRIA. 1995. 〈inria-00074122〉



Consultations de la notice


Téléchargements de fichiers