Guaranteed Termination in the Verification of LTL Properties of Non-linear Robust Discrete Time Hybrid Systems
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.
KeywordsModel Check Hybrid System Transition System Interval Arithmetic Safety Property
Unable to display preview. Download preview PDF.
- 3.Bienmüller, T., Brockmeyer, U., Damm, W.: et al. Formal verification of an avionics application using abstraction and symbolic model checking. In: Redmill, F., Anderson, T. (eds.) Towards System Safety—Proc. of the 7th Safety-critical Systems Symp., pp. 150–173. Springer, Heidelberg (1999)Google Scholar
- 5.Chutinan, A., Krogh, B.H.: Computing polyhedral approximations to flow pipes for dynamic systems. In: 37th IEEE Conference on Decision and Control: Session on Synthesis and Verification of Hybrid Control Laws, TM-01 (1998)Google Scholar
- 7.Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)Google Scholar
- 14.Ratschan, S.: Rsolver. Software package (2004), http://rsolver.sourceforge.net