Advertisement

Analysis of slope-parametric hybrid automata

  • Frédéric Boniol
  • Augusto Burgueño
  • Olivier Roux
  • Vlad Rusu
Short Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1201)

Abstract

This paper addresses the analysis of slope-parametric hybrid automata: finding conditions on the slopes of the automaton variables, for some safety property to be verified. The problem is shown decidable in some practical situations (e.g. finding the running speeds of tasks in a real time application, for all tasks to respect their deadlines). The resolution technique generalizes polyhedral-based symbolic analysis and it involves reasoning about polyhedra with parametric shapes.

Keywords

real-time system hybrid automata parametric polyhedra 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ACH+95.
    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.Google Scholar
  2. AHH93.
    R. Alur, T. A. Henzinger, and P-H. Ho. Automatic symbolic verification of embedded systems. In Proc. 14th Annual Real-time Systems Symposium, RTSS'93, pages 2–11. IEEE Computer Society Press, 1993.Google Scholar
  3. AHV93.
    R. Alur, T. A. Henzinger, and M. Y. Vardi. Parametric real-time reasoning. In Proc. of the 25th Annual ACM Symposium on Theory of Computing, STOC'93, pages 592–601, 1993.Google Scholar
  4. HH94.
    T. A. Henzinger and P.-H. Ho. HyTech: the cornell HYbrid TECHnology tool. In P. Antsaklis, W. Kohn, A. Nerode, and S. Sastry, editors, Hybrid Systems II, volume 999 of Lecture Notes in Computer Science, pages 265–294. Springer-Verlag, 1994.Google Scholar
  5. HKPV95.
    T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata? In Proc. of the 27th Annual ACM Symposium on Theory of Computing, STOC'95, pages 373–382, 1995.Google Scholar
  6. 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
  7. Zie95.
    G. M. Ziegler. Lectures on Polytopes, volume 152 of Graduate Texts in Mathematics. Springer-Verlag, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Frédéric Boniol
    • 1
  • Augusto Burgueño
    • 1
  • Olivier Roux
    • 2
  • Vlad Rusu
    • 2
  1. 1.Département d'InformatiqueONERA-CERTToulouse Cedex 4France
  2. 2.LAN URA CNRS N. 823, Ecole Centrale de NantesUniversité de NantesNantes Cedex 3France

Personalised recommendations