Statistical probabilistic model checking with a focus on time-bounded properties
Information and Computation
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Bisimulation minimisation mostly speeds up probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
How fast and fat is your probabilistic model checker? an experimental performance comparison
HVC'07 Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing
Towards a theory of time-bounded verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Model checking Markov chains using Krylov subspace methods: an experience report
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
The ins and outs of the probabilistic model checker MRMC
Performance Evaluation
Time-bounded verification of CTMCs against real-time specifications
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
| Hi-index | 0.01 |
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, such that prior to reaching the goal certain states are avoided. Efficient algorithms for time-bounded reachability are at the heart of probabilistic model checkers such as PRISM and ETMCC. For large time spans, on-the-fly steady-state detection is commonly applied. To obtain correct results (up to a given accuracy), it is essential to avoid detecting premature stationarity. This paper gives a detailed account of criteria for steady-state detection in the setting of time-bounded reachability. This is done for forward and backward reachability algorithms. As a spin-off of this study, new results for on-the-fly steady-state detection during CTMC transient analysis are reported. Based on these results, a precise procedure for steady-state detection for time-bounded reachability is obtained. Experiments show the impact of these results in probabilistic model checking.