Model checking of continuous-time Markov chains against timed automata specifications

Logical Methods in Computer Science

Volumn 7, Issue 1, 2011, Pages

  Chen, Taolue ^a   Han, Tingting ^b   Katoen, Joost Pieter ^a,b   Mereacre, Alexandru ^b  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Continuous time Markov chains; Deterministic timed automata; Linear time specification; Model checking; Piecewise deterministic Markov processes

Indexed keywords

AUTOMATA THEORY; CHAINS; CLOCKS; CONTINUOUS TIME SYSTEMS; INTEGRAL EQUATIONS; MARKOV PROCESSES; ORDINARY DIFFERENTIAL EQUATIONS; SPECIFICATIONS;

CONTINUOUS TIME MARKOV CHAIN; LINEAR TIME SPECIFICATION; PIECEWISE DETERMINISTIC MARKOV PROCESS; STRONGLY CONNECTED COMPONENT; SYSTEM OF PARTIAL DIFFERENTIAL EQUATIONS; TIMED AUTOMATA; TIMED AUTOMATA SPECIFICATIONS; VOLTERRA INTEGRAL EQUATIONS;

MODEL CHECKING;

EID: 79955401623     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-7(1:12)2011     Document Type: Article

References (25)

1. R. Alur and D. L. Dill. A theory of timed automata. Theor. Comput. Sci., 126(2):183-235, 1994.
2. G. B. Arfken and H. J. Weber. Mathematical Methods for Physicists (4th ed.). Academic Press, 1995.
3. A. Aziz, K. Sanwal, V. Singhal, and R. K. Brayton. Model-checking continous-time Markov chains. ACM Trans. Comput. Log., 1(1):162-170, 2000.
4. C. Baier, N. Bertrand, P. Bouyer, T. Brihaye, and M. Größer. Probabilistic and topological semantics for timed automata. In FSTTCS, LNCS 4855, pages 179-191, 2007.
5. C. Baier, N. Bertrand, P. Bouyer, T. Brihaye, and M. Grösser. Almost-sure model checking of infinite paths in one-clock timed automata. In LICS, pages 217-226, 2008.
6. C. Baier, L. Cloth, B. R. Haverkort, M. Kuntz, and M. Siegle. Model checking Markov chains with actions and state labels. IEEE Trans. Software Eng., 33(4):209-224, 2007.
7. C. Baier, B. R. Haverkort, H. Hermanns, and J.-P. Katoen. Model-checking algorithms for continuous time Markov chains. IEEE Trans. Software Eng., 29(6):524-541, 2003.
8. C. Baier and J.-P. Katoen. Principles of Model Checking. MIT Press, 2008.
9. B. Bérard, A. Petit, V. Diekert, and P. Gastin. Characterization of the expressive power of silent transitions in timed automata. Fundam. Inform., 36(2-3):145-182, 1998.
10. N. Bertrand, P. Bouyer, T. Brihaye, and N. Markey. Quantitative model-checking of one-clock timed automata under probabilistic semantics. In QEST, pages 55-64, 2008.
11. T. Chen, T. Han, J.-P. Katoen, and A. Mereacre. Quantitative model checking of continuous-time Markov chains against timed automata specification. In LICS, pages 309-318, 2009.
12. C. Corduneanu. Integral Equations and Applications. Cambridge University Press, 1991.
13. O. L. Costa and M. H. Davis. Approximations for optimal stopping of a piecewise-deterministic process. Math. Control Signals Systems, 1(2):123-146, 1988.
14. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. J. ACM, 42(4):857-907, 1995.
15. M. H. A. Davis. Piecewise-deterministic Markov processes: A general class of non-diffusion stochastic models. Journal of the Royal Statistical Society (B), 46(3):353-388, 1984.
16. M. H. A. Davis. Markov Models and Optimization. Chapman and Hall, 1993.
17. S. Donatelli, S. Haddad, and J. Sproston. Model checking timed and stochastic properties with CSLTA. IEEE Trans. Software Eng., 35(2):224-240, 2009.
18. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Asp. Comput., 6(5):512-535, 1994.
19. A. Hinton, M. Z. Kwiatkowska, G. Norman, and D. Parker. PRISM: A tool for automatic verification of probabilistic systems. In TACAS, LNCS 3920, pages 441-444, 2006.
20. 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 QEST, pages 167-176, 2009.
21. R. Koymans. Specifying real-time properties with metric temporal logic. Real-Time Systems, 2(4):255-299, 1990.
22. M. Z. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Automatic verification of real-time systems with discrete probability distributions. Theor. Comput. Sci., 282(1):101-150, 2002.
23. S. M. Lenhart and Y.-C. Liao. Integro-differential equations associated with optimal stopping time of a piecewise-deterministic process. Stochastics, 15(3):183-207, 1985.
24. S. M. Lenhart and N. Yamada. Perron's method for viscosity solutions associated with piece wise deterministic processes. Funkcialaj Ekvacioj, 34:173-186, 1991.
25. M. Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In FOCS, pages 327-338, 1985.