Sciweavers

662 search results - page 18 / 133
» Model Checking Procedures for Infinite State Systems
Sort
View
DAC
1996
ACM
15 years 1 months ago
State Reduction Using Reversible Rules
We reduce the state explosion problem in automatic verification of finite-state systems by automatically collapsing subgraphs of the aph into abstract states. The key idea of the ...
C. Norris Ip, David L. Dill
FOSSACS
2003
Springer
15 years 2 months ago
Model Checking Lossy Channels Systems Is Probably Decidable
Lossy channel systems (LCS’s) are systems of finite state automata that communicate via unreliable unbounded fifo channels. We propose a new probabilistic model for these syste...
Nathalie Bertrand, Ph. Schnoebelen
APN
2008
Springer
14 years 11 months ago
MC-SOG: An LTL Model Checker Based on Symbolic Observation Graphs
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...
Kais Klai, Denis Poitrenaud
TIME
2007
IEEE
15 years 3 months ago
A Symbolic Decision Procedure for Robust Safety of Timed Systems
We present a symbolic algorithm for deciding safety (reachability) of timed systems modelled as Timed Automata (TA), under the notion of robustness w.r.t. infinitesimal clock-drif...
Mani Swaminathan, Martin Fränzle
TACAS
2009
Springer
132views Algorithms» more  TACAS 2009»
15 years 4 months ago
Transition-Based Directed Model Checking
Abstract. Directed model checking is a well-established technique that is tailored to fast detection of system states that violate a given safety property. This is achieved by in...
Martin Wehrle, Sebastian Kupferschmid, Andreas Pod...