English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

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

MPS-Authors
/persons/resource/persons45262

Ratschan,  Stefan
Programming Logics, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Damm, W., Pinto, G., & Ratschan, S. (2005). Guaranteed Termination in the Verification of LTL Properties of Non-linear Robust Discrete Time Hybrid Systems. In Automated technology for verification and analysis: Third International Symposium, ATVA 2005 (pp. 99-113). Berlin, Germany: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-26B0-E
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 \textit{robust non-linear hybrid systems}, thus significantly extending previous semi-decidability results. We argue, that safety critical control applications \textit{are} robust hybrid systems. We give first results on the application of this approach to a variant of an aircraft collision avoidance protocol. %