Ariadne: a framework for reachability analysis of hybrid automata

Abstract

In this paper we introduce the problem of reachability analysis of hybrid automata to decide safety properties. Then we describe ARIADNE, an in-progress open environment to design algorithms for computing with hybrid automata. We show that ARIADNE relies on a rigorous computable analysis theory to represent geometric objects, in order to achieve provable approximation bounds along the computations. The proposed tool differs from existing ones because it relies on a sound theoretical basis for the semantics of operators in continuous space and time, making available exact and approximate, but error-bounded operations on geometric points and sets. Currently the geometry module is substantially completed, and work is in progress on the evaluation module. As a first application, we will use ARIADNE to compute the reachable sets of a challenging collection of benchmarks whose safety properties have practical interest