Providing evidence of likely being on time: counterexample generation for CTMC model checking

Han, Tingting and Katoen, J.-P. (2007) Providing evidence of likely being on time: counterexample generation for CTMC model checking. In: Namjoshi, K.S. and Yoneda, T. and Higashino, T. and Okamura, Y. (eds.) Automated Technology for Verification and Analysis: 5th International Symposium. Lecture Notes in Computer Science 4762. Springer, pp. 331-346. ISBN 9783540755951.

Full text not available from this repository.

Official URL: https://doi.org/10.1007/978-3-540-75596-8\_24

Abstract

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.

Metadata

Item Type:	Book Section
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	30 Mar 2021 12:48
Last Modified:	09 Aug 2023 12:50
URI:	https://eprints.bbk.ac.uk/id/eprint/43752

Statistics

Archive Staff Only (login required)

Edit/View Item