Algorithmic Verification of Continuous and Hybrid Systems

Oded Maler · Electronic Proceedings in Theoretical Computer Science · 2014

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.

Read the paper · More papers on PaperTik