Skip to main content

Hybrid I/O automata

Extended abstract

  • Conference paper
  • First Online:
Hybrid Systems III (HS 1995)

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

Included in the following conference series:

Abstract

We propose a new hybrid I/O automaton model that is capable of describing both continuous and discrete behavior. The model, which extends the timed I/O automaton model of [12, 7] and the phase transition system models of [15, 2], allows communication among components using both shared variables and shared actions. The main contributions of this paper are: (1) the definition of hybrid I/O automata and of an implementation relation based on hybrid traces, (2) the definition of a simulation between hybrid I/O automata and a proof that existence of a simulation implies the implementation relation, (3) a definition of composition of hybrid I/O automata and a proof that it respects the implementation relation, and (4) a definition of receptiveness for hybrid I/O automata and a proof that, assuming certain compatibility conditions, receptiveness is preserved by composition.

Supported by NSF Grant 9225124-CCR, U.S. Department of Transportation Contract DTRS95G-0001-YR.8, AFOSR-ONR Contract F49620-94-1-0199, and ARPA Contracts F19628-95-C-0118 and N00014-92-J-4033.

Research partially supported by a National Science Foundation Graduate Fellowship.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi and L. Lamport. Composing specifications. ACM Transactions on Programming Languages and Systems, 1(15):73–132, 1993.

    Article  Google Scholar 

  2. 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  Google Scholar 

  3. 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 Grossman et al. [8], pages 209–229.

    Google Scholar 

  4. J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.

    Google Scholar 

  5. D.J.B. Bosscher, I. Polak, and F.W. Vaandrager. Verification of an audio control protocol. In Proc. FTRTFT'94, LNCS 863, pages 170–192. Springer-Verlag, 1994.

    Google Scholar 

  6. D. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits. ACM Distinguished Dissertations. MIT Press, 1988.

    Google Scholar 

  7. R. Gawlick, R. Segala, J.F. Søgaard-Andersen, and N. Lynch. Liveness in timed and untimed systems. In Proceedings 21th ICALP, LNCS 820. Springer-Verlag, 1994. A full version appears as MIT Technical Report number MIT/LCS/TR-587.

    Google Scholar 

  8. R.L. Grossman, A. Nerode, A.P. Ravn, and H. Rischel, editors. Hybrid Systems, LNCS 736. Springer-Verlag, 1993.

    Google Scholar 

  9. L. Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872–923, March 1994.

    Article  Google Scholar 

  10. N.A. Lynch. Modelling and verification of automated transit systems, using timed automata, invariants and simulations, 1996. This volume.

    Google Scholar 

  11. N.A. Lynch and M.R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings 6th PODC, pages 137–151, August 1987. A full version is available as MIT Technical Report MIT/LCS/TR-387.

    Google Scholar 

  12. N.A. Lynch and F.W. Vaandrager. Forward and backward simulations — part II: Timing-based systems. Report CS-R9314, CWI, Amsterdam, March 1993. To appear in Information and Computation.

    Google Scholar 

  13. N.A. Lynch and F.W. Vaandrager. Forward and backward simulations. part I: Untimed systems. Information and Computation, 121(2):214–233, September 1995.

    Article  Google Scholar 

  14. N.A. Lynch and H.B. Weinberg. Proving correctness of a vehicle maneuver: Deceleration. In Proceedings Second European Workshop on Real-Time and Hybrid Systems, Grenoble, France, June 1995.

    Google Scholar 

  15. O. Maler, Z. Manna, and A. Pnueli. From timed to hybrid systems. In Proceedings REX Workshop, LNCS 600, pages 447–484. Springer-Verlag, 1992.

    Google Scholar 

  16. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, 1992.

    Google Scholar 

  17. A. Nerode and A. Yakhnis. Concurrent programs as strategies in games. In Y. Moschovakis, editor, Logic from Computer Science. Springer-Verlag, 1992.

    Google Scholar 

  18. A. Pnueli and J. Sifakis, editors. Special Issue on Hybrid Systems of Theoretical Computer Science, 138(1). Elsevier Science Publishers, February 1995.

    Google Scholar 

  19. E.D. Sontag. Mathematical Control Theory — Deterministic Finite Dimensional Systems, TAM 6. Springer-Verlag, 1990.

    Google Scholar 

  20. H.B. Weinberg, N.A. Lynch, and N. Delisle. Verification of automated vehicle protection systems, 1996. This volume.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Frits Vaandrager .

Editor information

Rajeev Alur Thomas A. Henzinger Eduardo D. Sontag

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lynch, N., Segala, R., Vaandrager, F., Weinberg, H.B. (1996). Hybrid I/O automata. In: Alur, R., Henzinger, T.A., Sontag, E.D. (eds) Hybrid Systems III. HS 1995. Lecture Notes in Computer Science, vol 1066. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020971

Download citation

  • DOI: https://doi.org/10.1007/BFb0020971

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61155-4

  • Online ISBN: 978-3-540-68334-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics