Combined Global and Local Search for the Falsification of Hybrid Systems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10319205" target="_blank" >RIV/00216208:11320/14:10319205 - isvavai.cz</a>
Alternative codes found
RIV/67985807:_____/14:00431640
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-10512-3_11" target="_blank" >http://dx.doi.org/10.1007/978-3-319-10512-3_11</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-10512-3_11" target="_blank" >10.1007/978-3-319-10512-3_11</a>

Result language
angličtina
Original language name
Combined Global and Local Search for the Falsification of Hybrid Systems
Original language description
In this paper we solve the problem of finding a trajectory that shows that a given hybrid dynamical system with deterministic evolution leaves a given set of states considered to be safe. The algorithm combines local with global search for achieving both efficiency and global convergence. In local search, it exploits derivatives for efficient computation. Unlike other methods for falsification of hybrid systems with deterministic evolution, we do not restrict our search to trajectories of a certain bounded length but search for error trajectories of arbitrary length.
Czech name
—
Czech description
—

Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
—
Continuities
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)