Combined Global and Local Search for the Falsification of Hybrid Systems

DOI10.1007/978-3-319-10512-3_11zbMath1448.68303arXiv1406.6332OpenAlexW32833432MaRDI QIDQ5500561

Stefan Ratschan, Jan Kuřátko

Publication date: 6 August 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.6332

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items (6)

Effective hybrid system falsification using Monte Carlo tree search guided by QB-robustness ⋮ The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints ⋮ Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots ⋮ Solving reachability problems by a scalable constrained optimization method ⋮ The \texttt{ksmt} calculus is a \(\delta \)-complete decision procedure for non-linear constraints ⋮ Falsification of hybrid systems with symbolic reachability analysis and trajectory splicing

This page was built for publication: Combined Global and Local Search for the Falsification of Hybrid Systems