Skip to main content
SpringerLink
Log in

Uniformity for the decidability of hybrid automata

  • Contributed Papers
  • Conference paper
  • First Online:
Static Analysis (SAS 1996)

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

Included in the following conference series:

Abstract

We present some new decidability results on the verification of hybrid automata by symbolic analysis (abstract interpretation using polyhedra). The results include defining a class of hybrid automata for which all properties expressed in the real-time temporal logic Tctl are decidable. The obtained class of automata is shown powerful enough to model reactive applications in which every task eventually terminates within uniformly-bounded time. Indeed, the restrictions we use for obtaining decidability have a physical meaning, and they all impose some kind of uniformity to the runs of hybrid automata.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-time systems. In Proc. IEEE 5th Symp. Logic in Computer Science, 1990.

    Google Scholar 

  2. R. Alur, C. Courcoubetis, N. Halbwachs, T. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science B, 137, January 1995.

    Google Scholar 

  3. A. Bouajjani, R. Echahed, and R. Robbana. Verifying invariance properties for timed systems with duration variables. In Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, 1994.

    Google Scholar 

  4. A. Bouajjani, R. Echahed, and J. Sifakis. On model checking for real-time properties with durations. In Proc Symp. on Logic in Computer Science'93, INCS, 1993.

    Google Scholar 

  5. J. Bengtsson, D. Griffioen, K. Kristoferssen, K.Larsen, F.Larsson, P.Petersson, and W.Yi. Verification of an audio protocol with bus collision using UPPAAL. In Computer-Aided Verification, 1996.

    Google Scholar 

  6. Nicolas Halbwachs. Synchronous Programming of Reactive Systems, Kluwer Academic Publishers, 1993.

    Google Scholar 

  7. T.A. Henzinger. Hybrid automata with finite bisimulatiorts. In Proc. 22th International Colloquium on Automata, Languages, and Programming, LNCS 944, 1995.

    Google Scholar 

  8. T.A. Henzinger and P.H. Ho. Algorithmic analysis of nonlinear hybrid systems. In Proc. 7th Conf. Computer-Aided Verification, LNCS 939, 1995.

    Google Scholar 

  9. T.A. Henzinger, P.H. Ho, and H. Wong-Toi. A user guide to hytech. In Proc. 1st. Workshop on Tools and Algorithms for the Analisys of Systems, LNCS, 1994.

    Google Scholar 

  10. T.A. Henzinger, P.W. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata. In STOCS'95, LNCS, 1995.

    Google Scholar 

  11. T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic modelchecking for real-time systems. Information and Computation, (111):193–244, 1994.

    Google Scholar 

  12. N. Halbwachs, Y. E. Proy, and P. Raymond. Verification of linear hybrid systems by means of convex approximations. In International Symposium on Static Analysis, 1994.

    Google Scholar 

  13. Y. Kesten, A. Pnueli, J. Sifakis, and S. Yovine. Integration graphs: a class of decidable hybrid systems. In Proc. Workshop on Theory of Hybrid Systems, LNCS, 1993.

    Google Scholar 

  14. A. Olivero, J. Sifakis, and S. Yovine. Using abstractions for the verification of linear hybrid systems. In Proc. Conference on Computer Aided Verification, 1994.

    Google Scholar 

  15. A. Puri and P. Varaiya. Decidability of hybrid systems with rectangular differential inclusions. In Proc. Conference on Computer-Aided Verification, LNCS, 1994.

    Google Scholar 

  16. O. Roux, D. Creusot, F. Cassez, and J.P. Elloy. Le langage réactif asynchrone ELECTRE. Technique et Science Informatiques (TSI), 11(5):35–66, 1992.

    Google Scholar 

  17. O. Roux and V. Rusu. Deciding time-bounded properties for Electre reactive programs with stopwatch automata. In Proc. Workshop on Hybrid Systems and Autonomous Control (Lecture Notes in Computer Science 999), pages 405–416, 1994.

    Google Scholar 

  18. O. Roux and V. Rusn. Decidable hybrid automata to model and verify real-time systems. In Second European Workshop on Real-Time and Hybrid Systems, 1995.

    Google Scholar 

  19. V. Rusu. Vérification temporelle de programmes Electee PhD thesis, Laboratoire d'Automatique de Nantes, Ecole Centrale de Nantes (FRANCE), 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut Universitaire de France and Laboratoire d'Automatique de Nantes, France

    Olivier Roux

  2. Laboratoire d'Automatique de Nantes, CNRS, Univ.Nantes, Ecole Centrale de Nantes, 44072, Nantes Cedex 03, France

    Vlad Rusu

Authors
  1. Olivier Roux
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vlad Rusu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Radhia Cousot David A. Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Roux, O., Rusu, V. (1996). Uniformity for the decidability of hybrid automata. In: Cousot, R., Schmidt, D.A. (eds) Static Analysis. SAS 1996. Lecture Notes in Computer Science, vol 1145. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61739-6_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-61739-6_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61739-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation