Reachability analysis consists in computing the set of states that are reachable by a
dynamical system from all initial states and for all admissible inputs and parameters. It is a …

We present a general framework for the formal specification and algorithmic analysis of
hybrid systems. A hybrid system consists of a discrete program with an analog environment …

In this paper, we propose a method for the automatic construction of an abstract state graph
of an arbitrary system using the Pvs theorem prover. Given a parallel composition of …

Hybrid automata model systems with both digital and analog components, such az
embedded control programs. Many verification tasks for such programs can be expressed as …

A hybrid system consists of a collection of digital programs that interact with each other and
with an analog environment. Examples of hybrid systems include medical equipment …

Since its inception as a student project in 2001, initially just for the handling (as the name
implies) of convex polyhedra, the Parma Polyhedra Library has been continuously improved …

We describe a new technique for finding potential buffer overrun vulnerabilities in security-
critical C code. The key to success is to use static analysis: we formulate detection of buffer …

Presents a model-checking procedure and its implementation for the automatic verification
of embedded systems. The system components are described as hybrid automata …

Petrinets (PNs) are widely used to model discrete event dynamic systems (computer
systems, manufacturing systems, communication systems, etc). Continuous Petri nets (in …

We present two methods for translating nonlinear hybrid systems into linear hybrid
automata. Properties of the nonlinear systems can then be inferred from the automatic …