Skip to main content
SpringerLink
Log in

Optimal Paths in Weighted Timed Automata

  • Conference paper
  • First Online:
Hybrid Systems: Computation and Control (HSCC 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2034))

Included in the following conference series:

Abstract

We consider an optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this optimization problem consists of reducing it to a (parametric) shortest-path problem for a finite directed graph. The directed graph we construct is a refinement of the region automaton due to Alur and Dill. We present an exponential time algorithm to solve the shortest-path problem for weighted timed automata starting from a single state, and a doubly-exponential time algorithm to solve this problem starting from a zone of the state space.

This work is partially supported by the DARPA/ITO MoBIES grant F33615-00-C-1707, the NSF Career award CCR97-34115, the SRC award 99-TJ-688, the MURST grant TOSCA, the DARPA JFACC grant N66001-99-C-8510, and the University of Pennsylvania Research Foundation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Google Scholar 

  2. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Chapter  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  6. A. Church. Logic, arithmetic, and automata. In Proc. of the International Congress of Mathematics, pages 23–35, 1962.

    Google Scholar 

  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.

    Google Scholar 

  8. R. M. Karp and J. R. Orlin. Parametric shortest path algorithm with an application to cyclic staffing. Discrete Applied Math., 3:37–45, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. Lygeros, C. Tomlin, and S.S. Sastry. Controllers for reachability specifications for hybrid systems. Automatica, 35(3):349–370, March 1999.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Chapter  Google Scholar 

  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.

    Google Scholar 

  14. H. Wong-Toi. The synthesis of controllers for linear hybrid automata. In Proc. of the 36th IEEE CDC, San Diego, CA, December 1997.

    Google Scholar 

  15. N. E. Young, R. Tarjan, and J. Orlin. Faster parametric shortest path and minimum balance algorithms. Networks, 21 (2):205–221, 1991.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Pennsylvania, USA

    Rajeev Alur, Salvatore La Torre & George J. Pappas

  2. Bell Labs, USA

    Rajeev Alur

  3. Università degli Studi di Salerno, USA

    Salvatore La Torre

Authors
  1. Rajeev Alur
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Salvatore La Torre
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. George J. Pappas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Ingegneria Elettrica, Universitá dell’Aquila, Poggio di Roio, 67040, L’Aquila, Italy

    Maria Domenica Di Benedetto

  2. University of California at Berkeley, Berkeley, CA, 94720

    Alberto Sangiovanni-Vincentelli

  3. PARADES, Via San Pantaleo, 66, 00186, Roma, Italy

    Alberto Sangiovanni-Vincentelli

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alur, R., La Torre, S., Pappas, G.J. (2001). Optimal Paths in Weighted Timed Automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A. (eds) Hybrid Systems: Computation and Control. HSCC 2001. Lecture Notes in Computer Science, vol 2034. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45351-2_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-45351-2_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41866-5

  • Online ISBN: 978-3-540-45351-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation