{"date_published":"1998-01-01T00:00:00Z","abstract":[{"text":"We study the reachability problem for hybrid automata. Automatic approaches, which attempt to construct the reachable region by symbolic execution, often do not terminate. In these cases, we require the user to guess the reachable region, and we use a theorem prover (Pvs) to verify the guess. We classify hybrid automata according to the theory in which their reachable region can be defined finitely. This is the theory in which the prover needs to operate in order to verify the guess. The approach is interesting, because an appropriate guess can often be deduced by extrapolating from the first few steps of symbolic execution.","lang":"eng"}],"publist_id":"299","type":"conference","alternative_title":["LNCS"],"quality_controlled":0,"page":"190 - 204","title":"Reachability verification for hybrid automata","status":"public","conference":{"name":"HSCC: Hybrid Systems - Computation and Control"},"day":"01","month":"01","_id":"4429","volume":1386,"year":"1998","intvolume":"      1386","publisher":"Springer","extern":1,"date_created":"2018-12-11T12:08:48Z","acknowledgement":"This research was supported in part by the ONR YIP award N00014-95-1-0520, by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the AFOSR contract F49620-93-1-0056, by the ARO MURI grant DAAH-04-96-1-0341, by the ARPA grant NAG2-892, and by the SRC contract 95-DC-324.036.\nSupported by Lavoisier grant of the French Foreign Affairs Ministry and by SRI.","publication_status":"published","date_updated":"2021-01-12T07:56:54Z","author":[{"first_name":"Thomas A","full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"first_name":"Vlad","last_name":"Rusu","full_name":"Rusu,Vlad"}],"citation":{"ieee":"T. A. Henzinger and V. Rusu, “Reachability verification for hybrid automata,” presented at the HSCC: Hybrid Systems - Computation and Control, 1998, vol. 1386, pp. 190–204.","ista":"Henzinger TA, Rusu V. 1998. Reachability verification for hybrid automata. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 1386, 190–204.","mla":"Henzinger, Thomas A., and Vlad Rusu. <i>Reachability Verification for Hybrid Automata</i>. Vol. 1386, Springer, 1998, pp. 190–204, doi:<a href=\"https://doi.org/10.1007/3-540-64358-3_40\">10.1007/3-540-64358-3_40</a>.","ama":"Henzinger TA, Rusu V. Reachability verification for hybrid automata. In: Vol 1386. Springer; 1998:190-204. doi:<a href=\"https://doi.org/10.1007/3-540-64358-3_40\">10.1007/3-540-64358-3_40</a>","apa":"Henzinger, T. A., &#38; Rusu, V. (1998). Reachability verification for hybrid automata (Vol. 1386, pp. 190–204). Presented at the HSCC: Hybrid Systems - Computation and Control, Springer. <a href=\"https://doi.org/10.1007/3-540-64358-3_40\">https://doi.org/10.1007/3-540-64358-3_40</a>","short":"T.A. Henzinger, V. Rusu, in:, Springer, 1998, pp. 190–204.","chicago":"Henzinger, Thomas A, and Vlad Rusu. “Reachability Verification for Hybrid Automata,” 1386:190–204. Springer, 1998. <a href=\"https://doi.org/10.1007/3-540-64358-3_40\">https://doi.org/10.1007/3-540-64358-3_40</a>."},"doi":"10.1007/3-540-64358-3_40"}