4 search results - page 1 / 1 » A Primitive Recursive Algorithm for the General Petri Net Re... |
FOCS
1998
IEEE
15 years 3 months ago
1998
IEEE
CDC
2009
IEEE
15 years 13 days ago
2009
IEEE
In this paper, we study the reachability problem for the class of (strictly) monotone Petri nets that we define based on algebraic conditions. More specifically, given a (strictly)...
APN
2004
Springer
15 years 4 months ago
2004
Springer
We consider the problem of model checking modular Petri nets for the linear time logic LTL-X. An algorithm is presented which can use the synchronisation graph from modular analysi...
109
click to vote
APN
2008
Springer
15 years 1 months ago
2008
Springer
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Con...