101 search results - page 4 / 21 » On Reachability in Autonomous Continuous Petri Net Systems |
CDC
2009
IEEE
14 years 10 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)...
103
click to vote
APN
2000
Springer
15 years 1 months ago
2000
Springer
Many techniques for the verification of reactive systems rely on the analysis of their reachable state spaces. In this paper, a new algorithm for the symbolic generation of the sta...
AUTOMATICA
2010
14 years 7 months ago
2010
In this paper we present an efficient approach for the fault detection of discrete event systems using Petri nets. We assume that some of the transitions of the net are unobservabl...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
ECEASST
2006
14 years 9 months ago
2006
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...