66 search results - page 8 / 14 » Diagnosability of bounded Petri nets |
JCSS
2010
14 years 8 months ago
2010
: Every cluster in a bounded and live free-choice system has a unique blocking marking. It can be reached by firing an occurrence sequence, which avoids any transition of the clust...
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
DEDS
2006
14 years 9 months ago
2006
In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We...
CDC
2009
IEEE
14 years 11 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)...
ENTCS
2006
14 years 9 months ago
2006
In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the st...