Optimal reachability for weighted timed games

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

Volumn 3142, Issue , 2004, Pages 122-133

  Alur, Rajeev ^a   Bernadsky, Mikhail ^a   Madhusudan, P ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPLEXITY BOUNDS; COST STRATEGIES; NUMBER OF ITERATIONS; OPTIMAL STRATEGIES; REACHABILITY; REACHABILITY PROBLEM; TIMED AUTOMATA; WEIGHTED TIMED AUTOMATA;

AUTOMATA THEORY;

EID: 35048874144     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_13     Document Type: Article

References (15)

1. R. Alur, C. Courcoubetis, and T.A. Henzinger. Computing accumulated delays in real-time systems. Formal Methods in System Design, 11(2):137-155, 1997.
2. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
3. R. Alur, S. La Torre, and G. Pappas. Optimal paths in weighted timed automata. In Hybrid Systems: Computation and Control, LNCS 2034, pages 49-62, 2001.
4. E. Asarin and O. Maler. As soon as possible: Time optimal control for timed automata. In Hybrid Systems: Comp, and Control, LNCS 1569, pages 19-30, 1999.
5. G. Behrman, T. Hune, A. Fehnker, K. Larsen, P. Petersson, J. Romijn, and F. Vaandrager. Minimum-cost reachability for priced timed automata. In Hybrid Systems: Computation and Control, LNCS 2034, pages 147-161, 2001.
6. F. Cassez, T.A. Henzinger, and J.-F. Raskin. A comparison of control problems for timed and hybrid systems. In HSCC, LNCS 2289, pages 134-148, 2002.
7. C. Courcoubetis and M. Yannakakis. Minimum and maximum delay problems in real-time systems. In Proc. of Third Workshop on Computer-Aided Verification, LNCS 575, pages 399-409. Springer-Verlag, 1991.
8. D. D'Souza and P. Madhusudan. Timed control synthesis for external specifications. In Proc. STACS, LNCS 2285, pages 571-582. Springer, 2002.
9. J. Ferrante and C. Rackoff. A decision procedure for the first order theory on real addition with order. SIAM Journal of Computing, 4(1):69-76, 1975.
10. M. J. Fischer and M.O. Rabin. Super-exponential complexity of Presburger arithmetic. In Proc. of SIAM-AMS Symp. in Appl. Math., vol. 7, pages 27-41, 1974.
11. K. Larsen, G. Behrman, E. Brinksma, A. Fehnker, T. Hune, P. Petersson, and J. Romijn. As cheap as possible: Efficient cost-optimal reachability for priced timed automata. In Proc. of CAV, LNCS 2102, pages 493-505. Springer, 2001.
12. O. Maler, A. Pnueli, and J. Sifakis. On the synthesis of discrete controllers for timed systems. In Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 900, pages 229-242, 1995.
13. J. Matoušek. Lectures on Discrete Geometry. Springer, 2002.
14. S. La Torre, S. Mukhopadhyay, and A. Murano. Optimal-reachability and control for acyclic weighted timed automata. In Proceedings of the 17th IFIP World Computer Congress: TCS, pages 485-497. Kluwer, 2002.
15. H. Wong-Toi and G. Hoffmann. The control of dense real-time discrete event systems. In IEEE Conference on Decision and Control, pages 1527-1528, 1991.