Automated Technology for Verification and Analysis

Volume 3707 of the series Lecture Notes in Computer Science pp 99-113

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

  • Werner DammAffiliated withLancaster UniversityCarl v. Ossietzky Universität
  • , Guilherme PintoAffiliated withLancaster UniversityCarl v. Ossietzky Universität
  • , Stefan RatschanAffiliated withLancaster UniversityMax-Planck-Institut für Informatik

* Final gross prices may vary according to local VAT.

Get Access


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.