{"quality_controlled":"1","_id":"4519","title":"The theory of hybrid automata","month":"01","page":"278 - 292","date_updated":"2022-07-06T07:56:28Z","publication":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science","date_created":"2018-12-11T12:09:16Z","day":"01","year":"1996","type":"conference","status":"public","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/561342"}],"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"}],"date_published":"1996-01-01T00:00:00Z","publication_identifier":{"issn":["1043-6871"]},"doi":"10.1109/LICS.1996.561342 ","conference":{"end_date":"1996-07-30","name":"LICS: Logic in Computer Science","start_date":"1996-07-27","location":"New Brunswick, NJ, United States of America"},"citation":{"ista":"Henzinger TA. 1996. The theory of hybrid automata. Proceedings 11th Annual IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 278–292.","mla":"Henzinger, Thomas A. “The Theory of Hybrid Automata.” <i>Proceedings 11th Annual IEEE Symposium on Logic in Computer Science</i>, IEEE, 1996, pp. 278–92, doi:<a href=\"https://doi.org/10.1109/LICS.1996.561342 \">10.1109/LICS.1996.561342 </a>.","short":"T.A. Henzinger, in:, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1996, pp. 278–292.","apa":"Henzinger, T. A. (1996). The theory of hybrid automata. In <i>Proceedings 11th Annual IEEE Symposium on Logic in Computer Science</i> (pp. 278–292). New Brunswick, NJ, United States of America: IEEE. <a href=\"https://doi.org/10.1109/LICS.1996.561342 \">https://doi.org/10.1109/LICS.1996.561342 </a>","chicago":"Henzinger, Thomas A. “The Theory of Hybrid Automata.” In <i>Proceedings 11th Annual IEEE Symposium on Logic in Computer Science</i>, 278–92. IEEE, 1996. <a href=\"https://doi.org/10.1109/LICS.1996.561342 \">https://doi.org/10.1109/LICS.1996.561342 </a>.","ieee":"T. A. Henzinger, “The theory of hybrid automata,” in <i>Proceedings 11th Annual IEEE Symposium on Logic in Computer Science</i>, New Brunswick, NJ, United States of America, 1996, pp. 278–292.","ama":"Henzinger TA. The theory of hybrid automata. In: <i>Proceedings 11th Annual IEEE Symposium on Logic in Computer Science</i>. IEEE; 1996:278-292. doi:<a href=\"https://doi.org/10.1109/LICS.1996.561342 \">10.1109/LICS.1996.561342 </a>"},"publication_status":"published","oa_version":"None","extern":"1","article_processing_charge":"No","language":[{"iso":"eng"}],"abstract":[{"text":"We summarize several recent results about hybrid automata. Our goal is to demonstrate that concepts from the theory of discrete concurrent systems can give insights into partly continuous systems, and that methods for the verification of finite-state systems can be used to analyze certain systems with uncountable state spaces","lang":"eng"}],"publist_id":"213","publisher":"IEEE","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"}