DTMC model checking by SCC reduction

Proceedings - 7th International Conference on the Quantitative Evaluation of Systems, QEST 2010

Volumn , Issue , 2010, Pages 37-46

  Ábrahám, Erika ^a   Jansen, Nils ^a   Wimmer, Ralf ^b   Katoen, Joost Pieter ^a   Becker, Bernd ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DIAGNOSTIC INFORMATION; DISCRETE TIME MARKOV CHAINS; MODEL CHECKING ALGORITHM; PROBABILISTIC SYSTEMS; STRONGLY CONNECTED COMPONENT;

ABSTRACTING; ALGORITHMS; HAND TOOLS; MARKOV PROCESSES; MATHEMATICAL MODELS;

MODEL CHECKING;

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

References (28)

1. C. Baier and J.-P. Katoen, Principles of Model Checking. The MIT Press, 2008.
2. E. M. Clarke, "The birth of model checking," in 25 Years of Model Checking - History, Achievements, Perspectives, ser. Lecture Notes in Computer Science. Springer, 2008, vol. 5000, pp. 1-26.
3. E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith, " Counterexampleguided abstraction refinement," in 12th Int'l Conf. on Computer Aided Verification (CAV), ser. Lecture Notes in Computer Science, vol. 1855. Springer, 2000, pp. 154-169.
4. H. Hermanns, B. Wachter, and L. Zhang, "Probabilistic CEGAR," in Int'l Conf. on Computer Aided Verification (CAV), ser. Lecture Notes in Computer Science, vol. 5123. Springer, 2008, pp. 162-175.
5. 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.
6. J.-P. Katoen, I. S. Zapreev, E. M. Hahn, H. Hermanns, and D. N. Jansen, "The ins and outs of the probabilistic model checker MRMC," in 6th Int'l Conf. on Quantitative Evaluation of Systems (QEST). IEEE Computer Society, 2009, pp. 167-176.
7. A. Hinton, M. Kwiatkowska, G. Norman, and D. Parker, "PRISM: A tool for automatic verification of probabilistic systems," in 12th Int'l Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), ser. Lecture Notes in Computer Science, vol. 3920. Springer, 2006, pp. 441-444.
8. H. L. S. Younes and R. G. Simmons, "Statistical probabilistic model checking with a focus on time-bounded properties," Information and Computation, vol. 204, no. 9, pp. 1368-1409, 2006.
9. D. E. Rabih and N. Pekergin, "Statistical model checking using perfect simulation," in 7th Int'l Symp. on Automated Technology for Verification and Analysis (ATVA), ser. Lecture Notes in Computer Science, no. 5799. Springer, Oct. 2009, pp. 120-134.
10. H. Aljazzar and S. Leue, "Directed explicit state-space search in the generation of counterexamples for stochastic model checking," IEEE Transactions on Software Engineering, vol. 36, no. 1, pp. 37-60, 2010.
11. M. E. Andrés, P. D'Argenio, and P. van Rossum, "Significant iagnostic counterexamples in probabilistic model checking," in Haifa Verification Conference, ser. Lecture Notes in Computer Science, vol. 5394. Springer, Oct. 2008, pp. 129-148.
12. T. Han, J.-P. Katoen, and B. Damman, "Counterexample generation in probabilistic model checking," IEEE Transactions on Software Engineering, vol. 35, no. 2, pp. 241-257, Mar. 2009.
13. R. Wimmer, B. Braitling, and B. Becker, "Counterexample generation for discrete-time Markov chains using bounded model checking," in 10th Int'l Conf. on Verification, Model Checking, and Abstract Interpretation (VMCAI), ser. Lecture Notes in Computer Science, vol. 5403. Springer, Jan. 2009, pp. 366-380.
14. M. Schmalz, D. Varacca, and H. Völzer, "Counterexamples in probabilistic LTL model checking for Markov chains," in 20th Int'l Conf. on Concurrency Theory, ser. Lecture Notes in Computer Science, vol. 5710. Springer, Sep. 2009, pp. 587-602.
15. H. le Guen and R. A. Marie, "Visiting probabilities in non-irreducible Markov chains with strongly connected components," Int'l Journal of Simulation - Systems, Science & Technology, vol. 3, no. 3-4, pp. 38-46, Dec. 2002.
16. C. D. Meyer, "Stochastic complementation, uncoupling markov chains, and the theory of nearly reducible systems," SIAM Rev, pp. 240-272, 1989.
17. R. Tarjan, "Depth-first search and linear graph algorithms," SIAM Journal on Computing, vol. 1, no. 2, pp. 146-160, 1970.
18. A. Itai and M. Rodeh, "Symmetry breaking in distributed networks," Information and Computation, vol. 88, no. 1, pp. 60-87, 1990.
19. M. K. Reiter and A. D. Rubin, "Crowds: Anonymity for web transactions," ACM Transactions on Information and System Security, vol. 1, no. 1, pp. 66-92, 1998.
20. D.-S. Du and K. I. Kho, Problem Solving in Automata, Languages, and Complexity. John Wiley and Sons, 2001.
21. P. Linz, An Introduction to Formal Languages and Automata. Jones and Bartless, 2001.
22. C. Daws, "Symbolic and parametric model checking of discrete-time Markov chains," in 1st Int'l Colloquium on Theoretical Aspects of Computing (ICTAC), ser. Lecture Notes in Computer Science, vol. 3407. Springer, Sep. 2004, pp. 280-294.
23. B. Damman, T. Han, and J.-P. Katoen, "Regular expressions for PCTL counterexamples," in 5th Int'l Conf. on Quantitative Evaluation of Systems (QEST). IEEE Computer Society, Sep. 2008, pp. 179-188.
24. E. M. Hahn, H. Hermanns, and L. Zhang, "Probabilistic reachability for parametric Markov models," in 16th Int'l SPIN Workshop on Model Checking Software (SPIN), ser. Lecture Notes in Computer Science, vol. 5578. Springer, 2009, pp. 88-106.
25. Y.-S. Han and D. Wood, "Obtaining shorter regular expressions from finite-state automata," Theor. Comput. Sci., vol. 370, no. 1-3, pp. 110-120, 2007.
26. th Int'l Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), ser. Lecture Notes in Computer Science, vol. 4424. Springer, 2007, pp. 72-86.
27. J.-P. Katoen, M. Khattri, and I. S. Zapreev, "A Markov reward model checker," in Int'l Conf. on Quantitative Evaluation of Systems (QEST). IEEE Computer Society, 2005, pp. 243-244.
28. PRISM Website, 2010, http://prismmodelchecker.org.