4 search results - page 1 / 1 » Reachability in Live and Safe Free-Choice Petri Nets is NP-C... |
TCS
1998
13 years 10 months ago
1998
The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
Bipolar synchronization systems (BP-systems) constitute a class of coloured Petri nets, well suited for modelling the control flow of discrete dynamical systems. Every BP-system ha...
FSTTCS
1993
Springer
14 years 3 months ago
1993
Springer
We 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 f...
TCAD
1998
13 years 10 months ago
1998
Most existing tools for the synthesisof asynchronouscircuits from Signal Transition Graphs (STGs) derive the reachability graph for the calculation of logic equations. This paper ...