Algorithmic Verification of Continuous and Hybrid Systems

Oded Maler

We provide a tutorial introduction to reachability computation, a class of computational techniques that exports verification technology toward continuous and hybrid systems. For open under-determined systems, this technique can sometimes replace an infinite number of simulations.

Invited Tutorial in Lukas Holik and Lorenzo Clemente: Proceedings 15th International Workshop on Verification of Infinite-State Systems (INFINITY 2013), Hanoi, Vietnam, 14th October 2013, Electronic Proceedings in Theoretical Computer Science 140, pp. 48–69.
Published: 23rd February 2014.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: