Algorithmic Verification of Stability of Hybrid Systems
- 15:00 25th November 2013 ( week 7, Michaelmas Term 2013 )051
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. Hybrid systems manifest in safety critical application domains including aeronautics, automotive, robotics and power systems. Reliability is of utmost importance and a grand challenge in the area is the development of techniques and tools to aid the development of high-confidence hybrid systems.
In this talk, we focus on the verification of stability of hybrid 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 concrete approximation techniques analogous to predicate abstraction for stability analysis. In contrast to the well-known methods for automated verification of stability based on Lyapunov functions, which are deductive, we present algorithmic techniques for stability analysis.
Speaker bio
Pavithra Prabhakar obtained her doctorate in Computer Science and a masters in Applied Mathematics from the University of Illinois at Urbana-Champaign in 2011 and 2010, respectively. 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.Share this:
