[{"month":"01","oa_version":"None","publication":"22nd International Colloquium on Automata, Languages and Programming ","conference":{"start_date":"1995-07-10","name":"ICALP: Automata, Languages and Programming","end_date":"1995-07-14","location":"Szeged, Hungary"},"language":[{"iso":"eng"}],"publist_id":"229","publication_identifier":{"isbn":["9783540600848"]},"type":"conference","date_published":"1995-01-01T00:00:00Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-60084-1_93"}],"intvolume":"       944","title":"The expressive power of clocks","alternative_title":["LNCS"],"date_created":"2018-12-11T12:09:10Z","article_processing_charge":"No","publication_status":"published","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Kopke, Peter","last_name":"Kopke","first_name":"Peter"},{"full_name":"Wong Toi, Howard","first_name":"Howard","last_name":"Wong Toi"}],"_id":"4500","publisher":"Springer","quality_controlled":"1","page":"417 - 428","abstract":[{"lang":"eng","text":"We investigate the expressive power of timing restrictions on labeled transition systems. In particular, we show how constraints on clock variables together with a uniform liveness condition—the divergence of time—can express Büchi, Muller, Streett, Rabin, and weak and strong fairness conditions on a given labeled transition system. We then consider the effect, on both timed and time-abstract expressiveness, of varying the following parameters: time domain (discrete or dense), number of clocks, number of states, and size of constants used in timing restrictions."}],"day":"01","doi":"10.1007/3-540-60084-1_93","year":"1995","citation":{"mla":"Henzinger, Thomas A., et al. “The Expressive Power of Clocks.” <i>22nd International Colloquium on Automata, Languages and Programming </i>, vol. 944, Springer, 1995, pp. 417–28, doi:<a href=\"https://doi.org/10.1007/3-540-60084-1_93\">10.1007/3-540-60084-1_93</a>.","short":"T.A. Henzinger, P. Kopke, H. Wong Toi, in:, 22nd International Colloquium on Automata, Languages and Programming , Springer, 1995, pp. 417–428.","ista":"Henzinger TA, Kopke P, Wong Toi H. 1995. The expressive power of clocks. 22nd International Colloquium on Automata, Languages and Programming . ICALP: Automata, Languages and Programming, LNCS, vol. 944, 417–428.","ama":"Henzinger TA, Kopke P, Wong Toi H. The expressive power of clocks. In: <i>22nd International Colloquium on Automata, Languages and Programming </i>. Vol 944. Springer; 1995:417-428. doi:<a href=\"https://doi.org/10.1007/3-540-60084-1_93\">10.1007/3-540-60084-1_93</a>","apa":"Henzinger, T. A., Kopke, P., &#38; Wong Toi, H. (1995). The expressive power of clocks. In <i>22nd International Colloquium on Automata, Languages and Programming </i> (Vol. 944, pp. 417–428). Szeged, Hungary: Springer. <a href=\"https://doi.org/10.1007/3-540-60084-1_93\">https://doi.org/10.1007/3-540-60084-1_93</a>","ieee":"T. A. Henzinger, P. Kopke, and H. Wong Toi, “The expressive power of clocks,” in <i>22nd International Colloquium on Automata, Languages and Programming </i>, Szeged, Hungary, 1995, vol. 944, pp. 417–428.","chicago":"Henzinger, Thomas A, Peter Kopke, and Howard Wong Toi. “The Expressive Power of Clocks.” In <i>22nd International Colloquium on Automata, Languages and Programming </i>, 944:417–28. Springer, 1995. <a href=\"https://doi.org/10.1007/3-540-60084-1_93\">https://doi.org/10.1007/3-540-60084-1_93</a>."},"date_updated":"2022-06-09T14:58:31Z","extern":"1","volume":944,"acknowledgement":"This research was supported in part by the National Science Foundation under grant CCR-9200794, by the United States Air Force Office of Scientific Research under contract F49620-93-1-0056, by the Defense Advanced Research Projects Agency under grant NAG2-892, and by the U.S. Army Research Office through the Mathematical Sciences Institute of Cornell University, Contract Number DAAL03-91-C-0027.\r\nThe full version of this paper is available from the Department of Computer Science, Cornell University, Ithaca, NY 14853, as Technical Report TR95-1496."},{"abstract":[{"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.","lang":"eng"}],"day":"01","doi":"10.1007/3-540-60084-1_85","citation":{"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>","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>","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.","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>.","short":"T.A. Henzinger, in:, 22nd International Colloquium on Automata, Languages and Programming , Springer, 1995, 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."},"year":"1995","date_updated":"2022-06-09T14:21:08Z","extern":"1","volume":944,"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","intvolume":"       944","title":"Hybrid automata with finite bisimulations","alternative_title":["LNCS"],"date_created":"2018-12-11T12:09:16Z","article_processing_charge":"No","publication_status":"published","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"}],"_id":"4518","publisher":"Springer","quality_controlled":"1","page":"324 - 335","publist_id":"212","publication_identifier":{"isbn":["9783540600848"]},"type":"conference","date_published":"1995-01-01T00:00:00Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-60084-1_85"}],"month":"01","oa_version":"None","publication":"22nd International Colloquium on Automata, Languages and Programming ","conference":{"end_date":"1995-07-14","location":"Szeged, Hungary","start_date":"1995-07-10","name":"ICALP: Automata, Languages and Programming"},"language":[{"iso":"eng"}]}]