Sampling-Based Resolution-Complete Algorithms for Safety Falsification of Linear Systems

From MaRDI portal
Publication:3523142

DOI10.1007/978-3-540-78929-1_45zbMATH Open1144.93309arXiv0801.0570OpenAlexW1613235480MaRDI QIDQ3523142FDOQ3523142


Authors: Amit Bhatia, Emilio Frazzoli Edit this on Wikidata


Publication date: 2 September 2008

Published in: Hybrid Systems: Computation and Control (Search for Journal in Brave)

Abstract: In this paper, we describe a novel approach for checking safety specifications of a dynamical system with exogenous inputs over infinite time horizon that is guaranteed to terminate in finite time with a conclusive answer. We introduce the notion of resolution completeness for analysis of safety falsification algorithms and propose sampling-based resolution-complete algorithms for safety falsification of linear time-invariant discrete time systems over infinite time horizon. The algorithms are based on deterministic incremental search procedures, exploring the reachable set for feasible counter examples to safety at increasing resolution levels of the input. Given a target resolution of inputs, the algorithms are guaranteed to terminate either with a reachable state that violates the safety specification, or prove that no input exists at the given resolution that violates the specification.


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




Recommendations




Cited In (7)

Uses Software





This page was built for publication: Sampling-Based Resolution-Complete Algorithms for Safety Falsification of Linear Systems

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