Verification of Linear Hybrid Systems by Means of Convex Approximations

Abstract

We present a new application of the abstract interpretation by means of convex polyhedra, to a class of hybrid systems, i.e., systems involving both discrete and continuous variables. The result is an eecient automatic tool for approximate, but conservative, veriication of reachability properties of these systems.

DOI: 10.1007/3-540-58485-4_43

Extracted Key Phrases

1 Figure or Table

Statistics

01020'95'97'99'01'03'05'07'09'11'13'15'17
Citations per Year

183 Citations

Semantic Scholar estimates that this publication has 183 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Halbwachs1994VerificationOL, title={Verification of Linear Hybrid Systems by Means of Convex Approximations}, author={Nicolas Halbwachs and Yann-Eric Proy and Pascal Raymond}, booktitle={SAS}, year={1994} }