Automata-based CSL model checking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6756 LNCS, Issue PART 2, 2011, Pages 271-282

  Zhang, Lijun ^a   Jansen, David N ^b   Nielson, Flemming ^a   Hermanns, Holger ^c  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^c SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BRAYTON; CONTINUOUS TIME; CONTINUOUS TIME MARKOV CHAIN; CSL MODEL; DECISION ALGORITHMS; DECISION PROCEDURE; EXPONENTIAL COMPLEXITY; MODEL CHECKING PROBLEM; POLYNOMIAL-TIME; STOCHASTIC LOGIC; UNIFORMIZATION;

APPROXIMATION ALGORITHMS; COMPUTABILITY AND DECIDABILITY; CONTINUOUS TIME SYSTEMS; MARKOV PROCESSES; POLYNOMIAL APPROXIMATION; STOCHASTIC MODELS; TRANSIENT ANALYSIS;

MODEL CHECKING;

EID: 79959925236     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22012-8_21     Document Type: Conference Paper

References (16)

1. Aziz, A., Sanwal, K., Singhal, V., Brayton, R.: Verifying continuous time Markov chains. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 269-276. Springer, Heidelberg (1996)
2. Aziz, A., Sanwal, K., Singhal, V., Brayton, R.: Model-checking continous-time Markov chains. ACM Trans. Comput. Log. 1(1), 162-170 (2000)
3. Baier, C., Cloth, L., Haverkort, B.R., Kuntz, M., Siegle, M.: Model checking Markov chains with actions and state labels. IEEE Trans. Softw. Eng. 33(4), 209-224 (2007)
4. Baier, C., Haverkort, B., Hermanns, H., Katoen, J.P.: Model-checking algorithms for continuous-time Markov chains. IEEE Trans. Softw. Eng. 29(6), 524-541 (2003)
5. Ballarini, P., Mardare, R., Mura, I.: Analysing biochemical oscillation through probabilistic model checking. Electr. Notes Theor. Comp. Sc. 229(1), 3-19 (2009)
6. Chen, T., Han, T., Katoen, J.P., Mereacre, A.: Quantitative model checking of continuous-time Markov chains against timed automata specifications. In: Twentyfourth Annual IEEE Symposium on Logic in Computer Science, pp. 309-318. IEEE Comp. Soc., Los Alamitos (2009)
7. Donatelli, S., Haddad, S., Sproston, J.: Model checking timed and stochastic properties with CSLTA. IEEE Trans. Software Eng. 35(2), 224-240 (2009)
8. Grassmann, W.K.: Finding transient solutions in Markovian event systems through randomization. In: Stewart, W.J. (ed.) Numerical Solution ofMarkov Chains. Probability, Pure and Applied, vol. 8, pp. 357-371. Marcel Dekker, New York (1991)
9. Hinton, A., Kwiatkowska, M., Norman, G., Parker, D.: PRISM: a tool for automatic verification of probabilistic systems. In: Hermanns, H. (ed.) TACAS 2006. LNCS, vol. 3920, pp. 441-444. Springer, Heidelberg (2006)
10. Jansen, D.N.: Erratum to: Model-checking continuous-time Markov chains by Aziz et al. (February 2011), http://arxiv.org/abs/1102.2079v1
11. Katoen, J.P., Zapreev, I.S., Hahn, E.M., Hermanns, H., Jansen, D.N.: The ins and outs of the probabilistic model checker MRMC. Performance Evaluation 68(2), 90-104 (2011)
12. Safra, S.: On the complexity of ω-automata. In: 29th Ann. Symp. on Foundations of Computer Science, pp. 319-327. IEEE Comp. Soc., Los Alamitos (1988)
13. Spieler, D.: Model checking of oscillatory and noisy periodic behavior in Markovian population models. Master's thesis, Saarland University, Saarbrücken (2009), http://alma.cs.uni-sb.de/data/david/mt.pdf
14. Stewart, W.J.: Introduction to the numerical solution of Markov chains. Princeton Univ. Pr., Princeton (1994)
15. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Symposium on Logic in Computer Science, pp. 332-345. IEEE Comp. Soc., Los Alamitos (1986)
16. Zhang, L., Jansen, D.N., Nielson, F., Hermanns, H.: Automata-based CSL model checking (April 2011), http://arxiv.org/abs/1104.4983