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 efficient automatic tool for approximate, but conservative, verification of reachability properties of these systems.

Reference:

	@INPROCEEDINGS{halbwachs94b,
   	AUTHOR={N. Halbwachs and Y.-E. Proy and P. Raymond},
   	TITLE={Verification of linear hybrid systems by means of
   	convex approximations},
   	BOOKTITLE={International Static Analysis Symposium, SAS'94},
   	ADDRESS={Namur (Belgium)},
   	MONTH={September},
   	YEAR= 1994
	}

Postscript file