2 search results - page 1 / 1 » On Yen's Path Logic for Petri Nets |
RP
2009
Springer
14 years 3 months ago
2009
Springer
In [13], Yen defines a class of formulas for paths in Petri nets and claims that its satisfiability problem is EXPSPACE-complete. In this paper, we show that in fact the satisfi...
COCOON
2003
Springer
14 years 1 months ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...