19 search results - page 3 / 4 » Net Reductions for LTL Model-Checking |
CODES
2002
IEEE
13 years 10 months ago
2002
IEEE
This paper describes the formal verification of the recently introduced Dual Transition Petri Net (DTPN) models [12], using model checking techniques. The methodology presented a...
ICFEM
2009
Springer
14 years 10 days ago
2009
Springer
Rapid development in hardware industry has brought the prevalence of multi-core systems with shared-memory, which enabled the speedup of various tasks by using parallel algorithms....
APN
2008
Springer
13 years 7 months ago
2008
Springer
Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the...
APN
2003
Springer
13 years 11 months ago
2003
Springer
Model checking by exhaustive state space enumeration is one of the most developed analysis methods for distributed event systems. Its main problem—the size of the state spaces—...
DEDS
2006
13 years 5 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...