EECI 2012: Algorithmic Verification of Hybrid Systems
|Prev: Deductive Verification of Hybrid Systems||Course home||Next: Synthesis of Reactive Control Protocols|
This lecture focuses on the verification of hybrid systems. We first discuss finite-state under- and over-approximations of hybrid dynamics and how these finite-state models coupled with the model checking tools can be used to verify temporal logic properties against hybrid dynamics. Then, we present a procedure for constructing finite-state, under-approximations which will later be used in the course in the synthesis of hierarchical control protocols. We finally introduce the notions of approximate bisimulations and bisimulation functions and how they can be used in verification of temporal properties.
Additional Material and Further Reading
Stephen Prajna's dissertation on verifying temporal properties for hybrid dynamical systems.
Help on SOS: a paper on the very basics of sum-of-squares programming and their use in nonlinear system verification.
Minimizing Polynomial Functions by P. Parrilo and B. Sturmfels on global optimization of polynomial functions and Positivstellensatz (generalizations of the S-procedure).
Lecture Notes on Hybrid Systems (by John Lygeros): A rough introduction to hybrid systems. Chapters 5 and 6 are on various analysis techniques relevant for this short course.