Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

The Theory of Hybrid Automata

  • Chapter
Verification of Digital and Hybrid Systems

Part of the book series: NATO ASI Series ((NATO ASI F,volume 170))

Abstract

A hybrid automaton is a formal model for a mixed discrete-continuous System. W e classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The Classification reveals structure on mixed discrete-continuous State Spaces that was previously studied on purely discrete state Spaces only. In particular, various classes of hybrid automata induce finitary trace equivalence (or similarity, or bisimilarity) relations on an uncountable State space, thus permitting the application of various model-checking techniques that were originally developed for finitestate Systems.

* This research was supported in part by the Office of Naval Research Young Investigator award N00014-95-1-0520, by the National Science Foundation CAREER award CCR-9501708, by the National Science Foundation grant CCR- 9504469, by the Air Force Office of Scientific Research contract F49620-93-1- 0056, by the Army Research Office MURI grant DAAH-04-96-1-0341, by the Advanced Research Projects Agency grant NAG2-892, and by the Semiconductor Research Corporation contract 96-DC-324.036.

** A preliminary version of this paper appeared in the Proceedings of the l l th Annual IEEE Symposium on Logic in Computer Science (LICS 96), p p . 278- 292.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook
USD 15.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.

Similar content being viewed by others

References

  1. R. Alur, C. Courcoubetis, T.A. Henzinger, and P.-H. Ho. Hybrid automata: an algorithmic approach to the specification and verification of hybrid Systems. In R.L. Grossman, A. Nerode, A.P. Ravn, and H. Rischel, editors, Hybrid Systems I, Lecture Notes in Computer Science 736, pages 209–229. Springer-Verlag, 1993.

    Google Scholar 

  2. X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. An approach to the descrip-tion and analysis of hybrid Systems. In R.L. Grossman, A. Nerode, A.P. Ravn, and H. Rischel, editors, Hybrid Systems I, Lecture Notes in Computer Science 736, pages 149–178. Springer-Verlag, 1993.

    Google Scholar 

  3. R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid Systems. Theoretical Computer Science, 138: 3–34, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  4. R. Alur and T.A. Henzinger. Logics and models of real time: a survey. In J.W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, editors, Real Time: Theory in Practice, Lecture Notes in Computer Science 600, pages 74–106. Springer-Verlag, 1992.

    Google Scholar 

  5. T.A. Henzinger. Hybrid automata with finite bisimulations. In Z. Fülöp and F. Gecseg, editors, ICALP 95: Automata, Languages, and Programming, Lecture Notes in Computer Science 944, pages 324–335. Springer-Verlag, 1995.

    Google Scholar 

  6. T.A. Henzinger and P.W. Kopke. State equivalences for rectangular hybrid automata. In U. Montanari and V. Sassone, editors, CONCUR 96: Concurrency Theory, Lecture Notes in Computer Science 1119, pages 530–545. Springer-Verlag, 1996.

    Google Scholar 

  7. T.A. Henzinger. Sooner is safer than later. Information Processing Letters, 43(3): 135–141, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  8. T.A. Henzinger, P.W. Kopke, and H. Wong-Toi. The expressive power of clocks. In Z. Fülöp and F. Gecseg, editors, ICALP 95: Automata, Languages, and Programming, Lecture Notes in Computer Science 944, pages 417–428. Springer-Verlag, 1995.

    Google Scholar 

  9. V. Gupta, T.A. Henzinger, and R. Jagadeesan. Robust timed automata. In O. Maler, editor, HART 97: Hybrid and Real-time Systems, Lecture Notes in Computer Science 1201, pages 331–345. Springer-Verlag, 1997.

    Google Scholar 

  10. R. Alur, T.A. Henzinger, and P.-H. Ho. Automatic symbolic verification of embedded Systems. IEEE Transactions on Software Engineering, 22(3): 181–201, 1996.

    Article  Google Scholar 

  11. M. Abadi, and L. Lamport. An old-fashioned recipe for real time. ACM Trans-actions on Programming Languages and Systems, 16(5): 1543–1571, 1994.

    Article  Google Scholar 

  12. R. Gawlick, R. Segala, J.F. Sogaard-Andersen, and N.A. Lynch. Liveness in timed and untimed Systems. In S. Abiteboul and E. Shamir, editors, IC ALP 94: Automata, Languages, and Programming, Lecture Notes in Computer Science 820, pages 166–177. Springer-Verlag, 1994.

    Google Scholar 

  13. N.A. Lynch, R. Segala, F. Vaandrager, and H.B. Weinberg. Hybrid I/O Automata. In R. Alur, T.A. Henzinger, and E.D. Sontag, editors, Hybrid Systems III, Lecture Notes in Computer Science 1066, pages 496–510. Springer-Verlag, 1996.

    Chapter  Google Scholar 

  14. R. Alur and T.A. Henzinger. Modularity for timed and hybrid Systems. In A. Mazurkiewicz and J. Winkowski, editors, CONCUR 97: Concurrency Theory, Lecture Notes in Computer Science 1243, pages 74–88. Springer-Verlag, 1997.

    Google Scholar 

  15. A. Puri and P. Varaiya. Decidability of hybrid Systems with rectangular differntial inclusions. In D.L. Dill, editor, CAV ’94: Computer-aided Veriflcation, Lecture Notes in Computer Science 818, pages 95–104. Springer-Verlag, 1994.

    Google Scholar 

  16. T.A. Henzinger, P.W. Kopke, A. Puri, and P. Varaiya. What’s decidable about hybrid automata? In Proceedings of the 27th Annual Symposium on Theory of Computing, pages 373–382. ACM Press, 1995.

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  18. D. Bosscher, I. Polak, and F. Vaandrager. Verification of an audio-control protocol. In H. Langmaack, W.-P. deRoever, and J. Vytopil editors, FTRTFT 94: Formal Techniques in Real-time and Fault-tolerant Systems, Lecture Notes in Computer Science 863, pages 170–192. Springer-Verlag, 1994.

    Google Scholar 

  19. P.-H. Ho, and H. Wong-Toi. Automated analysis of an audio control protocol. In P. Wolper, editor, CAV 95: Computer-aided Verification, Lecture Notes in Computer Science 939, pages 381–394. Springer-Verlag, 1995.

    Google Scholar 

  20. Y. Kesten, A. Pnueli, J. Sifakis, and S. Yovine. Integration graphs: a class of decidable hybrid Systems. In R.L. Grossman, A. Nerode, A.P. Ravn, and H. Rischel, editors, Hybrid Systems, Lecture Notes in Computer Science 736, pages 179–208. Springer-Verlag, 1993.

    Google Scholar 

  21. R. Alur, C. Courcoubetis, and T.A. Henzinger. Computing accumulated delays in real-time Systems. Formal Methods in System Design, 11(2): 137–156, 1997.

    Article  Google Scholar 

  22. R. Alur, T.A. Henzinger, and M.Y. Vardi. Parametric real-time reasoning. In Proceedings of the 25th Annual Symposium on Theory of Computing, pages 592–601. ACM Press, 1993.

    Google Scholar 

  23. T.A. Henzinger, and P.-H. Ho. Algorithmic analysis of nonlinear hybrid Systems. In P. Wolper, editor, CAV 95: Computer-aided Veriflcation, Lecture Notes in Computer Science 939, pages 225–238. Springer-Verlag, 1995.

    Google Scholar 

  24. M.R. Henzinger, T.A. Henzinger, and P.W. Kopke. Computing simulations on finite and infinite graphs. In Proceedings of the 36rd Annual Symposium on Foundations of Computer Science, pages 453–462. IEEE Computer Society Press, 1995.

    Google Scholar 

  25. O. Maler, A. Pnueli, and J. Sifakis. On the synthesis of discrete Controllers for timed Systems. In E.W. Mayr and C. Puech, editors, STACS 95: Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 900, pages 229–242. Springer-Verlag, 1995.

    Google Scholar 

  26. A. Puri, V. Borkar, and P. Varaiya. ε-approximation of differential inclusions. In R. Alur, T.A. Henzinger, E.D. Sontag, editors, Hybrid Systems III, Lecture Notes in Computer Science 1066, pages 362–376. Springer-Verlag, 1996.

    Google Scholar 

  27. D.L. Dill. Timing assumptions and veriflcation of finite-state concurrent Systems. In J. Sifakis, editor, CAV 89: Automatic Veriflcation Methods for Finite-state Systems, Lecture Notes in Computer Science 407, pages 197–212. Springer-Verlag, 1989.

    Google Scholar 

  28. R. Alur, and R.P. Kurshan. Timing analysis in COSPAN. In R. Alur, T.A. Henzinger, and E.D. Sontag, editors, Hybrid Systems III, Lecture Notes in Computer Science 1066, pages 220–231. Springer-Verlag, 1996.

    Google Scholar 

  29. J. Bengtsson, K.G. Larsen, F. Larsson, P. Pettersson, and W . Yi. UPPAAL: a tool-suite for automatic veriflcation of real-time Systems. In R. Alur, T.A. Henzinger, and E.D. Sontag, editors, Hybrid Systems III, Lecture Notes in Computer Science 1066, pages 232–243. Springer-Verlag, 1996.

    Google Scholar 

  30. C. Daws, A. Olivero, S. Tripakis, and S. Yovine. The tool KRONOS. In R. Alur, T.A. Henzinger, E.D. Sontag, editors, Hybrid Systems III, Lecture Notes in Computer Science 1066, pages 208–219. Springer-Verlag, 1996.

    Google Scholar 

  31. A. Bouajjani, R. Echahed, and R. Robbana. Veriflcation of context-free timed Systems using linear hybrid observers. In D.L. Dill, editor, CAV 94: Computer-aided Veriflcation, Lecture Notes in Computer Science, pages 118–131. Springer-Verlag, 1994.

    Google Scholar 

  32. A. Bouajjani and R. Robbana. Verifying tj-regular properties for subclasses of linear hybrid Systems. In P. Wolper, editor, CAV 95: Computer-aided Veriflcation, Lecture Notes in Computer Science 939, pages 437–450. Springer-Verlag, 1995.

    Google Scholar 

  33. K. Ceräns. Decidability of bisimulation equivalence for parallel timer pro-cesses. In G. von Bochmann and D.K. Probst, editors, CAV 92: Computer-aided Veriflcation, Lecture Notes in Computer Science 663, pages 302–315. Springer-Verlag, 1992.

    Google Scholar 

  34. K. Ceräns, J.C. Godskesen, and K.G. Larsen. Timed modal specification: Theory and tools. In C. Courcoubetis, editor, CAV 93: Computer-aided Veriflcation, Lecture Notes in Computer Science 697, pages 253–267. Springer-Verlag, 1993.

    Google Scholar 

  35. S. Tastian, R. Alur, R.P. Kurshan, and R.K. Brayton. Verifying abstractions of timed Systems. In U. Montanari, editor, CONCUR 96: Concurrency Theory, Lecture Notes in Computer Science, pages 546–562. Springer-Verlag, 1996.

    Google Scholar 

  36. T.A. Henzinger and P.W. Kopke. Discrete-time control for rectangular hybrid automata. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, IC ALP 97: Automata, Languages, and Programming, Lecture Notes in Computer Science 1256, pages 582–593. Springer-Verlag, 1997.

    Google Scholar 

  37. T.A. Henzinger, P.-H. Ho, and H. Wong-Toi. HYTECH: the next generation. In Proceedings of the 16th Annual Real-time Systems Symposium, pages 56–65. IEEE Computer Society Press, 1995.

    Google Scholar 

  38. T.A. Henzinger, P.-H. Ho, andH. Wong-Toi. A user guide to HYTECH. In E. Brinksma, W.R. Cleaveland, K.G. Larsen, T. Margaria, and B. Steffen, editors, TACAS 95: Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science 1019, pages 41–71. Springer- Verlag, 1995.

    Google Scholar 

  39. T.A. Henzinger, P.-H. Ho, and H. Wong-Toi. HYTECH: a model checker for hybrid Systems. In O. Grumberg, editor, CAV 97: Computer-aided Verification, Lecture Notes in Computer Science 1254, pages 460–463. Springer-Verlag, 1997.

    Google Scholar 

  40. S. Nadjm-Tehrani and J.-E. Strömberg. Proving dynamic properties in an aerospace application. In Proceedings of the 16th Annual Real-time Systems Symposium, pages 2–10. IEEE Computer Society Press, 1995.

    Google Scholar 

  41. J.C. Corbett. Timing analysis of A D A tasking programs. IEEE Transactions on Software Engineering, 22(7)461–483, 1996.

    Article  Google Scholar 

  42. T.A. Henzinger and H. Wong-Toi. Using HYTECH to synthesize control Parameters for a steam boiler. In J.-R. Abrial, E. Börger, and H. Langmaack, editors, Formal Methods for Industrial Applications: Specifying and Programming the Steam Boiler Control, Lecture Notes in Computer Science 1165, pages 265–282. Springer-Verlag, 1996.

    Google Scholar 

  43. T. Stauner, O. Müller, and M. Fuchs. Using HYTECH to verify an automo-tive control System. In O. Maler, editor, HART 97: Hybrid and Real-time Systems, Lecture Notes in Computer Science 1201, pages 139–153. Springer- Verlag, 1997.

    Chapter  Google Scholar 

  44. R. Alur, C. Courcoubetis, andD.L. Dill. Model checking in dense real time. Information and Computation, 104(1)2–34, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  45. A. Bouajjani, R. Echahed, and J. Sifakis. On model checking for real-time properties with durations. In Proceedings of the Eighth Annual Symposium on Logic in Computer Science, pages 147–159. IEEE Computer Society Press, 1993.

    Google Scholar 

  46. F. Wang. Timing behavior analysis for real-time Systems. In Proceedings of the Tenth Annual Symposium on Logic in Computer Science, pages 112–122. IEEE Computer Society Press, 1995.

    Google Scholar 

  47. O. Maler, Z. Manna, andA. Pnueli. From timed to hybrid Systems. In J.W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, editors, Real Time: Theory in Practice, Lecture Notes in Computer Science 600, pages 447–484. Springer-Verlag, 1992.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Sciences, University of California, 94720, Berkeley, CA, USA

    Thomas A. Henzinger

Authors
  1. Thomas A. Henzinger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Engineering and Natural Sciences , Sabanci University, Orhanli, 81474, Tuzla-Istanbul, Turkey

    M. Kemal Inan

  2. Bell Laboratories, 600 Mountain Avenue, 2A-410 Murray Hill, 07974, NJ, USA

    Robert P. Kurshan

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg New York

About this chapter

Cite this chapter

Henzinger, T.A. (2000). The Theory of Hybrid Automata. In: Inan, M.K., Kurshan, R.P. (eds) Verification of Digital and Hybrid Systems. NATO ASI Series, vol 170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59615-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-59615-5_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-64052-0

  • Online ISBN: 978-3-642-59615-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation