Safety verification of non-linear hybrid systems is quasi-decidable

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F14%3A00423370" target="_blank" >RIV/67985807:_____/14:00423370 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s10703-013-0196-2" target="_blank" >http://dx.doi.org/10.1007/s10703-013-0196-2</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10703-013-0196-2" target="_blank" >10.1007/s10703-013-0196-2</a>

Result language
angličtina
Original language name
Safety verification of non-linear hybrid systems is quasi-decidable
Original language description
Safety verification of hybrid systems is undecidable, except for very special cases. In this paper, we circumvent undecidability by providing a verification algorithm that provably terminates for all robust problem instances, but need not necessarily terminate for non-robust problem instances. A problem instance x is robust iff the given property holds not only for x itself, but also when x is perturbed a little bit. Since, in practice, well-designed hybrid systems are usually robust, this implies thatthe algorithm terminates for the cases occurring in practice. In contrast to earlier work, our result holds for a very general class of hybrid systems, and it uses a continuous time model.
Czech name
—
Czech description
—

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

Project
<a href="/en/project/GCP202%2F12%2FJ060" target="_blank" >GCP202/12/J060: Integrated Verification and Falsification of Hybrid Systems of Industrial Size</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Similar results(10)