Linear Hybrid System Falsification through Local Search

DOI10.1007/978-3-642-24372-1_39zbMATH Open1348.68087arXiv1105.1733OpenAlexW93764711MaRDI QIDQ3172941FDOQ3172941

Georgios E. Fainekos, Houssam Abbas

Publication date: 7 October 2011

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Abstract: In this paper, we address the problem of local search for the falsification of hybrid automata with affine dynamics. Namely, if we are given a sequence of locations and a maximum simulation time, we return the trajectory that comes the closest to the unsafe set. In order to solve this problem, we formulate it as a differentiable optimization problem which we solve using Sequential Quadratic Programming. The purpose of developing such a local search method is to combine it with high level stochastic optimization algorithms in order to falsify hybrid systems with complex discrete dynamics and high dimensional continuous spaces. Experimental results indicate that indeed the local search procedure improves upon the results of pure stochastic optimization algorithms.

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

zbMATH Keywords

simulationrobustnesshybrid systemsmodel validation and analysis

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Stochastic programming (90C15)

Cited In (2)

• Extracting counterexamples induced by safety violation in linear hybrid systems
• Solving reachability problems by a scalable constrained optimization method

Uses Software

• SpaceEx

This page was built for publication: Linear Hybrid System Falsification through Local Search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172941)