Symbolic model checking for probabilistic timed automata

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

Volumn 3253, Issue , 2004, Pages 293-308

  Kwiatkowska, Marta ^a   Norman, Gethin ^a   Sproston, Jeremy ^b   Wang, Fuzhi ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATION THEORY; FAULT TOLERANCE; MODEL CHECKING; REAL TIME SYSTEMS; TIME SHARING SYSTEMS;

DIFFERENCE BOUND MATRICES; DISCRETE PROBABILITY DISTRIBUTION; EXPLICIT CONSTRUCTIONS; PROBABILISTIC TIMED AUTOMATA; PROTOTYPE IMPLEMENTATIONS; ROOT CONTENTION PROTOCOLS; SYMBOLIC MODEL CHECKING; TIMED COMPUTATION TREE LOGIC;

PROBABILITY DISTRIBUTIONS;

EID: 35048850042     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30206-3_21     Document Type: Article

References (27)

1. Alur, R., Courcoubetis, C., and Dill, D. Model checking in dense real time. Information and Computation, 104(1):2-34, 1993.
2. Alur, R., Courcoubetis, C., Dill, D. L., Halbwachs, N., and Wong-Toi, H. Minimization of timed transition systems. In Proc. CONCUR'92, volume 630 of LNCS. Springer, 1992.
3. Alur, R. and Dill, D. L. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
4. Behrmann, G., David, A., Larsen, K., Möller, O., Pettersson, P., and Yi, W. UP-PAAL - present and future. In Proc. CDC'01. IEEE, 2001.
5. Bianco, A. and de Alfaro, L. Model checking of probabilistic and nondeterministic systems. In Proc. FST&TCS'95, volume 1026 of LNCS, pages 499-513. Springer, 1995.
6. Daws, C. Private communication. 2004.
7. Daws, C., Kwiatkowska, M., and Norman, G. Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM. International Journal on Software Tools for Technology Transfer, 5(2-3):221-236, 2004.
8. Daws, C., Olivero, A., Tripakis, S., and Yovine, S. The tool KRONOS. In Proc. Hybrid Systems III, volume 1066 of LNCS, pages 208-219. Springer, 1996.
9. de Alfaro, L. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997.
10. Dill, D. Timing assumptions and verification of finite-state concurrent systems. In Proc. Automatic Verification Methods for Finite State Systems, volume 407 of LNCS, pages 197-212. Springer, 1990.
11. Hansson, H. and Jonsson, B. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6(4):512-535, 1994.
12. Henzinger, T., Nicollin, X., Sifakis, J., and Yovine, S. Symbolic model checking for real-time systems. Information and Computation, 111(2): 193-244, 1994.
13. IEEE 1394-1995. High Performance Serial Bus Standard. 1995.
14. IEEE 802.3-2002. Carrier Sense Multiple Access with Collision Detection (CSMA/CD) Standard. 2002.
15. Kemeny, J., Snell, J., and Knapp, A. Denumerable Markov Chains. Springer, 1976.
16. Kwiatkowska, M., Norman, G., and Parker, D. PRISM: Probabilistic symbolic model checker. In Proc. TOOLS'02, volume 2324 of LNCS, pages 200-204. Springer, 2002.
17. Kwiatkowska, M., Norman, G., Parker, D., and Sproston, J. Performance analysis of probabilistic timed automata using digital clocks. In Proc. FORMATS'03, volume 2791 of LNCS, pages 105-120. Springer, 2003.
18. Kwiatkowska, M., Norman, G., Segala, R., and Sproston, J. Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science, 282:101-150, 2002.
19. Kwiatkowska, M., Norman, G., and Sproston, J. Symbolic computation of maximal probabilistic reachability. In Proc. CONCUR '01, volume 2154 of LNCS, pages 169-183. Springer, 2001.
20. Kwiatkowska, M., Norman, G., and Sproston, J. Probabilistic model checking of the IEEE 802.11 wireless local area network protocol. In Proc. PAPM/PROBMIV'02, volume 2399 of LNCS, pages 169-187. Springer, 2002.
21. Kwiatkowska, M., Norman, G., and Sproston, J. Probabilistic model checking of deadline properties in the IEEE 1394 FireWire root contention protocol. Formal Aspects of Computing, 14:295-318, 2003.
22. Kwiatkowska, M., Norman, G., and Sproston, J. Symbolic model checking for probabilistic timed automata. Technical Report CSR-03-10, School of Computer Science, University of Birmingham, 2003.
23. PRISM Web site, www.cs.bham.ac.uk/~dxp/prism.
24. Segala, R. Modelling and Verification of Randomized Distributed Real Time Systems. PhD thesis, Massachusetts Institute of Technology, 1995.
25. Simons, D. and Stoelinga, M. Mechanical verification of the IEEE 1394a root contention protocol using Uppaal2k. Springer International Journal of Software Tools for Technology Transfer, 3(4):469-485, 2001.
26. Tripakis, S. L'Analyse Formelle des Systèmes Temporisés en Pratique. PhD thesis, Université Joseph Fourier, 1998.
27. Wang, F., Hwang, G.-D., and Yu, F. TCTL inevitability analysis of dense-time systems. In Proc. CIAA'03, volume 2759 of LNCS, pages 176-187. Springer, 2003.