Safety verification and reachability analysis for hybrid systems is a very active research
domain. Many approaches that seem quite different, have been proposed to solve this …

Embedded systems are increasingly finding their way into a growing range of physical
devices. These embedded systems often consist of a collection of software threads …

The hybrid χ (Chi) formalism integrates concepts from dynamics and control theory with
concepts from computer science, in particular from process algebra and hybrid automata. It …

This paper introduces iterative relaxation abstraction (IRA), a new method for reachability
analysis of LHA that aims to improve scalability by combining the capabilities of current tools …

We present a fully automatic approach for counterexample guided abstraction refinement of
real-time systems modelled in a subset of timed automata. Our approach is implemented in …

In this paper, we present a counterexample guided abstraction refinement (CEGAR)
framework for systems modelled as rectangular hybrid automata. The main difference …

A symmetry of a dynamical system is a map that transforms any trajectory to another
trajectory. Abstractions have been a key building block in the theory and practice of hybrid …

In this paper we consider the problem of approximating the set of states reachable within a
time bound T in a linear dynamical system, to within a given error bound ε. Fixing a degree …

We consider the problem of safety verification for hybrid systems, whose continuous
dynamics in each mode is affine, ̇ X= AX+ b, and invariants and guards are specified using …

Abstract (Hybrid Abstraction-Refinement Engine) is a counterexample guided abstraction-
refinement (CEGAR) based tool to verify safety properties of hybrid automata, whose …