{"month":"01","title":"Hybrid automata with finite bisimulations","publication_identifier":{"isbn":["9783540600848"]},"doi":"10.1007/3-540-60084-1_85","_id":"4518","type":"conference","citation":{"apa":"Henzinger, T. A. (1995). Hybrid automata with finite bisimulations. In <i>22nd International Colloquium on Automata, Languages and Programming </i> (Vol. 944, pp. 324–335). Szeged, Hungary: Springer. <a href=\"https://doi.org/10.1007/3-540-60084-1_85\">https://doi.org/10.1007/3-540-60084-1_85</a>","short":"T.A. Henzinger, in:, 22nd International Colloquium on Automata, Languages and Programming , Springer, 1995, pp. 324–335.","chicago":"Henzinger, Thomas A. “Hybrid Automata with Finite Bisimulations.” In <i>22nd International Colloquium on Automata, Languages and Programming </i>, 944:324–35. Springer, 1995. <a href=\"https://doi.org/10.1007/3-540-60084-1_85\">https://doi.org/10.1007/3-540-60084-1_85</a>.","mla":"Henzinger, Thomas A. “Hybrid Automata with Finite Bisimulations.” <i>22nd International Colloquium on Automata, Languages and Programming </i>, vol. 944, Springer, 1995, pp. 324–35, doi:<a href=\"https://doi.org/10.1007/3-540-60084-1_85\">10.1007/3-540-60084-1_85</a>.","ieee":"T. A. Henzinger, “Hybrid automata with finite bisimulations,” in <i>22nd International Colloquium on Automata, Languages and Programming </i>, Szeged, Hungary, 1995, vol. 944, pp. 324–335.","ista":"Henzinger TA. 1995. Hybrid automata with finite bisimulations. 22nd International Colloquium on Automata, Languages and Programming . ICALP: Automata, Languages and Programming, LNCS, vol. 944, 324–335.","ama":"Henzinger TA. Hybrid automata with finite bisimulations. In: <i>22nd International Colloquium on Automata, Languages and Programming </i>. Vol 944. Springer; 1995:324-335. doi:<a href=\"https://doi.org/10.1007/3-540-60084-1_85\">10.1007/3-540-60084-1_85</a>"},"oa_version":"None","publisher":"Springer","publication_status":"published","conference":{"name":"ICALP: Automata, Languages and Programming","location":"Szeged, Hungary","start_date":"1995-07-10","end_date":"1995-07-14"},"author":[{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A"}],"publist_id":"212","language":[{"iso":"eng"}],"page":"324 - 335","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_created":"2018-12-11T12:09:16Z","alternative_title":["LNCS"],"publication":"22nd International Colloquium on Automata, Languages and Programming ","date_published":"1995-01-01T00:00:00Z","article_processing_charge":"No","year":"1995","volume":944,"extern":"1","acknowledgement":"This research was supported in part by the NSF grant CCR-9200794, by the AFOSR contract F49620-93-1-0056, and by the DARPA grant NAG2-892.\r\n","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-60084-1_85"}],"status":"public","abstract":[{"lang":"eng","text":"The analysis, verification, and control of hybrid automata with finite bisimulations can be reduced to finite-state problems. We advocate a time-abstract, phase-based methodology for checking if a given hybrid automaton has a finite bisimulation. First, we factor the automaton into two components, a boolean automaton with a discrete dynamics on the finite state space B m and a euclidean automaton with a continuous dynamics on the infinite state space  n . Second, we investigate the phase portrait of the euclidean component. In this fashion, we obtain new decidability results for hybrid systems as well as new, uniform proofs of known decidability results."}],"date_updated":"2022-06-09T14:21:08Z","intvolume":"       944","quality_controlled":"1","day":"01"}