AbstractWe study the complexity of several standard problems for 1-safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACE-complete for 1-safe nets. We also prove that deadlock is NP-complete for free-choice nets and for 1-safe free-choice nets. Finally, we prove that for arbitrary Petri nets, deadlock is equivalent to reachability and liveness
Petri nets are named in honor of Dr. Carl A. Petri for his famous Ph.D dissertation of general net t...
AbstractWe prove several decidability and undecidability results for ν-PN, an extension of P/T nets ...
Interaction systems are a formal model for component-based systems, where components are combined vi...
We study the complexity of several standard problems for 1-safe Petri nets and some of its subclass...
AbstractWe consider the complexity of several standard problems for various classes of Petri nets. I...
AbstractThe complexity of the reachability problem for live and safe free-choice Petri nets has been...
. This paper presents an improved algorithm compared to the one given in [7], which finds a minimal ...
Abstract. At the end of the eighties, continuous Petri nets were intro-duced for: (1) alleviating th...
International audienceAt the end of the eighties, continuous Petri nets were introduced for: (1) all...
AbstractDetermining whether a given Petri net is live, or bounded, are major issues in Petri net ana...
McMillan has presented a deadlock detection method for Petri nets based on finite complete prefixes...
Place/transition Petri nets are a standard model for a class of distributed systems whose reachabili...
International audienceLiveness, (non-)deadlockability and reversibility are behavioral properties of...
Structural approaches have greatly simplified the analysis of intractable properties in Petri nets, ...
AbstractUsing linear algebraic techniques, we analyse the computational complexity of testing reacha...
Petri nets are named in honor of Dr. Carl A. Petri for his famous Ph.D dissertation of general net t...
AbstractWe prove several decidability and undecidability results for ν-PN, an extension of P/T nets ...
Interaction systems are a formal model for component-based systems, where components are combined vi...
We study the complexity of several standard problems for 1-safe Petri nets and some of its subclass...
AbstractWe consider the complexity of several standard problems for various classes of Petri nets. I...
AbstractThe complexity of the reachability problem for live and safe free-choice Petri nets has been...
. This paper presents an improved algorithm compared to the one given in [7], which finds a minimal ...
Abstract. At the end of the eighties, continuous Petri nets were intro-duced for: (1) alleviating th...
International audienceAt the end of the eighties, continuous Petri nets were introduced for: (1) all...
AbstractDetermining whether a given Petri net is live, or bounded, are major issues in Petri net ana...
McMillan has presented a deadlock detection method for Petri nets based on finite complete prefixes...
Place/transition Petri nets are a standard model for a class of distributed systems whose reachabili...
International audienceLiveness, (non-)deadlockability and reversibility are behavioral properties of...
Structural approaches have greatly simplified the analysis of intractable properties in Petri nets, ...
AbstractUsing linear algebraic techniques, we analyse the computational complexity of testing reacha...
Petri nets are named in honor of Dr. Carl A. Petri for his famous Ph.D dissertation of general net t...
AbstractWe prove several decidability and undecidability results for ν-PN, an extension of P/T nets ...
Interaction systems are a formal model for component-based systems, where components are combined vi...
DOI
Add to ORKG