Abstract
Current numerical model checkers for stochastic systems can efficiently analyse stochastic models. However, the fact that they are unable to provide debugging information constrains their practical use. In precursory work we proposed a method to select diagnostic traces, in the parlance of functional model checking commonly referred to as failure traces or counterexamples, for probabilistic timed reachability properties on discrete-time and continuous-time Markov chains. We applied directed explicit-state search algorithms, like Zāāā, to determine a diagnostic trace which carries large amount of probability. In this paper we extend this approach to determining sets of traces that carry large probability mass, since properties of stochastic systems are typically not violated by single traces, but by collections of those. To this end we extend existing heuristics guided search algorithms so that they select sets of traces. The result is provided in the form of a Markov chain. Such diagnostic Markov chains are not just essential tools for diagnostics and debugging but, they also allow the solution of timed reachability probability to be approximated from below. In particular cases, they also provide real counterexamples which can be used to show the violation of the given property. Our algorithms have been implemented in the stochastic model checker PRISM. We illustrate the applicability of our approach using a number of case studies.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Holzmann, G.J.: The Spin Model Checker: Primer and Reference Manual. Addison Wesley, Reading (2003)
Edelkamp, S., Leue, S., Lluch-Lafuente, A.: Directed explicit-state model checking in the validation of communication protocols. International Journal on Software Tools for Technology Transfer STTTĀ 5, 247ā267 (2004)
Aljazzar, H., Hermanns, H., Leue, S.: Counterexamples for timed probabilistic reachability. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol.Ā 3829, pp. 177ā195. Springer, Heidelberg (2005)
Pearl, J.: Heuristics ā Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading (1986)
Feller, W.: An Introduction to Probability Theory and Its Applications. John Wiley & Sons, Chichester (1968)
Stewart, W.J.: Introduction to the Numerical Solution of Markov Chains. Princeton University Press, New Jersey (1994)
Kulkarni, V.G.: Modeling and analysis of stochastic systems. Chapman & Hall, Ltd., London (1995)
Hinton, A., Kwiatkowska, M., Norman, G., Parker, D.: PRISM: A tool for automatic verification of probabilistic systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006 and ETAPS 2006. LNCS, vol.Ā 3920, pp. 441ā444. Springer, Heidelberg (2006)
Hermanns, H., Katoen, J.P., Meyer-Kayser, J., Siegle, M.: A markov chain model checker. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol.Ā 1785, pp. 347ā362. Springer, Heidelberg (2000)
Katoen, J.P., Khattri, M., Zapreev, I.S.: A markov reward model checker. QestĀ 0, 243ā244 (2005)
Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Asp. Comput.Ā 6, 512ā535 (1994)
Aziz, A., Sanwal, K., Singhal, V., Brayton, R.: Model-checking continuous-time markov chains. ACM Trans. Comput. LogicĀ 1, 162ā170 (2000)
Baier, C., Haverkort, B., Hermanns, H., Katoen, J.P.: Model-checking algorithms for continuous-time Markov chains. IEEE Transions on Software Engineering 29 (2003)
Grosu, R., Smolka, S.A.: Monte carlo model checking. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.Ā 3440, pp. 271ā286. Springer, Heidelberg (2005)
Sen, K., Viswanathan, M., Agha, G.: On statistical model checking of stochastic systems. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.Ā 3576, pp. 266ā280. Springer, Heidelberg (2005)
Younes, H.L.S., Simmons, R.G.: Probabilistic verification of discrete event systems using acceptance sampling. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.Ā 2404, pp. 223ā235. Springer, Heidelberg (2002)
Goodrich, M., Tamassia, R.: Data Structures and Algorithms in Java, 2nd edn. John Wiley & Sons, Inc., New York (2000)
JDSL Web Page: http://www.cs.brown.edu/cgc/jdsl/
Aljazzar, H., Leue, S.: Extended directed search for probabilistic timed reachability. Technical Report soft-06-03, Chair for Software Engineering, University of Konstanz, Gemany (2006), URL: http://www.inf.uni-konstanz.de/soft/research/publications/pdf/soft-06-03.pdf
Haverkort, B.R., Hermanns, H., Katoen, J.P.: On the use of model checking techniques for dependability evaluation. In: SRDS, pp. 228ā237 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aljazzar, H., Leue, S. (2006). Extended Directed Search for Probabilistic Timed Reachability. In: Asarin, E., Bouyer, P. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2006. Lecture Notes in Computer Science, vol 4202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11867340_4
Download citation
DOI: https://doi.org/10.1007/11867340_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45026-9
Online ISBN: 978-3-540-45031-3
eBook Packages: Computer ScienceComputer Science (R0)