Optimal paths in weighted timed automata

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

Volumn 2034, Issue , 2001, Pages 49-62

  Alur, Rajeev ^a,b   La Torre, Salvatore ^a,c   Pappas, George J ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COST FUNCTIONS; HYBRID SYSTEMS;

EXPONENTIAL TIME ALGORITHM; FINITE DIRECTED GRAPHS; LINEAR COST FUNCTIONS; OPTIMIZATION PROBLEMS; REACHABILITY PROBLEM; SHORTEST PATH PROBLEM; TIMED AUTOMATA; WEIGHTED TIMED AUTOMATA;

DIRECTED GRAPHS;

EID: 84944225404     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45351-2_8     Document Type: Conference Paper

References (15)

1. R. Alur, C. Courcoubetis, and T.A. Henzinger. Computing accumulated delays in real-time system. In Proc. of the Fifth International Conference on Computer-Aided Verification, CAV'93, LNCS 697, pages 181-193, 1993.
2. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
3. E. Asarin and O. Maler. As soon as possible: Time optimal control for timed automata. In Proc. of the 2nd International Workshop on Hybrid Systems: Computation and Control, LNCS 1569, pages 19-30, 1999.
4. E. Asarin, O. Maler, and A. Pnueli. Symbolic controller synthesis for discrete and timed systems. In Proc. of the 2nd International Workshop on Hybrid Systems, LNCS 999, pages 1-20, 1995.
5. G. Behrman, T. Hune, A. Fehnker, K. Larsen, P. Pettersson, R. Romijn, and F. Vaandrager. Minimum-cost reachability for priced timed automata. In this Volume.
6. A. Church. Logic, arithmetic, and automata. In Proc. of the International Congress of Mathematics, pages 23-35, 1962.
7. C. Courcoubetis and M. Yannakakis. Minimum and maximum delay problems in real-time systems. In Proc. of the 3rd International Conference on Computer Aided Verification, LNCS 575, pages 399-409, 1991.
8. R. M. Karp and J. R. Orlin. Parametric shortest path algorithm with an application to cyclic stang. Discrete Applied Math., 3:37-45, 1981.
9. J. Lygeros, C. Tomlin, and S.S. Sastry. Controllers for reachability specifications for hybrid systems. Automatica, 35(3):349-370, March 1999.
10. O. Maler, A. Pnueli, and J. Sifakis. On the synthesis of discrete controllers for timed systems. In Proc. of the 12th Annual Symposium on Theoretical Aspects of Computer Science, STACS'95, LNCS 900, pages 229-242, 1995.
11. P. Nierbert, S. Tripakis, and S. Yovine. Minimum-time reachability for timed automata. In Proc. of the 8-th IEEE Mediterranean Conference on Control and Automation, 2000.
12. O. Shakernia, G. J. Pappas, and S. Sastry. Decidable controller synthesis for classes of linear systems. In Proc. of the 3rd International Workshop on Hybrid Systems: Computation and Control, HSCC'00, LNCS 1790, pages 407-420, 2000.
13. W. Thomas. On the synthesis of strategies in infinite games. In Ernst W. Mayr and Claude Puech, editors, 12th Annual Symposium on Theoretical Aspects of Computer Science, STACS'95, LNCS 900, pages 1-13, 1995.
14. H. Wong-Toi. The synthesis of controllers for linear hybrid automata. In Proc. of the 36th IEEE CDC, San Diego, CA, December 1997.
15. N. E. Young, R. Tarjan, and J. Orlin. Faster parametric shortest path and minimum balance algorithms. Networks, 21 (2):205-221, 1991.