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

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F07%3A00079196" target="_blank" >RIV/67985807:_____/07:00079196 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Guaranteed Termination in the Verification of LTL Properties of Non-Linear Robust Discrete Time Hybrid Systems
Original language description
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 non-linear robust discrete-time hybrid systems. We argue, that?in industrial practice?safety critical control applications give rise to hybrid systems that are robust. We give first results on the application of this approach to a variant of an aircraft collision avoidance protocol
Czech name
Zaručená terminace ve verifikaci nelineárních robustních hybridních systémů v diskrétním čase
Czech description
Přestože verifikace a falsifikace LTL-požadavek je nerozhodnutelná, dokážeme terminaci jednoho takového algoritmu pro všechny vstupy, které jsou robustní.

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)