Algorithmic Verification of Stability of Hybrid Systems
The Institute of Information Systems hosted a talk by Pavithra Prabhakar.
|DATE:||Thursday, November 27, 2014|
Hybrid systems refer to systems exhibiting mixed discrete-continuous behaviors and arise as a natural byproduct of the interaction of a network of embedded processors with physical systems. In this talk, we focus on the verification of stability of hybrid control systems. Stability is a fundamental property in control system design and captures the notion that small perturbations to the initial state or input to the system result in only small variations in the eventual behavior of the system. We present foundations for approximation based analysis of stability, and discuss an algorithmic approach for stability analysis based on predicate abstraction and counter-example guided abstraction refinement. In contrast to the well-known methods for automated verification of stability based on Lyapunov functions, which are deductive, our approach is algorithmic.