Efficient CTMC Model Checking of Linear Real-Time Objectives

This paper makes verifying continuous-time Markov chains (CTMCs) against deterministic timed automata (DTA) objectives practical. We show that verifying 1-clock DTA can be done by analyzing subgraphs of the product of CTMC C and the region graph of DTA A. This improves upon earlier results and allows to only use standard analysis algorithms. Our graph decomposition approach naturally enables bisimulation minimization as well as parallelization. Experiments with various examples confirm that these optimizations lead to significant speed-ups. We also report on experiments with multiple-clock DTA objectives. The objectives and the size of the problem instances that can be checked with our prototypical tool go (far) beyond what could be checked so far.

[1]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[2]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[3]  Paul Gastin,et al.  Characterization of the Expressive Power of Silent Transitions in Timed Automata , 1998, Fundam. Informaticae.

[4]  Boudewijn R. Haverkort,et al.  Performance Evaluation of Polling-Based Communication Systems Using SPNs , 1999, Application of Petri Nets to Communication Networks.

[5]  William H. Sanders,et al.  Optimal state-space lumping in Markov chains , 2003, Inf. Process. Lett..

[6]  Christel Baier,et al.  Model-Checking Algorithms for Continuous-Time Markov Chains , 2002, IEEE Trans. Software Eng..

[7]  W. S. Hlavacek,et al.  Mathematical and computational models of immune-receptor signalling , 2004, Nature Reviews Immunology.

[8]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[9]  Joost-Pieter Katoen,et al.  Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking , 2007, TACAS.

[10]  Christel Baier,et al.  Model Checking Markov Chains with Actions and State Labels , 2007, IEEE Transactions on Software Engineering.

[11]  Matthias Kuntz,et al.  Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking , 2008, Electron. Notes Theor. Comput. Sci..

[12]  Nathalie Bertrand,et al.  Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics , 2008, 2008 Fifth International Conference on Quantitative Evaluation of Systems.

[13]  Christel Baier,et al.  Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[14]  Joost-Pieter Katoen,et al.  The Ins and Outs of the Probabilistic Model Checker MRMC , 2009, 2009 Sixth International Conference on the Quantitative Evaluation of Systems.

[15]  Joost-Pieter Katoen,et al.  Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[16]  Serge Haddad,et al.  Model Checking Timed and Stochastic Properties with CSL^{TA} , 2009, IEEE Transactions on Software Engineering.

[17]  Joost-Pieter Katoen,et al.  Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[18]  Jan Kretínský,et al.  Stochastic Real-Time Games with Qualitative Timed Automata Objectives , 2010, CONCUR.

[19]  Susanna Donatelli,et al.  Model checking CSLTA with Deterministic and Stochastic Petri Nets , 2010, 2010 IEEE/IFIP International Conference on Dependable Systems & Networks (DSN).

[20]  Christel Baier,et al.  Performance evaluation and model checking join forces , 2010, Commun. ACM.

[21]  Paul Gastin,et al.  CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings , 2010, CONCUR.

[22]  Giuliana Franceschinis,et al.  Simple O(m logn) Time Markov Chain Lumping , 2010, TACAS.

[23]  Piotr Faliszewski,et al.  Using complexity to protect elections , 2010, Commun. ACM.

[24]  W. Marsden.  I and J , 2012 .