J. Esparza. Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete. Technical Report SFB-Bericht Nr. 342/12/96 A, Technische Universitat Munchen, 1996. To appear in Theoretical Computer Science. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Decidability and complexity of Petri net problems - an Introduction - Esparza (1998) (25 citations) (Correct)
.... given place Is there a reachable marking which enables a given transition Is the initial marking reachable from every reachable marking Is there a run that does not contain a given transition Interestingly, the reachability problem for 1 safe live free choice nets is NP complete [8], and so it is unlikely that it will ever be added to this list. Part II General Petri nets In this second part of the paper we consider arbitrary (finite) Place Transition Petri nets. The possible markings of a net N or just the markings of N are now the set of all mappings S IN , where S is ....
....in polynomial time. The answer is a qualified no . Even though [18, 39] contain some polynomial algorithms for conflict free Petri nets, most of the important problems for these two classes become at least NP hard. For instance, the reachability problem for conflict free Petri nets is NP complete [8], and the liveness problem for free choice Petri nets is co NP complete (i.e. it is the complement of an NP complete problem) 24, 5] the proof is sketched below as the solution to Story I) Notice that the liveness and reachability problems for arbitrary Petri nets are much harder, and so these ....
J. Esparza. Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete. Technical Report SFB-Bericht Nr. 342/12/96 A, Technische Universitat Munchen, 1996. To appear in Theoretical Computer Science.
Decidability and complexity of Petri net problems - an Introduction - Esparza (1998) (25 citations) (Correct)
No context found.
J. Esparza. Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete. Technical Report SFB-Bericht Nr. 342/12/96 A, Technische Universitat Munchen, 1996. To appear in Theoretical Computer Science.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC