Quantitative model checking of continuous-time markov chains against timed automata specifications

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2009, Pages 309-318

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

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF TWENTE   (Netherlands)

^c CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS TIME MARKOV CHAIN; FOLLOWING PROBLEM; PIECEWISE DETERMINISTIC MARKOV PROCESS; QUANTITATIVE MODEL CHECKING; REACHABILITY; REAL-TIME PROPERTIES; SYSTEM OF INTEGRAL EQUATIONS; SYSTEM OF LINEAR EQUATIONS; TIMED AUTOMATA; TIMED AUTOMATA SPECIFICATIONS;

AUTOMATA THEORY; COMPUTER SCIENCE; INTEGRAL EQUATIONS; MARKOV PROCESSES; MODEL CHECKING; PROBABILITY; SET THEORY; TRANSLATION (LANGUAGES);

ORDINARY DIFFERENTIAL EQUATIONS;

EID: 70350583090     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2009.21     Document Type: Conference Paper

References (15)

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. Modelchecking 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, 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. 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.
9. 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.
10. T. Chen, T. Han, J.-P. Katoen, and A. Mereacre. Quantitative model checking of continuous-time Markov chains against timed automata specification. Technical report, AIB-2009-2102, RWTH Aachen University, Germany, 2009.
11. C. Corduneanu. Integral Equations and Applications. Cambridge University Press, 1991.
12. M. H. A. Davis. Markov Models and Optimization. Chapman and Hall, 1993.
13. S. Donatelli, S. Haddad, and J. Sproston. Model checking timed and stochastic properties with CSLTA. IEEE Trans. Software Eng., 35(2):224-240, 2009.
14. 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.
15. M. Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In FOCS, pages 327-338, 1985.