{"title":"The theory of hybrid automata","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","publication":"Verification of Digital and Hybrid Systems","doi":"10.1007/978-3-642-59615-5","_id":"4513","publication_identifier":{"isbn":["9783642596155"]},"editor":[{"first_name":"M.","full_name":"Inan, M.","last_name":"Inan"},{"first_name":"Robert","full_name":"Kurshan, Robert","last_name":"Kurshan"}],"language":[{"iso":"eng"}],"page":"265 - 292","abstract":[{"lang":"eng","text":"A hybrid automaton is a formal model for a mixed discrete-continuous system. We classify hybrid automata according to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discrete-continuous state spaces that was previously studied on purely discrete state spaces only. In particular, various classes of hybrid automata induce finitary trace equivalence (or similarity, or bisimilarity) relations on an uncountable state space, thus permitting the application of various model-checking techniques that were originally developed for finitestate systems. "}],"date_published":"2000-04-28T00:00:00Z","month":"04","publication_status":"published","volume":170,"day":"28","oa_version":"None","publisher":"Springer","date_updated":"2023-04-18T12:37:17Z","scopus_import":"1","acknowledgement":"This research was supported in part by the Office of Naval Research Young Investigator award N00014-95-1-0520, by the National Science Foundation CAREER award CCR-9501708, by the National Science Foundation grant CR9504469, by the Air Force Office of Scientific Research contract F49620-93-1-0056, by the Army Research Office MURI grant DAAH-04-96-1-0341, by the Advanced Research Projects Agency grant NAG2-892, and by the Semiconductor Research Corporation contract 96-DC-324.036. ","alternative_title":["NATO ASI Series F: Computer and Systems Sciences"],"intvolume":"       170","publist_id":"216","date_created":"2018-12-11T12:09:14Z","extern":"1","citation":{"mla":"Henzinger, Thomas A. “The Theory of Hybrid Automata.” <i>Verification of Digital and Hybrid Systems</i>, edited by M. Inan and Robert Kurshan, vol. 170, Springer, 2000, pp. 265–92, doi:<a href=\"https://doi.org/10.1007/978-3-642-59615-5\">10.1007/978-3-642-59615-5</a>.","ama":"Henzinger TA. The theory of hybrid automata. In: Inan M, Kurshan R, eds. <i>Verification of Digital and Hybrid Systems</i>. Vol 170. Springer; 2000:265-292. doi:<a href=\"https://doi.org/10.1007/978-3-642-59615-5\">10.1007/978-3-642-59615-5</a>","ieee":"T. A. Henzinger, “The theory of hybrid automata,” in <i>Verification of Digital and Hybrid Systems</i>, vol. 170, M. Inan and R. Kurshan, Eds. Springer, 2000, pp. 265–292.","apa":"Henzinger, T. A. (2000). The theory of hybrid automata. In M. Inan &#38; R. Kurshan (Eds.), <i>Verification of Digital and Hybrid Systems</i> (Vol. 170, pp. 265–292). Springer. <a href=\"https://doi.org/10.1007/978-3-642-59615-5\">https://doi.org/10.1007/978-3-642-59615-5</a>","short":"T.A. Henzinger, in:, M. Inan, R. Kurshan (Eds.), Verification of Digital and Hybrid Systems, Springer, 2000, pp. 265–292.","ista":"Henzinger TA. 2000.The theory of hybrid automata. In: Verification of Digital and Hybrid Systems. NATO ASI Series F: Computer and Systems Sciences, vol. 170, 265–292.","chicago":"Henzinger, Thomas A. “The Theory of Hybrid Automata.” In <i>Verification of Digital and Hybrid Systems</i>, edited by M. Inan and Robert Kurshan, 170:265–92. Springer, 2000. <a href=\"https://doi.org/10.1007/978-3-642-59615-5\">https://doi.org/10.1007/978-3-642-59615-5</a>."},"type":"book_chapter","year":"2000","author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"}],"article_processing_charge":"No","status":"public"}