Probabilistic model checkers typically provide a list of individual state probabilities on the refutation of a temporal logic formula. For large state spaces, this information is far too detailed to act as useful diagnostic feedback. For quantitative (constrained) reachability problems, sets of paths that carry enough probability mass are more adequate. We recently have shown that in the context of discrete-time probabilistic processes, such sets of smallest size can be efficiently computed by (hop-constrained) $k$-shortest path algorithms. This paper considers the problem of generating counterexamples for continuous-time Markov chains. The key contribution is a set of approximate algorithms for computing small sets of paths that indicate the violation of time-bounded (constrained) reachability probabilities.
|Title of host publication||Providing evidence of likely being on time: Counterexample generation for CTMC model checking|
|Editors||K. Namjoshi, T. Yoneda, T. Higashino, Y. Okamura|
|Number of pages||16|
|Publication status||Published - 2007|
|Name||Lecture Notes in Computer Science|
Han, T., & Katoen, J. P. (2007). Providing evidence of likely being on time - Counterexample generation for CTMC model checking. In K. Namjoshi, T. Yoneda, T. Higashino, & Y. Okamura (Eds.), Providing evidence of likely being on time: Counterexample generation for CTMC model checking (pp. 331-346). [10.1007/978-3-540-75596-8_24] (Lecture Notes in Computer Science; Vol. 4762, No. Supplement). Springer. https://doi.org/10.1007/978-3-540-75596-8_24