Informatik, TU Wien

Algorithmic Verification of Stability of Hybrid Systems

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.

Abstract

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.

Biography

Pavithra Prabhakar obtained her doctorate in Computer Science from the University of Illinois at Urbana-Champaign in 2011. She has been on the faculty of IMDEA Software Institute since 2011 and spent the year between 2011-2012 as a CMI postdoctoral fellow at the California Institute of Technology. Her main research interest is in formal analysis of cyber-physical systems with emphasis on both foundational and practical aspects related to automated and scalable techniques for verification and synthesis of hybrid systems.

Note

This talk is organized by the Cyber-Physical Systems Group at the Institute of Computer Engineering.