Skip to main content
SpringerLink
Log in

Verification of linear hybrid systems by means of convex approximations

  • Conference paper
  • First Online:
Static Analysis (SAS 1994)

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

Included in the following conference series:

Abstract

We present a new application of the abstract interpretation by means of convex polyhedra, to a class of hybrid systems, i.e., systems involving both discrete and continuous variables. The result is an efficient automatic tool for approximate, but conservative, verification of reachability properties of these systems.

This work has been partly supported ESPRIT-BRA action “REACT” and by a grant from Merlin-Gerin.

Verimag is a joint laboratory of CNRS, Institut National Polytechnique de Grenoble, Université Joseph Fourier and Verilog SA associated with IMAG.

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 of real-time systems. In Fifth IEEE Symposium on Logic in Computer Science, Philadelphia, 1990.

    Google Scholar 

  2. R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, and H. Wong-Toi. An implementation of three algorithms for timing verification based on automata emptiness. In 13th IEEE Real-Time Systems Symposium, Phoenix (Az), December 1992.

    Google Scholar 

  3. R. Alur, C. Courcoubetis, T. A. Henzinger, and Pei-Hsin Ho. Hybrid automata: an algorithmic approach to the specification and analysis of hybrid systems. In Workshop on Theory of Hybrid Systems, Lyngby, Denmark, October 1993. LNCS 736, Springer Verlag.

    Google Scholar 

  4. R. Alur and D. Dill. Automata for modeling real-time systems. In ICALP'90, 1990.

    Google Scholar 

  5. R. Alur, T. A. Henzinger, and Pei-Hsin Ho. Automatic symbolic verification of embedded systems. In RTTS93, 1993.

    Google Scholar 

  6. R. Alur. Techniques for automatic verification of real-time systems. Phd thesis, Stanford University, August 1991.

    Google Scholar 

  7. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th ACM Symposium on Principles of Programming Languages, Los Angeles, January 1977.

    Google Scholar 

  8. P. Cousot and R. Cousot. Comparing the Galois connection and widenning/narrowing approaches to abstract interpretation. Research Report LIX/RR/92/09, Ecole Polytechnique, June 1992.

    Google Scholar 

  9. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In 5th ACM Symposium on Principles of Programming Languages, Tucson (Arizona), January 1978.

    Google Scholar 

  10. N. V. Chernikova. Algorithm for discovering the set of all solutions of a linear programming problem. U.S.S.R. Computational Mathematics and Mathematical Physics, 8(6):282–293, 1968.

    Article  Google Scholar 

  11. N. Halbwachs. Détermination automatique de relations linéaires vérifiées par les variables d'un programme. Thèse de 3e cycle, University of Grenoble, March 1979.

    Google Scholar 

  12. N. Halbwachs. Delay analysis in synchronous programs. In Fifth Conference on Computer-Aided Verification, Elounda (Greece), July 1993. LNCS 697, Springer Verlag.

    Google Scholar 

  13. T. A. Henzinger and P.-H. Ho. Model checking strategies for hybrid systems. In Conference on Industrial Applications of Artificial Intelligence and Expert Systems, 1994.

    Google Scholar 

  14. T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic modelchecking for real-time systems. In LICS'92, June 1992.

    Google Scholar 

  15. Y. Kesten, A. Pnueli, J. Sifakis, and S. Yovine. Integration graphs: a class of decidable hybrid systems. In Workshop on Theory of Hybrid Systems, Lyngby, Denmark, October 1993. LNCS 736, Springer Verlag.

    Google Scholar 

  16. L. Lamport. A fast mutual exclusion algorithm. ACM Transactions on Computer Systems, 5(1):1–11, 1987.

    Google Scholar 

  17. H. LeVerge. A note on Chernikova's algorithm. Research Report 635, IRISA, February 1992.

    Google Scholar 

  18. O. Maler, Z. Manna, and A. Pnueli. From timed to hybrid systems. In Rex Workshop on Real-Time: Theory in Practice, DePlasmolen (Netherlands), June 1991. LNCS 600, Springer Verlag.

    Google Scholar 

  19. X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. An approach to the description and analysis of hybrid systems. In Workshop on Theory of Hybrid Systems, Lyngby, Denmark, October 1993. LNCS 736, Springer Verlag.

    Google Scholar 

  20. H. Wong-Toi and D. Dill. Using iterative approximations for timing verification. In First AMAST International Workshop on Real-Time Systems, Iowa City (Iowa), November 1993.

    Google Scholar 

Download references

Author information

Author notes

  1. Nicolas Halbwachs & Pascal Raymond

    Present address: Verimag, Miniparc-Zirst, 38330, Montbonnot, France

Authors and Affiliations

  1. Merlin-Gerin, France

    Yann -Eric Proy

Authors
  1. Nicolas Halbwachs
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yann -Eric Proy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pascal Raymond
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Nicolas Halbwachs or Pascal Raymond .

Editor information

Baudouin Le Charlier

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Halbwachs, N., Proy, Y.E., Raymond, P. (1994). Verification of linear hybrid systems by means of convex approximations. In: Le Charlier, B. (eds) Static Analysis. SAS 1994. Lecture Notes in Computer Science, vol 864. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58485-4_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-58485-4_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58485-8

  • Online ISBN: 978-3-540-49005-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation