Optimal strategies in priced timed game automata

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

Volumn 3328, Issue , 2004, Pages 148-160

  Bouyer, Patricia ^a   Cassez, Franck ^a   Fleury, Emmanuel ^b   Larsen, Kim G ^b  

^a CNRS   (France)

^b AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; OPTIMAL SYSTEMS; COSTS; SOFTWARE ENGINEERING;

CONDITION; NON-ZENONESS; OPTIMAL COSTS; OPTIMAL STRATEGIES; REACHABILITY; STATE BASED; TIMED GAME AUTOMATA;

COSTS; OPTIMAL SYSTEMS;

EID: 35048890008     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30538-5_13     Document Type: Article

References (20)

1. R. Alur, M. Bernadsky, and P. Madhusudan. Optimal reachability in weighted timed games. In Proc. 31st Int. Coll. Automata, Languages and Programming (ICALP'04), LNCS 3142, pp. 122-133. Springer, 2004.
2. R. Alur, C. Courcoubetis, and T. Henzinger. Computing accumulated delays in real-time systems. In Proc. 5th Int. Conf. Computer Aided Verification (CAV'93), LNCS 697, pp. 181-193. Springer, 1993.
3. R. Alur, S. La Torre, and G. Pappas. Optimal paths in weighted timed automata. In Proc. 4th Int. Work. Hybrid Systems: Computation and Control (HSCC'01), LNCS 2034, pp. 49-62. Springer, 2001.
4. E. Asarin and O. Maler. As soon as possible: Time optimal control for timed automata. In Proc. 2nd Int. Work. Hybrid Systems: Computation and Control (HSCC'99), LNCS 1569, pp. 19-30. Springer, 1999.
5. E. Asarin, O. Maler, A. Pnueli, and J. Sifakis. Controller synthesis for timed automata. In Proc. IFAC Symp. System Structure and Control, pp. 469-474. Elsevier Science, 1998.
6. G. Behrmann, A. Fehnker, T. Hune, K. Larsen, P. Pettersson, J. Romijn, and F. Vaandrager. Minimum-cost reachability for priced timed automata. In Proc. 4th Int. Work. Hybrid Systems: Computation and Control (HSCC'01), LNCS 2034, pp. 147-161. Springer, 2001.
7. P. Bouyer, F. Cassez, E. Fleury and K. Larsen. Optimal Strategies on Priced Timed Game Automata. BRICS Report Series, February 2004.
8. P. Bouyer, F. Cassez, E. Fleury and K. Larsen. Synthesis of Optimal Strategies Using HYTECH. In Proc. Games in Design and Verification (GDV'04), ENTCS. Elsevier, 2004. To appear.
9. P. Bouyer, E. Brinksma, and K. Larsen. Staying alive as cheaply as possible. In Proc. 7th Int. Work. Hybrid Systems: Computation and Control (HSCC'04), LNCS 2993, pp. 203-218. Springer, 2004.
10. C. Courcoubetis and M. Yannakakis. Minimum and maximum delay problems in real-time systems. Formal Methods in System Design, 1(4):385-415, 1992.
11. L. De Alfaro, T. Henzinger, and R. Majumdar. Symbolic algorithms for infinite-state games. In Proc. 12th Int. Conf. Concurrency Theory (CONCUR'01), LNCS 2154, pp. 536-550. Springer, 2001.
12. T. Henzinger. The theory of hybrid automata. In Proc. 11th IEEE Annual Symp. Logic in Computer Science (LICS'96), pp. 278-292. IEEE Computer Society Press, 1996.
13. T. Hune, K. Larsen, and P. Pettersson. Guided synthesis of control programs using UPPAAL. In Proc. IEEE ICDS Int. Work. Distributed Systems Verification and Validation, pp. E15-E22. IEEE Computer Society Press, 2000.
14. S. La Torre, S. Mukhopadhyay, and A. Murano. Optimal-reachability and control for acyclic weighted timed automata. In Proc. 2nd IFIP Int. Conf. Theoretical Computer Science (TCS 2002), IFIP Proceedings 223, pp. 485-497. Kluwer, 2002.
15. K. Larsen. Resource-efficient scheduling for real time systems. In Proc. 3rd Int. Conf. Embedded Software (EMSOFT'03), LNCS 2855, pp. 16-19. Springer, 2003. Invited talk.
16. K. Larsen, G. Behrmann, E. Brinksma, A. Fehnker, T. Hune, P. Pettersson, and J. Romijn. As cheap as possible: Efficient cost-optimal reachability for priced timed automata. In Proc. 13th Int. Conf. Computer Aided Verification (CAV'01), LNCS 2102, pp. 493-505. Springer, 2001.
17. O. Maler, A. Pnueli, and J. Sifakis. On the synthesis of discrete controllers for timed systems. In Proc. 12th Annual Symp. Theoretical Aspects of Computer Science (STACS'95), LNCS 900, pp. 229-242. Springer, 1995.
18. P. Niebert, S. Tripakis, and S. Yovine. Minimum-time reachability for timed automata. In Proc. 8th IEEE Mediterranean Conf. Control and Automation, 2000.
19. W. Thomas. On the synthesis of strategies in infinite games. In Proc. 12th Annual Symp. Theoretical Aspects of Computer Science (STACS'95), LNCS 900, pp. 1-13. Springer, 1995. Invited talk.
20. H. Wong-Toi. The synthesis of controllers for linear hybrid automata. In Proc. 36th IEEE Conf. Decision and Control, pp. 4607-4612. IEEE Computer Society Press, 1997.