58 search results - page 2 / 12 » A Class of Petri Nets with a Convex Reachability Set |
132
click to vote
APN
2008
Springer
15 years 3 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...
118
click to vote
APN
2004
Springer
15 years 7 months ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
124
click to vote
APN
2009
Springer
15 years 8 months ago
2009
Springer
In previous works we defined ν-APNs, an extension of P/T nets with the capability of creating and managing pure names. We proved that, though reachability is undecidable, coverab...
109
Voted
RP
2009
Springer
15 years 8 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...
CDC
2009
IEEE
15 years 3 months 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)...