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

Authors:
Amit Bhatia;Emilio Frazzoli
Affiliations:
University of California at Los Angeles, Los Angeles, CA 90095;Massachusetts Institute of Technology, Cambridge, MA 02139
Venue:
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Year:
2008

Citing 3
Cited 2

Integration Graphs: A Class of Decidable Hybrid Systems

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

HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Approximately bisimilar finite abstractions of stable linear systems

HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control

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

HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate

TAP '09 Proceedings of the 3rd International Conference on Tests and Proofs

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we describe a novel approach for checking safety specifications of a dynamical system with exogenous inputs over infinite time horizon. We introduce the notion of resolution completeness for analysis of safety falsification algorithms and present sampling-based resolution-complete algorithms for safety falsification of discrete-time linear time-invariant systems. Given a target resolution of inputs, the algorithms terminate either with a reachable state that violates the safety specification, or prove that the system does not violate the specification at the given resolution of inputs.