Difference between revisions of "EECI 2012: Deductive Verification of Hybrid Systems"

From Murray Wiki
Jump to navigationJump to search
Line 4: Line 4:

==  Lecture Materials ==
==  Lecture Materials ==
* Lecture slides: [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/L5_deductive.pdf Deductive Verification of Hybrid Systems]
* Lecture slides: [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/L5_deductive-16May12.pdf Deductive Verification of Hybrid Systems]

== Further Reading ==
== Further Reading ==

Revision as of 06:55, 16 May 2012

Prev: Computer Session: Spin Course home Next: Algorithmic Verification

This lecture focuses on the verification of hybrid systems using deductive (theorem proving) methods. We describe hybrid systems that combine continuous and discrete states. We then describe two methods for deductive verification. First, we discuss a computational procedure for constructing Lyapunov-type functions (e.g., barrier certificates) that witness the fact that a hybrid system satisfies certain temporal specifications. Second, we consider control protocols for cooperation and decision making in multi-agent systems, as illustrated by the RoboFlag example introduced in the first lecture. We show how to implement a simple protocol for distributed target assignment in a simplified version of the problem (the "RoboFlag drill") and prove stability of the protocol.

Lecture Materials

Further Reading

Additional Materials