Efficient CSL model checking using stratification

Logical Methods in Computer Science

Volumn 8, Issue 2, 2012, Pages

  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

Approximation algorithm; Continuous stochastic logic; Continuous time markov chains; Model checking; Stratification

Indexed keywords

APPROXIMATION ALGORITHMS; CHAINS; COMPUTABILITY AND DECIDABILITY; COMPUTER CIRCUITS; CONTINUOUS TIME SYSTEMS; LINEAR TRANSFORMATIONS; MARKOV PROCESSES; POLYNOMIAL APPROXIMATION; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; TRANSIENT ANALYSIS;

CONTINOUS TIME; CONTINOUS TIME MARKOV CHAIN; CONTINUOUS STOCHASTIC LOGIC; LOGIC MODEL CHECKING; MODEL CHECKING PROBLEM; MODELS CHECKING; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; STOCHASTIC LOGIC; STOCHASTIC LOGIC MODELS; STRATIFICATION;

MODEL CHECKING;

EID: 84868559640     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-8(2:17)2012     Document Type: Article

References (22)

1. A. Aziz, K. Sanwal, V. Singhal, and R. Brayton. Verifying continuous time Markov chains. In R. Alur and T. A. Henzinger, editors, Computer aided verification: ...CAV, volume 1102 of LNCS, pages 269-276. Springer, Berlin, 1996.
2. A. Aziz, K. Sanwal, V. Singhal, and R. Brayton. Model-checking continous-time Markov chains. ACM trans. comput. log., 1(1):162-170, 2000.
3. C. Baier, L. Cloth, B. R. Haverkort, M. Kuntz, and M. Siegle. Model checking Markov chains with actions and state labels. IEEE trans. softw. eng., 33(4):209-224, 2007.
4. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model checking continuous-time Markov chains by transient analysis. In E. A. Emerson and A. P. Sistla, editors, Computer aided verification: ...CAV, volume 1855 of LNCS, pages 358-372, Berlin, 2000. Springer.
5. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model-checking algorithms for continuous-time Markov chains. IEEE trans. softw. eng., 29(6):524-541, 2003.
6. P. Ballarini, R. Mardare, and I. Mura. Analysing biochemical oscillation through probabilistic model checking. Electr. notes theor. comp. sc., 229(1):3-19, 2009.
7. T. Chen, T. Han, J.-P. Katoen, and A. Mereacre. Model checking of continuous-time markov chains against timed automata specifications. Logical Methods in Computer Science, 7(1), 2011.
8. S. Donatelli, S. Haddad, and J. Sproston. Model checking timed and stochastic properties with CSLTA. IEEE trans. software eng., 35(2):224-240, 2009.
9. B. L. Fox and P. W. Glynn. Computing Poisson probabilities. Commun. ACM, 31(4):440-445, 1988.
10. W. K. Grassmann. Finding transient solutions in Markovian event systems through randomization. In W. J. Stewart, editor, Numerical solution of Markov chains, volume 8 of Probability, pure and applied, pages 357-371, New York, 1991. Marcel Dekker.
11. E. M. Hahn, H. Hermanns, B. Wachter, and L. Zhang. Time-bounded model checking of infinite-state continuous-time Markov chains. Fundam. inform., 95(1):129-155, 2009.
12. T. A. Henzinger, M. Mateescu, and V. Wolf. Sliding window abstraction for infinite Markov chains. In A. Bouajjani and O. Maler, editors, Computer aided verification: ...CAV, volume 5643 of LNCS, pages 337-352, Berlin, 2009. Springer.
13. D. N. Jansen. Erratum to: Model-checking continuous-time Markov chains by Aziz et al. http://arxiv.org/abs/1102.2079v1, February 2011.
14. D. N. Jansen. Understanding Fox and Glynn's "Computing Poisson probabilities". Technical Report ICIS-R11001, Radboud University Nijmegen, February 2011.
15. J.-P. Katoen, D. Klink, M. Leucker, and V. Wolf. Three-valued abstraction for continuous-time Markov chains. In W. Damm and H. Hermanns, editors, Computer aided verification: ...CAV, volume 4590 of LNCS, pages 311-324, Berlin, 2007. Springer.
16. 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. Performance evaluation, 68(2):90-104, 2011.
17. M. Z. Kwiatkowska, G. Norman, and D. Parker. PRISM 4.0: Verification of probabilistic real-time systems. In G. Gopalakrishnan and S. Qadeer, editors, Computer aided verification: ...CAV, volume 6806 of LNCS, pages 585-591. Springer, 2011.
18. P. Panangaden. Labelled Markov processes. Imperial College Press, London, 2009.
19. D. Spieler. Model checking of oscillatory and noisy periodic behavior in Markovian population models. Master's thesis, Saarland University, Saarbr̈ucken, 2009. http://alma.cs.uni-sb.de/data/david/mt.pdf.
20. W. J. Stewart. Introduction to the numerical solution of Markov chains. Princeton Univ. Pr., Princeton, N. J., 1994.
21. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Symposium on logic in computer science, pages 332-345, Los Alamitos, Calif., 1986. IEEE Comp. Soc.
22. L. Zhang, D. N. Jansen, F. Nielson, and H. Hermanns. Automata-based CSL model checking. In L. Aceto, M. Henzinger, and J. Sgall, editors, Automata, languages and programming: ...ICALP. Part II, volume 6756 of LNCS, pages 271-282, Berlin, 2011. Springer.