Stochastic games for verification of probabilistic timed automata

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

Volumn 5813 LNCS, Issue , 2009, Pages 212-227

  Kwiatkowska, Marta ^a   Norman, Gethin ^a   Parker, David ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; AUTOMATA THEORY; GAME THEORY; PROBABILITY; ROBOTS; STOCHASTIC SYSTEMS; TIME SHARING SYSTEMS;

ABSTRACTION REFINEMENT; AUTOMATIC METHOD; FORMAL MODELLING; LOWER AND UPPER BOUNDS; NON-PROBABILISTIC; PERFORMANCE AND SCALABILITIES; PROBABILISTIC TIMED AUTOMATA; PROBABILITY BOUND;

REAL TIME SYSTEMS;

EID: 70350459891     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04368-0_17     Document Type: Conference Paper

References (24)

1. Beauquier, D.: Probabilistic timed automata. Theoretical Computer Science 292(1), 65-84 (2003)
2. Bouyer, P.: Untameable timed automata! In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 620-631. Springer, Heidelberg (2003)
3. Chen, T., Han, T., Katoen, J.-P.: Time-abstracting bisimulation for probabilistic timed automata. In: Proc. TASE 2008, pp. 177-184. IEEE CS Press, Los Alamitos (2008)
4. Condon, A.: The complexity of stochastic games. Inf. and Comp. 96(2), 203-224 (1992)
5. Daws, C., Kwiatkowska, M., Norman, G.: Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM. International Journal on Software Tools for Technology Transfer (STTT) 5(2-3), 221-236 (2004)
6. Daws, C., Olivero, A., Tripakis, S., Yovine, S.: The tool Kronos. In: Alur, R., Sontag, E.D., Henzinger, T.A. (eds.) HS 1995. LNCS, vol. 1066, pp. 208-219. Springer, Heidelberg (1996)
7. Dierks, H., Kupferschmid, S., Larsen, K.G.: Automatic abstraction refinement for timed automata. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol. 4763, pp. 114-129. Springer, Heidelberg (2007)
8. Henzinger, T., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. Inf. and Comp. 111(2), 193-244 (1994)
9. Jensen, H.: Model checking probabilistic real time systems. In: Proc. 7th Nordic Workshop on Programming Theory, pp. 247-261 (1996)
10. Kattenbelt, M., Kwiatkowska, M., Norman, G., Parker, D.: A game-based abstraction-refinement framework for Markov decision processes. Technical Report RR-08-06, Oxford University Computing Laboratory (February 2008)
11. Kattenbelt, M., Kwiatkowska, M., Norman, G., Parker, D.: Abstraction refinement for probabilistic software. In: Jones, N.D., Müller-Olm, M. (eds.) VMCAI 2009. LNCS, vol. 5403, pp. 182-197. Springer, Heidelberg (2009)
12. Kemper, S., Platzer, A.: SAT-based abstraction refinement for real-time systems. In: Proc. FACS 2006. ENTCS, vol. 182, pp. 107-122 (2007)
13. Kwiatkowska, M., Norman, G., Parker, D.: Game-based abstraction for Markov decision processes. In: Proc. QEST 2006, pp. 157-166. IEEE CS Press, Los Alamitos (2006)
14. Kwiatkowska, M., Norman, G., Parker, D.: Stochastic games for verification of probabilistic timed automata. Technical Report RR-09-05, Oxford University Computing Laboratory (2009)
15. Kwiatkowska, M., Norman, G., Parker, D., Sproston, J.: Performance analysis of probabilistic timed automata using digital clocks. Formal Methods in System Design 29, 33-78 (2006)
16. Kwiatkowska, M., Norman, G., Segala, R., Sproston, J.: Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science 282, 101-150 (2002)
17. Kwiatkowska, M., Norman, G., Sproston, J., Wang, F.: Symbolic model checking for probabilistic timed automata. Inf. and Comp. 205(7), 1027-1077 (2007)
18. Larsen, K., Pettersson, P., Yi, W.: UPPAAL in a nutshell. International Journal on Software Tools for Technology Transfer 1(1-2), 134-152 (1997)
19. Puterman, M.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley and Sons, Chichester (1994)
20. Shapley, L.: Stochastic games. Proc. National Academy of Science 39, 1095-1100 (1953)
21. Sorea, M.: Lazy approximation for dense real-time systems. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol. 3253, pp. 363- 378. Springer, Heidelberg (2004)
22. Tripakis, S.: The formal analysis of timed systems in practice. PhD thesis, Université Joseph Fourier (1998)
23. Tripakis, S.: Verifying progress in timed systems. In: Katoen, J.-P. (ed.) AMASTARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol. 1601, pp. 299-314. Springer, Heidelberg (1999)
24. Tripakis, S., Yovine, S., Bouajjani, A.: Checking timed Büchi automata emptiness efficiently. Formal Methods in System Design 26(3), 267-292 (2005)