[{"date_updated":"2022-06-09T14:21:08Z","extern":"1","creator":{"login":"alisjak","id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"},"_id":"4518","conference":{"name":"ICALP: Automata, Languages and Programming","start_date":"1995-07-10","end_date":"1995-07-14","location":"Szeged, Hungary"},"type":"conference","status":"public","publication_status":"published","publication_identifier":{"isbn":[]},"language":[{}],"volume":944,"abstract":[{"lang":"eng"}],"oa_version":"None","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-60084-1_85"}],"alternative_title":[],"intvolume":" 944","month":"01","dini_type":"doc-type:conferenceObject","citation":{"short":"T.A. Henzinger, in:, 22nd International Colloquium on Automata, Languages and Programming , Springer, 1995, pp. 324–335.","ieee":"T. A. Henzinger, “Hybrid automata with finite bisimulations,” in 22nd International Colloquium on Automata, Languages and Programming , Szeged, Hungary, 1995, vol. 944, pp. 324–335.","apa":"Henzinger, T. A. (1995). Hybrid automata with finite bisimulations. In 22nd International Colloquium on Automata, Languages and Programming (Vol. 944, pp. 324–335). Szeged, Hungary: Springer. https://doi.org/10.1007/3-540-60084-1_85","mla":"Henzinger, Thomas A. “Hybrid Automata with Finite Bisimulations.” 22nd International Colloquium on Automata, Languages and Programming , vol. 944, Springer, 1995, pp. 324–35, doi:10.1007/3-540-60084-1_85.","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.","chicago":"Henzinger, Thomas A. “Hybrid Automata with Finite Bisimulations.” In 22nd International Colloquium on Automata, Languages and Programming , 944:324–35. Springer, 1995. https://doi.org/10.1007/3-540-60084-1_85."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","publist_id":"212","author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"publication":"22nd International Colloquium on Automata, Languages and Programming ","dc":{"description":["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."],"identifier":["https://research-explorer.ista.ac.at/record/4518"],"relation":["info:eu-repo/semantics/altIdentifier/doi/10.1007/3-540-60084-1_85","info:eu-repo/semantics/altIdentifier/isbn/9783540600848"],"source":["Henzinger TA. Hybrid automata with finite bisimulations. In: 22nd International Colloquium on Automata, Languages and Programming . Vol 944. Springer; 1995:324-335. doi:10.1007/3-540-60084-1_85"],"type":["info:eu-repo/semantics/conferenceObject","doc-type:conferenceObject","text","http://purl.org/coar/resource_type/c_5794"],"publisher":["Springer"],"date":["1995"],"language":["eng"],"rights":["info:eu-repo/semantics/closedAccess"],"creator":["Henzinger, Thomas A"],"title":["Hybrid automata with finite bisimulations","LNCS"]},"day":"01","uri_base":"https://research-explorer.ista.ac.at","page":"324 - 335","date_created":"2018-12-11T12:09:16Z","date_published":"1995-01-01T00:00:00Z","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","quality_controlled":"1"}]