A new verification algorithm for planar differential inclusions
Gordon PACE
University of Malta, Department of Computer Science
MSD 06 Msida, MALTE

Polygonal hybrid systems are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions (SPDIs). Using an important object of SPDIs' phase portrait, the invariance kernels, which can be computed non-iteratively, we present a breadth-first search algorithm for solving the reachability problem for SPDIs. Invariance kernels play an important role in the termination of the algorithm.

Slides (.ppt)