Skip to main content
SpringerLink
Log in

Optimal Reachability for Weighted Timed Games

  • Conference paper
Automata, Languages and Programming (ICALP 2004)

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

Included in the following conference series:

Abstract

Weighted timed automata are timed automata annotated with costs on locations and transitions. The optimal game-reachability problem for these automata is to find the best-cost strategy of supplying the inputs so as to ensure reachability of a target set within a specified number of iterations. The only known complexity bound for this problem is a doubly-exponential upper bound. We establish a singly-exponential upper bound and show that there exist automata with exponentially many states in a single region with pair-wise distinct optimal strategies.

This research was partially supported by ARO URI award DAAD19-01-1-0473, and NSF awards ITR/SY 0121431 and CCR 0306382.

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 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 239.00
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. Alur, R., Courcoubetis, C., Henzinger, T.A.: Computing accumulated delays in real-time systems. Formal Methods in System Design 11(2), 137–155 (1997)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Alur, R., La Torre, S., Pappas, G.: Optimal paths in weighted timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 49–62. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Asarin, E., Maler, O.: As soon as possible: Time optimal control for timed automata. In: Vaandrager, F.W., van Schuppen, J.H. (eds.) HSCC 1999. LNCS, vol. 1569, pp. 19–30. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  5. Behrman, G., Hune, T., Fehnker, A., Larsen, K., Petersson, P., Romijn, J., Vaandrager, F.: Minimum-cost reachability for priced timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 147–161. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Cassez, F., Henzinger, T.A., Raskin, J.-F.: A comparison of control problems for timed and hybrid systems. In: Tomlin, C.J., Greenstreet, M.R. (eds.) HSCC 2002. LNCS, vol. 2289, pp. 134–148. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Courcoubetis, C., Yannakakis, M.: Minimum and maximum delay problems in real-time systems. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol. 575, pp. 399–409. Springer, Heidelberg (1992)

    Google Scholar 

  8. D’Souza, D., Madhusudan, P.: Timed control synthesis for external specifications. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 571–582. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Ferrante, J., Rackoff, C.: A decision procedure for the first order theory on real addition with order. SIAM Journal of Computing 4(1), 69–76 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  10. Fischer, M.J., Rabin, M.O.: Super-exponential complexity of Presburger arithmetic. In: Proc. of SIAM-AMS Symp. in Appl. Math., vol. 7, pp. 27–41 (1974)

    Google Scholar 

  11. Larsen, K., Behrman, G., Brinksma, E., Fehnker, A., Hune, T., Petersson, P., Romijn, J.: As cheap as possible: Efficient cost-optimal reachability for priced timed automata. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 493–505. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  12. Maler, O., Pnueli, A., Sifakis, J.: On the synthesis of discrete controllers for timed systems. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 229–242. Springer, Heidelberg (1995)

    Google Scholar 

  13. Matoušek, J.: Lectures on Discrete Geometry. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  14. La Torre, S., Mukhopadhyay, S., Murano, A.: Optimal-reachability and control for acyclic weighted timed automata. In: Proceedings of the 17th IFIP World Computer Congress: TCS, pp. 485–497. Kluwer, Dordrecht (2002)

    Google Scholar 

  15. Wong-Toi, H., Hoffmann, G.: The control of dense real-time discrete event systems. In: IEEE Conference on Decision and Control, pp. 1527–1528 (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Pennsylvania,  

    Rajeev Alur, Mikhail Bernadsky & P. Madhusudan

Authors
  1. Rajeev Alur
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mikhail Bernadsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. Madhusudan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament de Llenguatges i Sistemes Informatics, Universitat Politecnica de Catalunya, Campus Nord - Ed. Omega, 240 Jordi Girona Salgado, 1-3 E-08034, Barcelona

    Josep Díaz

  2. Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  3. Department of Mathematics, University of Turku, Turku, Finland

    Arto Lepistö

  4. Laboratory for Foundations of Computer Science, University of Edinburgh,  

    Donald Sannella

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alur, R., Bernadsky, M., Madhusudan, P. (2004). Optimal Reachability for Weighted Timed Games. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27836-8_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22849-3

  • Online ISBN: 978-3-540-27836-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation