969 search results - page 2 / 194 » Recursive Petri nets |
COCOON
2003
Springer
14 years 22 days 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...
APN
2009
Springer
14 years 2 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...
CDC
2009
IEEE
13 years 8 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)...
IFM
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. In this paper, we address the problem of expressing objectoriented concepts in terms of Petri nets. This is interesting, first, as a possibility of representing concurre...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
The unfolding of (1-)safe Petri nets to occurrence nets is well understood. There is a universal characterization of the unfolding of a safe net which is part and parcel of a core...