Verifying periodic task-control systems

  • Vlad Rusu
Short Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1201)


This paper deals with the automated verification of a class of task-control systems with periods, durations, and scheduling specifications. Such systems are translated into Periodic Hybrid Automata for verification. We show that safety, liveness, and time-bounded properties are decidable for the considered systems.


task-control systems periodic hybrid automata verification decidability 


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, LNCS, 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. 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, LNCS, 1996.Google Scholar
  4. DOY94.
    C. Daws, A. Olivero, and S. Yovine. Verifying ET-LOTOS programs with KRONOS. In Proc. FORTE'94, LNCS, 1994.Google Scholar
  5. 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
  6. HNSY94.
    T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model-checking for real-time systems. Information and Computation, (111), 1994.Google Scholar
  7. 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, LNCS, 1994.Google Scholar
  8. JMO93.
    M. Jourdan, F. Maraninchi, and A. Olivero. Verifying quantitative real-time properties of synchronous programs. In Computer-Aided Verification, LNCS 697, 1993.Google Scholar
  9. NSY92.
    X. Nicollin, J. Sifakis, and S. Yovine. Compiling real-time specifications into extended automata. IEEE Transactions on Software Engineering, 18(9):794–804, 1992.Google Scholar
  10. RR96.
    O. Roux and V. Rusu. Uniformity for the decidability of hybrid automata. In Internat. Static Analysis Symposium, LNCS 1145, pages 301–316, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Vlad Rusu
    • 1
  1. 1.Laboratoire d'Automatique de Nantes CNRS N∘823, École Centrale NantesUniv. NantesNantes Cedex 3France

Personalised recommendations