4 search results - page 1 / 1 » Reachability in Live and Safe Free-Choice Petri Nets is NP-C... |
86
Voted
TCS
1998
15 years 1 hour 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...
87
Voted
CORR
2006
Springer
15 years 11 days 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...
95
Voted
FSTTCS
1993
Springer
15 years 4 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...
109
click to vote
TCAD
1998
15 years 2 hour 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 ...