The algorithmic analysis of hybrid systems

DMCA

The algorithmic analysis of hybrid systems (1995)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by R. Alur , C. Courcoubetis , N. Halbwachs , T. A. Henzinger , P.-H. Ho , X. Nicollin , A. Olivero , J. Sifakis , S. Yovine

Venue:	THEORETICAL COMPUTER SCIENCE
Citations:	768 - 72 self

BibTeX

@ARTICLE{Alur95thealgorithmic,
    author = {R. Alur and C. Courcoubetis and N. Halbwachs and T. A. Henzinger and P.-H. Ho and X. Nicollin and A. Olivero and J. Sifakis and S. Yovine},
    title = {The algorithmic analysis of hybrid systems},
    journal = {THEORETICAL COMPUTER SCIENCE},
    year = {1995},
    volume = {138},
    pages = {3--34}
}

OpenURL

Abstract

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. We model hybrid systems as nite automata equipped with variables that evolve continuously with time according to dynamical laws. For verification purposes, we restrict ourselves to linear hybrid systems, where all variables follow piecewise-linear trajectories. We provide decidability and undecidability results for classes of linear hybrid systems, and we show that standard program-analysis techniques can be adapted to linear hybrid systems. In particular, we consider symbolic model-checking and minimization procedures that are based on the reachability analysis of an infinite state space. The procedures iteratively compute state sets that are definable as unions of convex polyhedra in multidimensional real space. We also present approximation techniques for dealing with systems for which the iterative procedures do not converge.

Keyphrases

hybrid system algorithmic analysis present approximation technique multidimensional real space compute state set general framework piecewise-linear trajectory discrete program formal specification undecidability result verification purpose nite automaton analog environment infinite state space dynamical law minimization procedure symbolic model-checking convex polyhedron standard program-analysis technique linear hybrid system iterative procedure reachability analysis

DMCA