Expected reachability-time games

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

Volumn 6246 LNCS, Issue , 2010, Pages 122-136

  Forejt, Vojtěch ^a   Kwiatkowska, Marta ^b   Norman, Gethin ^c   Trivedi, Ashutosh ^b  

^a MASARYK UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY REGIONS; DECISION PROBLEMS; EXPECTED TIME; GENERALISATION; PROBABILISTIC TIMED AUTOMATA; REACHABILITY; SHORTER DELAYS;

DELAY CONTROL SYSTEMS; TIME SHARING SYSTEMS;

CONCURRENCY CONTROL;

EID: 78049395253     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15297-9_11     Document Type: Conference Paper

References (34)

1. Ramadge, P., Wonham, W.: The control of discrete event systems. Proc. IEEE 77 (1) (1989)
2. Asarin, E., Maler, O.: As soon as possible: Time optimal control for timed automata. In: Vaandrager, F. W., van Schuppen, J. H. (eds.) HSCC 1999. LNCS, vol. 1569, pp. 19-30. Springer, Heidelberg (1999)
3. Alur, R., Bernadsky, M., Madhusudan, P.: Optimal reachability for weighted timed games. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 122-133. Springer, Heidelberg (2004)
4. Bouyer, P., Cassez, F., Fleury, E., Larsen, K. G.: Optimal strategies in priced timed game automata. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 148-160. Springer, Heidelberg (2004)
5. Behrmann, G., Cougnard, A., David, A., Fleury, E., Larsen, K., Lime, D.: UPPAAL-Tiga: Time for playing games! In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 121-125. Springer, Heidelberg (2007)
6. Cassez, F., Jessen, J., Larsen, K., Raskin, J., Reynier, P.: Automatic synthesis of robust and optimal controllers: an industrial case study. In: Majumdar, R., Tabuada, P. (eds.) HSCC 2009. LNCS, vol. 5469, pp. 90-104. Springer, Heidelberg (2009)
7. Kwiatkowska, M., Norman, G., Segala, R., Sproston, J.: Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science 282 (2002)
8. Jensen, H.: Model checking probabilistic real time systems. In: Proc. 7th Nordic Workshop on Programming Theory. Report 86:247-261, Chalmers University of Technology (1996)
9. Beauquier, D.: Probabilistic timed automata. Theoretical Computer Science 292 (2003)
10. AlAttili, I., Houben, F., Igna, G., Michels, S., Zhu, F., Vaandrager, F.: Adaptive scheduling of data paths using Uppaal Tiga. CoRR abs/0912.1897 (2009)
11. de Alfaro, L., Faella, M., Henzinger, T. A., Majumdar, R., Stoelinga, M.: The element of surprise in timed games. In: Amadio, R. M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 144-158. Springer, Heidelberg (2003)
12. Courcoubetis, C., Yannakakis, M.: Minimum and maximum delay problems in real-time systems. In: FMSD 1992, vol. 1, Kluwer, Dordrecht (1992)
13. Jurdziński, M., Trivedi, A.: Reachability-time games on timed automata. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 838-849. Springer, Heidelberg (2007)
14. Jurdziński, M., Trivedi, A.: Average-time games. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) Proc. FSTTCS'08. Leibniz International Proceedings in Informatics, vol. 2, Schloss Dagstuhl (2008)
15. Jurdziński, M., Trivedi, A.: Concavely-priced timed automata. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 48-62. Springer, Heidelberg (2008)
16. Jurdziński, M., Kwiatkowska, M., Norman, G., Trivedi, A.: Concavely-priced probabilistic timed automata. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009 - Concurrency Theory. LNCS, vol. 5710, p. 415. Springer, Heidelberg (2009)
17. Chadha, R., Legay, A., Prabhakar, P., Viswanathan, M.: Complexity bounds for the verification of real-time software. In: Barthe, G., Hermenegildo, M. (eds.) VMCAI 2010. LNCS, vol. 5944, pp. 95-111. Springer, Heidelberg (2010)
18. Hoffmann, G., Wong-Toi, H.: The input-output control of real-time discrete event systems. In: Proc. RTS'92, IEEE Press, Los Alamitos (1992)
19. Asarin, E., Maler, O., Pnueli, A.: Symbolic controller synthesis for discrete and timed systems. In: Antsaklis, P. J., Kohn, W., Nerode, A., Sastry, S. S. (eds.) HS 1994. LNCS, vol. 999, pp. 1-20. Springer, Heidelberg (1995)
20. Brihaye, T., Henzinger, T. A., Prabhu, V. S., Raskin, J.: Minimum-time reachability in timed games. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 825-837. Springer, Heidelberg (2007)
21. Brihaye, T., Bruyére, V., Raskin, J.: On optimal timed strategies. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 49-64. Springer, Heidelberg (2005)
22. Bouyer, P., Brihaye, T., Markey, N.: Improved undecidability results on weighted timed automata. Information Processing Letters 98 (2006)
23. Bouyer, P., Forejt, V.: Reachability in stochastic timed games. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 103-114. Springer, Heidelberg (2009)
24. Kwiatkowska, M., Norman, G., Parker, D., Sproston, J.: Performance analysis of probabilistic timed automata using digital clocks. FMSD 29 (2006)
25. Berendsen, J., Chen, T., Jansen, D.: Undecidability of cost-bounded reachability in priced probabilistic timed automata. In: Chen, J., Cooper, S. (eds.) TAMC 2009. LNCS, vol. 5532, pp. 128-137. Springer, Heidelberg (2009)
26. Forejt, V., Kwiatkowska, M., Norman, G., Trivedi, A.: Expected reachability-time games. Technical Report RR-10-07, Oxford University Computing Laboratory (2010)
27. Kwiatkowska, M., Norman, G., Trivedi, A.: Quantitative games on probabilistic timed automata. CoRR abs/1001.1933 (2010)
28. Neyman, A., Sorin, S. (eds.): Stochastic Games and Applications. NATO Science Series C, vol. 570. Kluwer Academic Publishers, Dordrecht (2004)
29. Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, Heidelberg (1997)
30. Bouyer, P., Brihaye, T., Bruyère, V., Raskin, J.: On the optimal reachability problem on weighted timed automata. FMSD 31 (2007)
31. Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science 126 (1994)
32. Jurdziński, M., Sproston, J., Laroussinie, F.: Model checking probabilistic timed automata with one or two clocks. Logical Methods in Computer Science 4 (2008)
33. Condon, A.: The complexity of stochastic games. Information and Computation 96 (1992)
34. Bouyer, P., Brinksma, E., Larsen, K. G.: Staying alive as cheaply as possible. In: Alur, R., Pappas, G. J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 203-218. Springer, Heidelberg (2004)