Lehrstuhl Seminar 10 Nov 2005

Ivan Zapreev

Speeding Up Probabilistic Time-Bounded Reachability for Large Time-Spans

 

Abstract:

 

We discuss the problem of the premature steady-state detection in model checking of Discrete-Time and Continuous-Time Markov Chains. It is illustrated with several examples and is caused by the unreliable on-the-fly steady-state detection algorithms, currently used in the process of computing probabilistic time-bounded reachability for CTMC. The numerical computations, used for model checking, are based on Uniformization and the Fox-Glynn algorithm. They cause a computational error, derived in previous works. This error turns out to be incomplete and unprecise, so the second goal of the work is to refine it as well.