Uniformity for the decidability of hybrid automata

  • Olivier Roux
  • Vlad Rusu
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1145)


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.


decidability uniformity hybrid automata symbolic verification temporal logic Tctl 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ACD90]
    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. [ACH+95]
    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. [BER94]
    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. [BES93]
    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. [BGK+96]
    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. [Hal93]
    Nicolas Halbwachs. Synchronous Programming of Reactive Systems, Kluwer Academic Publishers, 1993.Google Scholar
  7. [Hen95]
    T.A. Henzinger. Hybrid automata with finite bisimulatiorts. In Proc. 22th International Colloquium on Automata, Languages, and Programming, LNCS 944, 1995.Google Scholar
  8. [HH95]
    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. [HHWT94]
    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. [HKPV95]
    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. [HNSY94]
    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. [HPR94]
    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. [KPSY93]
    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. [OSY94]
    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. [PV94]
    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. [RCCE92]
    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. [RR94]
    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. [RR95]
    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. [Rus96]
    V. Rusu. Vérification temporelle de programmes Electee PhD thesis, Laboratoire d'Automatique de Nantes, Ecole Centrale de Nantes (FRANCE), 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Olivier Roux
    • 1
  • Vlad Rusu
    • 2
  1. 1.Institut Universitaire de France and Laboratoire d'Automatique de NantesFrance
  2. 2.Laboratoire d'Automatique de NantesCNRS, Univ.Nantes, Ecole Centrale de NantesNantes Cedex 03France

Personalised recommendations