51 search results - page 1 / 11 » Model Checking Bounded Prioritized Time Petri Nets |
ATVA
2007
Springer
13 years 9 months ago
2007
Springer
FUIN
2010
13 years 2 months ago
2010
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
DEDS
2006
13 years 4 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...
ICFEM
2009
Springer
13 years 2 months ago
2009
Springer
Bounded timed-arc Petri nets with read-arcs were recently proven equivalent to networks of timed automata, though the Petri net model cannot express urgent behaviour and the descri...
LPNMR
2001
Springer
13 years 9 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...