Skip to main content
SpringerLink
Log in

Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points

  • Conference paper
Automated Technology for Verification and Analysis

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 8172))

Abstract

We study the time-bounded reachability problem for monotonic hybrid automata (MHA), i.e., rectangular hybrid automata for which the rate of each variable is either always non-negative or always non-positive. In this paper, we revisit the decidability results presented in [5] and show that the problem is NExpTime-complete. We also show that we can effectively compute fixed points that characterise the sets of states that are reachable (resp. co-reachable) within T time units from a given state.

This work has been partly supported by a grant from the National Bank of Belgium, the ARC project (number AUWB-2010-10/15-UMONS-3), the FRFC project (number 2.4545.11) and a ‘Crédit aux chercheurs’ of the FRS – F.N.R.S.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Alur, R., Courcoubetis, C., Henzinger, T.A., Ho, P.-H.: Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol. 736, Springer, Heidelberg (1993)

    Chapter  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. Bagnara, R., Hill, P.M., Zaffanella, E.: The parma polyhedra library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Sci. Comput. Program. 72(1-2) (2008)

    Article  MathSciNet  Google Scholar 

  4. Basu, S.: New results on quantifier elimination over real closed fields and applications to constraint databases. J. ACM 46(4) (1999)

    Article  MathSciNet  Google Scholar 

  5. Brihaye, T., Doyen, L., Geeraerts, G., Ouaknine, J., Raskin, J.-F., Worrell, J.: On reachability for hybrid automata over bounded time. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 416–427. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. Brihaye, T., Doyen, L., Geeraerts, G., Ouaknine, J., Raskin, J.-F., Worrell, J.: Time-bounded reachability for hybrid automata: Complexity and fixpoints. Technical report CoRR abs/1211.1276, Cornell University Library, arXiv.org (2012), http://arxiv.org/abs/1211.1276

  7. Henzinger, T.A.: The theory of hybrid automata. In: LICS 1996. IEEE Computer Society (1996)

    Google Scholar 

  8. Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: A user guide to HyTech. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol. 1019, pp. 41–71. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  9. Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: Hytech: A model checker for hybrid systems. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 460–463. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  10. Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What’s decidable about hybrid automata. JCSS 57(1), 94–124 (1998)

    MathSciNet  MATH  Google Scholar 

  11. Henzinger, T.A., Majumdar, R., Raskin, J.-F.: A classification of symbolic transition systems. ACM Trans. Comput. Log. 6(1), 1–32 (2005)

    Article  MathSciNet  Google Scholar 

  12. Jenkins, M., Ouaknine, J., Rabinovich, A., Worrell, J.: Alternating timed automata over bounded time. In: LICS 2010. IEEE Computer Society (2010)

    Google Scholar 

  13. Jha, S.K., Krogh, B.H., Weimer, J.E., Clarke, E.M.: Reachability for linear hybrid automata using iterative relaxation abstraction. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds.) HSCC 2007. LNCS, vol. 4416, pp. 287–300. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  14. Ouaknine, J., Rabinovich, A., Worrell, J.: Time-bounded verification. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 496–510. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. UMons, Belgium

    Thomas Brihaye

  2. LSV Cachan, France

    Laurent Doyen

  3. ULB, Belgium

    Gilles Geeraerts & Jean-Francois Raskin

  4. Oxford University, UK

    Joel Ouaknine & James Worrell

Authors
  1. Thomas Brihaye
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laurent Doyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gilles Geeraerts
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Joel Ouaknine
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jean-Francois Raskin
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. James Worrell
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Engineering and Technology, Vietnam National University, Xuan Thuy Street, 144, Hanoi, Vietnam

    Dang Van Hung

  2. School of Information Science, Japan Advanced Institute of Science and Technology, 1-1 Asahidai, 923-1292, Nomi, Ishikawa, Japan

    Mizuhito Ogawa

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Brihaye, T., Doyen, L., Geeraerts, G., Ouaknine, J., Raskin, JF., Worrell, J. (2013). Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points. In: Van Hung, D., Ogawa, M. (eds) Automated Technology for Verification and Analysis. Lecture Notes in Computer Science, vol 8172. Springer, Cham. https://doi.org/10.1007/978-3-319-02444-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-02444-8_6

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-02443-1

  • Online ISBN: 978-3-319-02444-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation