Amit Bhatia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Amit Bhatia has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Emilio Frazzoli
Massachusetts Institute of Technology
1 shared publication - Emilio Frazzoli
Dynamical Systems and Computation University of California at Santa Barbara University of California at Los Angeles
1 shared publication
Latest Publications
- Open Access
Sampling-Based Resolution-Complete Algorithms for Safety Falsification of Linear Systems
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.
Open AccessSampling-Based Resolution-Complete Algorithms for Safety Falsification of Linear Systems
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.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3297-3302
Resolution-complete safety falsification of continuous time systems
In this paper we consider a class of analysis problems for control systems, aimed at safety falsification, i.e., checking whether a controlled trajectory exists that violates a given safety property. We introduce a notion of resolution completeness for safety falsification, and present a resolution-complete algorithm applicable to continuous-time LTI systems. The algorithm is based on deterministic incremental search procedures, building feasible trajectories exploring the reachable set at increasing resolution levels. Given a target resolution, the algorithm terminates either with a trajectory that violates the safety specification, or proves that no input within a certain class exists that violates the specification
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3297-3302
Resolution-complete safety falsification of continuous time systems
In this paper we consider a class of analysis problems for control systems, aimed at safety falsification, i.e., checking whether a controlled trajectory exists that violates a given safety property. We introduce a notion of resolution completeness for safety falsification, and present a resolution-complete algorithm applicable to continuous-time LTI systems. The algorithm is based on deterministic incremental search procedures, building feasible trajectories exploring the reachable set at increasing resolution levels. Given a target resolution, the algorithm terminates either with a trajectory that violates the safety specification, or proves that no input within a certain class exists that violates the specification