Generation of counterexamples for model checking of Markov Decision Processes

QEST - 6th International Conference on the Quantitative Evaluation of Systems

Volumn , Issue , 2009, Pages 197-206

  Aljazzar, Husain ^a   Leue, Stefan ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

Counterexamples; Directed search; K shortest paths search; K*; Markov Decision Processes; Stochastic model checking

Indexed keywords

COUNTEREXAMPLES; DEBUGGING TOOLS; DIAGNOSTIC INFORMATION; MARKOV DECISION PROCESSES; MODEL CHECKER;

MARKOV PROCESSES; PROGRAM DIAGNOSTICS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

MODEL CHECKING;

EID: 74049088688     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2009.10     Document Type: Conference Paper

References (29)

1. E. M. Clarke, O. Grumberg, and D. A. Peled, Model Checking (3rd ed.). The MIT Press, 2001.
2. C. Baier and J.-P. Katoen, Principles of Model Checking. The MIT Press, 2008.
3. M. Y. Vardi, "Automatic verification of probabilistic concurrent finite-state programs," in 26th Annual Symposium on Foundations of Computer Science (FOCS 1985). IEEE, 1985, pp. 327-338.
4. H. Hansson and B. Jonsson, "A logic for reasoning about time and reliability," Formal Aspects of Computing, vol. 6, no. 5, pp. 512-535, 1994.
5. C. Courcoubetis and M. Yannakakis, "The complexity of probabilistic verification." J. ACM, vol. 42, no. 4, pp. 857-907, 1995.
6. A. Aziz, V. Singhal, and F. Balarin, "It usually works: The temporal logic of stochastic systems." in CAV 1995, ser. LNCS vol. 939. Springer, 1995, pp. 155-165.
7. A. Bianco and L. de Alfaro, "Model checking of probabalistic and nondeterministic systems," in FSTTCS 1995, ser. LNCS vol. 1026. Springer, 1995, pp. 499-513.
8. A. Hinton, M. Kwiatkowska, G. Norman, and D. Parker, "PRISM: A tool for automatic verification of probabilistic systems," in TACAS'06, ser. LNCS vol. 3920. Springer, 2006, pp. 441-444.
9. J.-P. Katoen, M. Khattri, and I. S. Zapreev, "A Markov Reward Model Checker," in QEST '05. IEEE Computer Society, 2005, pp. 243-244.
10. H. Aljazzar, H. Hermanns, and S. Leue, "Counterexamples for timed probabilistic reachability." in FORMATS '05, ser. LNCS vol. 3829. Springer, 2005, pp. 177-195.
11. H. Aljazzar and S. Leue, "Extended directed search for probabilistic timed reachability." in FORMATS '06, ser. LNCS vol. 4202. Springer, 2006, pp. 33-51.
12. C. Baier and M. Z. Kwiatkowska, "Model checking for a probabilistic branching time logic with fairness," Distributed Computing, vol. 11, no. 3, pp. 125-155, 1998.
13. L. de Alfaro, "Formal verification of probabilistic systems," Ph.D. Dissertation, Stanford University, 1997.
14. T. Han and J.-P. Katoen, "Counterexamples in probabilistic model checking," in TACAS '07, 2007.
15. V. M. Jiménez and A. Marzal, "Computing the k shortest paths: A new algorithm and an experimental comparison," in Algorithm Engineering, 1999, pp. 15-29.
16. -, "A lazy version of eppstein's shortest paths algorithm," in WEA '03, ser. LNCS vol. 2647. Springer, 2003, pp. 179-190.
17. D. Eppstein, "Finding the k shortest paths," SIAM J. Computing, vol. 28, no. 2, pp. 652-673, 1998. [Online]. Available: http://dx.doi.org/10.1137/S0097539795290477
18. *: A directed on-the-fly algorithm for finding the k shortest paths," Univ. of Konstanz, Gemany, Tech. Rep. soft-08-03, March 2008, submitted for publication. [Online]. Available: http://www.inf.uni-konstanz.de/soft/research/publications/pdf/soft- 08-03.pdf
19. -, "Debugging of dependability models using interactive visualization of counterexamples." in QEST '08. IEEE Computer Society Press, 2008.
20. -, "Counterexamples for model checking of markov decision processes," Univ. of Konstanz, Gemany, Tech. Rep. soft-08-01, December 2007. [Online]. Available: http://www.ub.uni-konstanz.de/kops/volltexte/2008/ 4530/
21. H. Hermanns, B. Wachter, and L. Zhang, "Probabilistic CEGAR," in Computer Aided Verification, 20th International Conference, CAV 2008, Proceedings, ser. Lecture Notes in Computer Science, vol. 5123. Springer, 2008, pp. 162-175.
22. T. Han, J.-P. Katoen, and B. Damman, "Counterexample generation in probabilistic model checking," IEEE Trans. Softw. Eng., vol. 35, no. 2, pp. 241-257, 2009.
23. M. E. Andrés, P. R. D'Argenio, and P. van Rossum, "Significant diagnostic counterexamples in probabilistic model checking," CoRR, vol. abs/0806.1139, 2008.
24. W. J. Stewart, Introduction to the Numerical Solution of Markov Chains. New Jersey, USA: Princeton University Press, 1994.
25. S. Hart, M. Sharir, and A. Pnueli, "Termination of probabilistic concurrent program," ACM Trans. Program. Lang. Syst., vol. 5, no. 3, pp. 356-380, 1983.
26. R. Segala and N. A. Lynch, "Probabilistic simulations for probabilistic processes," in CONCUR '94, ser. LNCS vol. 836. Springer, 1994, pp. 481-496.
27. S. Edelkamp, S. Jabbar, and A. Lluch-Lafuente, "Costalgebraic heuristic search," in AAAI '05, 2005, pp. 1362-1367.
28. S. Edelkamp, S. Leue, and A. Lluch-Lafuente, "Directed explicit-state model checking in the validation of communication protocols," International Journal on Software Tools for Technology Transfer STTT, vol. 5, no. 2-3, pp. 247-267, 2004.
29. L. Helmink, M. Sellink, and F. Vaandrager, "Proof-checking a data link protocol," in TYPES'93, ser. LNCS vol. 806, H. Barendregt and T. Nipkow, Eds. Springer, 1994, pp. 127-165.