Algorithmic Verification of Continuous and Hybrid Systems

TL;DR

This paper introduces reachability computation techniques for verifying continuous and hybrid systems, offering a way to replace numerous simulations with a more efficient computational approach.

Contribution

It provides a tutorial on reachability methods, extending verification techniques to continuous and hybrid systems, which was less developed before.

Findings

Reachability computation can verify systems more efficiently than extensive simulations.

The tutorial bridges the gap between discrete verification methods and continuous/hybrid systems.

It demonstrates the potential to replace infinite simulations with computational techniques.

Abstract

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.