Model checking probabilistic timed automata with one or two clocks

Logical Methods in Computer Science

Volumn 4, Issue 3, 2008, Pages

  Jurdzinski, Marcin ^a   Laroussinie, François ^b   Sproston, Jeremy ^c  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c UNIVERSITY OF TURIN   (Italy)

Author keywords

Probabilistic model checking; Probabilistic systems; Temporal logic; Timed automata

Indexed keywords

DISCRETE PROBABILITY DISTRIBUTION; MODEL CHECKING PROBLEM; MODEL-CHECKING ALGORITHMS; PROBABILISTIC MODEL CHECKING; PROBABILISTIC SYSTEMS; PROBABILISTIC TIMED AUTOMATA; TIMED AUTOMATA; TIMED TEMPORAL LOGIC; MODEL CHECKING ALGORITHM;

CLOCKS; MODEL CHECKING; PROBABILITY DISTRIBUTIONS; TEMPORAL LOGIC; AUTOMATA THEORY; COMPUTER CIRCUITS; PROBABILITY;

AUTOMATA THEORY; MODEL CHECKING;

EID: 70349879267     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-4(3:12)2008     Document Type: Article

References (35)

1. [AB06] R. Alur and M. Bernadsky. Bounded model checking for GSMP models of stochastic real-time systems. In Proc. of the 9th International Workshop on Hybrid Systems Computation and Control (HSCC'06), volume 3927 of LNCS, pages 19-33. Springer, 2006.
2. [ACD91] R. Alur, C. Courcoubetis, and D. L. Dill. Model-checking for probabilistic real-time systems. In Proc. of the 18th International Conference on Automata, Languages and Programming (ICALP'91), volume 510 of LNCS, pages 115-136. Springer, 1991.
3. [ACD93] R. Alur, C. Courcoubetis, and D. L. Dill. Model-checking in dense real-time. Information and Computation, 104(1): 2-34, 1993.
4. [AD94] R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2): 183-235, 1994.
5. [ADOW05] P. A. Abdulla, J. Deneux, J. Ouaknine, and J. Worrell. Decidability and complexity results for timed automata via channel machines. In Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), volume 3580 of LNCS, pages 1089-1101. Springer, 2005.
6. [ATP04] R. Alur, S. La Torre, and G. Pappas. Optimal paths in weighted timed automata. Theoretical Computer Science, 318(3): 297-322, 2004.
7. [BCH+07] C. Baier, L. Cloth, B. Haverkort, M. Kuntz, and M. Siegle. Model checking action-and statelabelled Markov chains. IEEE Transactions on Software Engineering, 33(4): 209-224, 2007.
8. [BdA95] A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Proc. of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'95), volume 1026 of LNCS, pages 499-513. Springer, 1995.
9. [BDL+06] G. Behrmann, A. David, K. G. Larsen, J. Håkansson, P. Pettersson, W. Yi, and M. Hendriks. UPPAAL 4. 0. In Proc. of the 3rd International Conference on Quantitative Evaluation of Systems (QEST'06), pages 125-126. IEEE Computer Society Press, 2006.
10. [BHHK03] C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model-checking algorithms for continuous-time Markov chains. IEEE Transactions on Software Engineering, 29(6): 524-541, 2003.
11. [BK98] C. Baier and M. Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11(3): 125-155, 1998.
12. [CGP99] E. M. Clarke, O. Grumberg, and D. Peled. Model checking. MIT Press, 1999.
13. [CJH03] K. Chatterjee, M. Jurdziński, and T. Henzinger. Simple stochastic parity games. In Proc. of the 12th International Conference on Computer Science Logic (CSL'03), volume 2803 of LNCS, pages 100-113. Springer, 2003.
14. [CKS81] A. K. Chandra, D. Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM, 28(1): 114-133, 1981.
15. [CY95] C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4): 857-907, 1995.
16. [dA97a] L. de Alfaro. Formal verification of probabilistic systems. PhD thesis, Stanford University, Department of Computer Science, 1997.
17. [dA97b] L. de Alfaro. Temporal logics for the specification of performance and reliability. In Proc. of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS'97), volume 1200 of LNCS, pages 165-176. Springer, 1997.
18. [DHS07] S. Donatelli, S. Haddad, and J. Sproston. CSLTA: an expressive logic for continuous-timeMarkov chains. In Proceedings of the 4th International Conference on Quantitative Evaluation of Systems (QEST'07), pages 31-40. IEEE Computer Society Press, 2007.
19. [DKN04] C. Daws, M. Kwiatkowska, and G. Norman. Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM. Software Tools for Technology Transfer, 5(2-3): 221-236, 2004.
20. [HJ94] H. A. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6(5): 512-535, 1994.
21. [Jen96] H. E. Jensen. Model checking probabilistic real time systems. In Proc. of the 7th Nordic Workshop on Programming Theory, pages 247-261. Chalmers Institute of Technology, 1996.
22. [KNPS06] M. Kwiatkowska, G. Norman, D. Parker, and J. Sproston. Performance analysis of probabilistic timed automata using digital clocks. Formal Methods in System Design, 29: 33-78, 2006.
23. [KNSS02] M. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science, 286: 101-150, 2002.
24. [LMO06] F. Laroussinie, N. Markey, and G. Oreiby. Model checking timed ATL for durational concurrent game structures. In Proc. of the 4th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'06), volume 4202 of LNCS, pages 245-259. Springer, 2006.
25. [LMS04] F. Laroussinie, N. Markey, and Ph. Schnoebelen. Model checking timed automata with one or two clocks. In Proc. of the 15th International Conference on Concurrency Theory (CONCUR'04), volume 3170 of LNCS, pages 387-401. Springer, 2004.
26. [LMS05] F. Laroussinie, N. Markey, and Ph. Schnoebelen. Efficient timed model checking for discrete-time systems. Theoretical Computer Science, 353(1-3): 249-271, 2005.
27. [LS05] F. Laroussinie and J. Sproston. Model checking durational probabilistic systems. In Proc. of the 8th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'05), volume 3441 of LNCS, pages 140-154. Springer, 2005.
28. [LS07] F. Laroussinie and J. Sproston. State explosion in almost-sure probabilistic reachability. Information Processing Letters, 102(6): 236-241, June 2007.
29. [LW05] S. Lasota and I. Walukiewicz. Alternating timed automata. In Proc. of the 8th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'05), volume 3441 of LNCS, pages 299-314. Springer, 2005.
30. [PT87] C. Papadimitriou and J. Tsitsiklis. The complexity of Markov decision processes. Mathematics of Operations Research, 12(3): 441-450, 1987.
31. [SL95] R. Segala and N. A. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2): 250-273, 1995.
32. [Spr01] J. Sproston. Model checking for probabilistic timed and hybrid systems. PhD thesis, University of Birmingham, School of Computer Science, 2001.
33. [Sto02] M. Stoelinga. Alea jacta est: verification of probabilistic, real-time and parametric systems. PhD thesis, University of Nijmegen, the Netherlands, April 2002.
34. [TYB05] S. Tripakis, S. Yovine, and A. Bouajjani. Checking timed Büchi automata emptiness efficiently. Formal Methods in System Design, 26(3): 267-292, 2005.
35. [Var85] M. Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. of the 16th Annual Symposium on Foundations of Computer Science (FOCS'85), pages 327-338. IEEE Computer Society Press, 1985.