34 search results - page 1 / 7 » Counterexamples for Timed Probabilistic Reachability |
FORMATS
2005
Springer
13 years 11 months ago
2005
Springer
FORMATS
2006
Springer
13 years 9 months ago
2006
Springer
Current numerical model checkers for stochastic systems can efficiently analyse stochastic models. However, the fact that they are unable to provide debugging information constrain...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. This paper presents a novel technique for counterexample generation in probabilistic model checking of Markov chains and Markov Decision Processes. (Finite) paths in coun...
CAV
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refine...
SPIN
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...