On optimal timed strategies

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

Volumn 3829 LNCS, Issue , 2005, Pages 49-64

  Brihaye, Thomas ^a   Bruyère, Véronique ^a   Raskin, Jean François ^b  

^a UNIVERSITY OF MONS   (Belgium)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COSTS; DECISION THEORY; PROBABILITY; STRATEGIC PLANNING;

NON-ZENONESS; OPTIMAL TIMED STRATEGIES; SEMI-ALGORITHM; TIMED AUTOMATA;

GAME THEORY;

EID: 33645050545     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11603009_5     Document Type: Conference Paper

References (13)

1. L. de Alfaro and T.A. Henzinger and R. Majumdar. Symbolic algorithms for infinite-state games. In Proceedings of CONCUR'01, Lect. Notes Comput. Sci. 2154, 536-550, Springer, 2001.
2. L. de Alfaro and M. Faella and T.A. Henzinger and R. Majumdar and M. Stoelinga". The element of surprise in timed games". In Proceedings of CONCUR'03, Lect. Notes Comput. Sci. 2761, 144-158, Springer, 2003.
3. R. Alur and P. Madhusudan. Decision problems for timed automata: A survey. In Proceedings of SFM'04, Lect. Notes Comput. Sci. 3185, 1-24, Springer, 2004.
4. R. Alur, M. Bernadsky, and P. Madhusudan. Optimal reachability for weighted timed games. In Proceedings of ICALP'04, Lect. Notes Comput. Sci. 3142, 122-133, Springer, 2004.
5. R. Alur and D.L. Dill. A theory of timed automata. Theoret. Comput. Sci. 126, 183-235, 1994.
6. R. Alur, S. La Torre, and G. J. Pappas. Optimal paths in weighted timed automata. In Proceedings of HSCC'01, Lect. Notes Comput. Sci. 2034, 49-62, Springer, 2001.
7. E. Asarin and O. Maler. As soon as possible: Time optimal control for timed automata. In Proceedings of HSCC'99, Lect. Notes Comput. Sci. 1569, 19-30, Springer, 1999.
8. G. Behrmann, A. Fehnker, T. Hune, K. Larsen, P. Pettersson, J. Romijn, and F. Vaandrager. Minimum-cost reachability for priced timed automata. In Proceedings of HSCC'01, Lect. Notes Comput. Sci. 2034, 147-161. Springer-Verlag, 2001.
9. P. Bouyer, F. Cassez, E. Fleury, and K.G. Larsen. Optimal strategies in priced timed game automata. In Proceedings of FSTTCS'04, 3328 Lect. Notes Comput. Sci. 3328, 148-160, Springer, 2004.
10. T. Brihaye, V. Bruyère, and J.-F. Raskin. Model-Checking for Weighted Timed Automata. In Proceedings of FORMATS-FTRTFT'04, Lect. Notes Comput. Sci. 3253, 277-292, Springer, 2004.
11. O. Maler, A. Pnueli, and J. Sifakis. On the synthesis of discrete controllers for timed systems. In Proceedings of STACS'95, Lect. Notes Comput. Sci. 900, 229-242, Springer, 1995.
12. M. Minsky. Computation: Finite and Infinite Machines. Prentice Hall, 1967.
13. S. La Torre, S. Mukhopadhyay, and A. Murano. Optimal-reachability and control for acyclic weighted timed automata. In Proceedings of IFIP TCS'02, IFIP Conference Proceedings 223, 485-497, Kluwer, 2002.