Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Hybrid Systems: Computation and Control

HSCC 2000: Hybrid Systems: Computation and Control pp 352–365Cite as

Hybrid Systems Verification by Location Elimination

  • Conference paper
  • First Online:

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

Abstract

In this paper we propose a verification method for hybrid systems that is based on a successive elimination of the various system locations involved. Briefly, with each such elimination we compute a weakest precondition (strongest postcondition) on the predecessor (successor) locations such that the property to be proved cannot be violated. Experiments show that this approach is particularly interesting in cases where a standard reachability analysis would require to travel often through some of the given system locations.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about 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. L. Dill. Model checking for real-time systems. In Proceedings of the 5th Annual Symposium on Logic in Computer Science, pages 414–425, 1990.

    Google Scholar 

  2. [ACH+95]_R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifaksi, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3–34, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  3. R. Alur, C. Courcoubetis, T. A. Henzinger, and P.-H. Ho. Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In R. L. Grossman, A. Nerode, A. P. Ravn, and H. Rischel, editors, Hybrid Systems, pages 209–229. Springer Verlag, Lecture Notes in Computer Science, vol. 736, 1993.

    Google Scholar 

  4. R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  5. R. Alur and T. A. Henzinger. Logics and models of real-time: A survey. In J.W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, editors, Real Time: Theory in Practice, pages 74–106. Springer Verlag, New York, LNCS 600, 1992.

    Chapter  Google Scholar 

  6. Rajeev Alur, Thomas A. Henzinger, and Pei-Hsin Ho. Automatic symbolic verification of embedded systems. IEEE Transactions on Software Engineering, 22(3):181–201, 1996.

    Article  Google Scholar 

  7. R. Alur, T. A. Henzinger, and E. Sontag, editors. Hybrid Systems III. Lecture Notes in Computer Science, Springer Verlag, 1996.

    Google Scholar 

  8. P. Antsaklis, A. Nerode, W. Kohn, and S. Sastry, editors. Hybrid Systems II. Lecture Notes in Computer Science, vol. 999, Springer Verlag, 1995.

    MATH  Google Scholar 

  9. R. L. Grossman, A. Nerode, A. P. Ravn, and H. Rischel, editors. Hybrid Systems. Springer Verlag, Lecture Notes in Computer Science, vol. 736, 1993.

    Google Scholar 

  10. T. A. Henzinger. The theory of hybrid automata. In Proceedings of the 11th LICS, pages 278–292. IEEE Comp. Soc. Press, 1996.

    Google Scholar 

  11. T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. In Proceedings of the 7th Annual Symposium on Logic in Computer Science, pages 394–406. IEEE Computer Society Press, New York, 1992.

    Google Scholar 

  12. Andreas Nonnengart. A deductive model checking approach for hybrid systems. Technical Report MPI-I-1999-2-006, Max-Planck-Institute for Computer Science, Saarbrücken, Germany, November 1999. Available via http://www.mpi-sb.mpg.de/.

    Google Scholar 

  13. Andreas Nonnengart, Hans Jürgen Ohlbach, and Andrzej Szałas. Elimination of predicate quantifiers. In Hans Jürgen Ohlbach and Uwe Reyle, editors, Logic, Language and Reasoning — Essays in Honour of Dov Gabbay. Kluwer, Dordrecht, Netherlands, 1999. ISBN: 0-7923-5687-X.

    Google Scholar 

  14. Andreas Nonnengart and Andrzej Szałas. A fixpoint approach to second-order quantifier elimination with applications to correspondence theory. Technical Report MPI-I-95-2-007, Max-Planck-Institute for Computer Science, Saarbrücken, Germany, March 1995. Available via: http://www.mpisb.mpg.de/.

    Google Scholar 

  15. Andreas Nonnengart and Andrzej Szalas. A fixpoint approach to second-order quantifier elimination with applications to correspondence theory. in: [Orł99], 1999.

    Google Scholar 

  16. Ewa Orłowska, editor. Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa, volume 24 of Studies in Fuzziness and Soft Computing. Physica-Verlag, c/o Springer Verlag, 1999. ISBN: 3-7908-1164-5.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Deutsches Forschungszentrum für Künstliche Intelligenz (DFKI GmbH), Im Stadtwald, Geb. 36, 66123, Saarbrücken, Germany

    Andreas Nonnengart

Authors
  1. Andreas Nonnengart
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA

    Nancy Lynch

  2. Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, 15235, USA

    Bruce H. Krogh

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nonnengart, A. (2000). Hybrid Systems Verification by Location Elimination. In: Lynch, N., Krogh, B.H. (eds) Hybrid Systems: Computation and Control. HSCC 2000. Lecture Notes in Computer Science, vol 1790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46430-1_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-46430-1_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67259-3

  • Online ISBN: 978-3-540-46430-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation