• On May 28, instead of the regular lecture there was a talk given by Dr. Thomas Sturm. For further information please visit the website of AlgoSyn.

• Language of teaching is German.

• The access data for the slides can be obtained during the lessons.

 

Elemantary knowledge in automata theory and mathematical logic is helpful to understand the topic. Nevertheless, at least short introductions can be given to the fields needed if the audience appreciates this.

The slides can be downloaded from the RWTH-intern network or via vpn. If problems occur please contact Ulrich Loup.

• Lecture 1
• Lecture 2
• Lecture 3
• Lecture 4 (Additional reading: Henzinger et al.: What’s decidable about hybrid automata?, Journal of Computer and System Sciences, 57:94–124, 1998)
• Lecture 5 (Additional reading: Alur et al.: The algorithmic analysis of hybrid systems, Theoretical Computer Science 138(1):3-34, 1995)
• Lecture 6 (Additional reading: Biere et al.: Bounded Model Checking, Advances in Computers, Volume 58, 2003)
• Lecture 7 (Software: Yices, Example inputs: 0, 1, 2, 3)
• Lecture 8 (Additional reading: Stursberg and Krogh: Efficient Representation and Computation of Reachable Sets for Hybrid Systems, Chutinan and Krogh: Computing Polyhedral Approximations to Flow Pipes for Dynamic Systems)
• Lecture 9 (Additional reading: Sproston: Decidable Model Checking of Probabilistic Hybrid Automata)