Reachability-time games on timed automata

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

Volumn 4596 LNCS, Issue , 2007, Pages 838-849

  Jurdziński, Marcin ^a   Trivedi, Ashutosh ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; GAME THEORY; PROBLEM SOLVING;

REACHABILITY-TIME GAMES; TIMED AUTOMATA; VALUE ITERATION ALGORITHM;

AUTOMATA THEORY;

EID: 38149095732     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73420-8_72     Document Type: Conference Paper

References (19)

1. Abdeddaïm, Y., Asarin, E., Maler, O.: Scheduling with timed automata. Theor. Comput. Sci. 354(2), 272-300 (2006)
2. Alur, R., Bernadsky, M., Madhusudan, P.: Optimal reachability for weighted timed games. In: Díaz, J., Karhumaki, J., Lepisto, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 122-133. Springer, Heidelberg (2004)
3. Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183-235 (1994)
4. 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)
5. Asarin, E., Maler, O., Pnueli, A., Sifakis, J.: Controller synthesis for timed automata. In: IFAC Symp. on System Structure and Control, pp. 469-474. Elsevier, Amsterdam (1998)
6. Behrmann, G., Fehnker, A., Hune, T., Larsen, K.G., Pettersson, P., Romijn, J., Vaandrager, F.W.: Minimum-cost reachability for priced timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 147-161. Springer, Heidelberg (2001)
7. Bouyer, P.: Weighted timed automata: model-checking and games. Electr. Notes Theor. Comput. Sci. 158, 3-17 (2006)
8. Bouyer, P., Brihaye, T., Bruyère, V., Raskin, J.-F.: On the optimal reachability problem on weighted timed automata. Form. Method. Syst. Des. (to appear)
9. Bouyer, P., Brihaye, T., Markey, N.: Improved undecidability results on weighted timed automata. Information Processing Letters 98(5), 188-194 (2006)
10. 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)
11. Bouyer, P., Larsen, K.G., Markey, N., Rasmussen, J.I.: Almost optimal strategies in one-clock priced timed automata. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 345-356. Springer, Heidelberg (2006)
12. Brihaye, T., Henzinger, T.A., Prabhu, V.S., Raskin, J.-F.: Minimum-time reachability in timed games. In: ICALP 2007. LNCS, vol. 4596, Springer, Heidelberg (2007)
13. Courcoubetis, C., Yannakakis, M.: Minimum and maximum delay problems in real-time systems. Form. Method. Syst. Des. 1, 385-415 (1992)
14. 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)
15. Henzinger, T.A., Prabhu, V.S.: Timed alternating-time temporal logic. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 1-17. Springer, Heidelberg (2006)
16. Jurdziński, M., Laroussinie, F., Sproston, J.: Model checking probabilistic timed automata with one or two clocks. In: TACAS 2007. LNCS, vol. 4424, pp. 170-184. Springer, Heidelberg (2007)
17. Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, Chichester (1994)
18. Rasmussen, J.I., Larsen, K.G., Subramani, K.: On using priced timed automata to achieve optimal scheduling. Form. Method. Syst. Des. 29, 97-114 (2006)
19. Vöge, J., Jurdziński, M.: A discrete strategy improvement algorithm for solving parity games. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 202-215. Springer, Heidelberg (2000)