Guaranteed Termination in the Verification of LTL Properties of Non-linear Robust Discrete Time Hybrid Systems

  • Werner Damm
  • Guilherme Pinto
  • Stefan Ratschan
Conference paper

DOI: 10.1007/11562948_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3707)
Cite this paper as:
Damm W., Pinto G., Ratschan S. (2005) Guaranteed Termination in the Verification of LTL Properties of Non-linear Robust Discrete Time Hybrid Systems. In: Peled D.A., Tsay YK. (eds) Automated Technology for Verification and Analysis. ATVA 2005. Lecture Notes in Computer Science, vol 3707. Springer, Berlin, Heidelberg

Abstract

We present a novel approach to the automatic verification and falsification of LTL requirements of non-linear discrete-time hybrid systems. The verification tool uses an interval-based constraint solver for non-linear robust constraints to compute incrementally refined abstractions. Although the problem is in general undecidable, we prove termination of abstraction refinement based verification and falsification of such properties for the class of robust non-linear hybrid systems, thus significantly extending previous semi-decidability results. We argue, that safety critical control applications are robust hybrid systems. We give first results on the application of this approach to a variant of an aircraft collision avoidance protocol.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Werner Damm
    • 1
  • Guilherme Pinto
    • 1
  • Stefan Ratschan
    • 2
  1. 1.Carl v. Ossietzky UniversitätOldenburgGermany
  2. 2.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations