Sampling-Based Resolution-Complete Algorithms for Safety Falsification of Linear Systems - Mathematics > Optimization and ControlReport as inadecuate




Sampling-Based Resolution-Complete Algorithms for Safety Falsification of Linear Systems - Mathematics > Optimization and Control - Download this document for free, or read online. Document in PDF available to download.

Abstract: In this paper, we describe a novel approach for checking safetyspecifications of a dynamical system with exogenous inputs over infinite timehorizon that is guaranteed to terminate in finite time with a conclusiveanswer. We introduce the notion of resolution completeness for analysis ofsafety falsification algorithms and propose sampling-based resolution-completealgorithms for safety falsification of linear time-invariant discrete timesystems over infinite time horizon. The algorithms are based on deterministicincremental search procedures, exploring the reachable set for feasible counterexamples to safety at increasing resolution levels of the input. Given a targetresolution of inputs, the algorithms are guaranteed to terminate either with areachable state that violates the safety specification, or prove that no inputexists at the given resolution that violates the specification.



Author: Amit Bhatia 1, Emilio Frazzoli 2 1 University of California at Los Angeles, 2 Massachusetts Institute of Technology

Source: https://arxiv.org/







Related documents