244 search results - page 14 / 49 » Counterexamples in Probabilistic Model Checking |
POPL
2008
ACM
14 years 7 months ago
2008
ACM
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
FORMATS
2004
Springer
14 years 27 days ago
2004
Springer
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...
FMCAD
2008
Springer
13 years 9 months ago
2008
Springer
Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems arbitrary number of processes. One popular approach to thi...
FORMATS
2004
Springer
14 years 27 days ago
2004
Springer
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
ARTS
1999
Springer
13 years 11 months ago
1999
Springer
Model checking can tell us whether a system is correct; probabilistic model checking can also tell us whether a system is timely and reliable. Moreover, probabilistic model checkin...