Extended Directed Search for Probabilistic Timed Reachability

  • Husain Aljazzar
  • Stefan Leue
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4202)


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.


Markov Chain Model Check Target State Heuristic Function State Transition Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Holzmann, G.J.: The Spin Model Checker: Primer and Reference Manual. Addison Wesley, Reading (2003)Google Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Pearl, J.: Heuristics – Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading (1986)Google Scholar
  5. 5.
    Feller, W.: An Introduction to Probability Theory and Its Applications. John Wiley & Sons, Chichester (1968)MATHGoogle Scholar
  6. 6.
    Stewart, W.J.: Introduction to the Numerical Solution of Markov Chains. Princeton University Press, New Jersey (1994)MATHGoogle Scholar
  7. 7.
    Kulkarni, V.G.: Modeling and analysis of stochastic systems. Chapman & Hall, Ltd., London (1995)MATHGoogle Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    Katoen, J.P., Khattri, M., Zapreev, I.S.: A markov reward model checker. Qest 0, 243–244 (2005)Google Scholar
  11. 11.
    Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Asp. Comput. 6, 512–535 (1994)CrossRefMATHGoogle Scholar
  12. 12.
    Aziz, A., Sanwal, K., Singhal, V., Brayton, R.: Model-checking continuous-time markov chains. ACM Trans. Comput. Logic 1, 162–170 (2000)CrossRefMathSciNetGoogle Scholar
  13. 13.
    Baier, C., Haverkort, B., Hermanns, H., Katoen, J.P.: Model-checking algorithms for continuous-time Markov chains. IEEE Transions on Software Engineering 29 (2003)Google Scholar
  14. 14.
    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)CrossRefGoogle Scholar
  15. 15.
    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)CrossRefGoogle Scholar
  16. 16.
    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)CrossRefGoogle Scholar
  17. 17.
    Goodrich, M., Tamassia, R.: Data Structures and Algorithms in Java, 2nd edn. John Wiley & Sons, Inc., New York (2000)Google Scholar
  18. 18.
  19. 19.
    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:
  20. 20.
    Haverkort, B.R., Hermanns, H., Katoen, J.P.: On the use of model checking techniques for dependability evaluation. In: SRDS, pp. 228–237 (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Husain Aljazzar
    • 1
  • Stefan Leue
    • 1
  1. 1.Department of Computer and Information ScienceUniversity of KonstanzGermany

Personalised recommendations