EECI 2013: Algorithmic Verification of Hybrid Systems

From MurrayWiki
Jump to: navigation, search
Prev: Deductive Verification Course home Next: Protocol Synthesis

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.

Lecture Materials

Further Reading