A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
In this paper, we approximate a hybrid system with arbitrary flow functions by systems with polynomial flows; the verification of certain properties in systems with polynomial flows can be reduced to the first order theory of reals, and is therefore decidable. The polynomial approximations that we constructsimulate (as opposed to "simulate") the original system, and at the same time are tight. We show that for systems that we call tolerant, safety verification of a system can be reduced to thedoi:10.1109/rtss.2009.28 dblp:conf/rtss/PrabhakarVVD09 fatcat:lgnggiaf3nhgpntyzpciepk67q