58 search results - page 1 / 12 » A Class of Petri Nets with a Convex Reachability Set |
ICRA
1993
IEEE
13 years 9 months ago
1993
IEEE
COCOON
2003
Springer
13 years 10 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...
AC
2003
Springer
13 years 10 months ago
2003
Springer
We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable marking...
FORMATS
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. In this paper, we propose a new framework for the parametric verification of time Petri nets with stopwatches controlled by inhibitor arcs. We first introduce an extensio...
IFM
2004
Springer
13 years 10 months 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...