[{"date_published":"1995-02-01T00:00:00Z","author":[{"last_name":"Sites","first_name":"Jack","full_name":"Sites, Jack"},{"first_name":"Nicholas H","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Reed","first_name":"Kent","full_name":"Reed, Kent"}],"oa":1,"_id":"4297","type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1111/j.1558-5646.1995.tb05955.x","publisher":"Wiley-Blackwell","year":"1995","article_type":"original","volume":49,"month":"02","quality_controlled":"1","publist_id":"1779","publication_identifier":{"issn":["0014-3820"]},"article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","intvolume":"        49","date_created":"2018-12-11T12:08:06Z","pmid":1,"acknowledgement":"For field assistance in collecting and mapping of the zone, we thank E. Arevalo, I. Goyenechea, D. Hutchison, M.  Man- cilia,  F.  Mendoza,  D.  Mink,  and J.  and  H.  Sites.  The  mark- recapture work was carried out by M.  Mancilla, F  Mendoza, and A. Gonzales. J.W.S. also thanks T.  Hinckley and  D.  Ste­vens  of  the  Brigham  Young  University  Department  of Ge­ography  for  lessons  in  surveying  and  map  making  and  use of  the  field  equipment  and  planimeter.  B.  Nürnberger  pro­vided the digitized coordinates  for individual  lizards and as­sisted  with  the  analysis  of spatial  structure  and  viability.  B. Nürnberger, C.  MacCallum, J.  Mallet, and J. Searle also pro­vided  helpful  comments  on  the  manuscript.  This  work  was supported  by  National  Science  Foundation  grants  BSR  85- 09092  and  88-22751  to J.W.S.,  and  grants  from  the  Science and Engineering Research Council (GR/H09929) and Natural Environment Research Council  (GR3/8002) and the  DarwinTrust to N.H.B. The Mexican agency Secretaria de DesarrolloUrbano  y  Ecologia  (now  Secretaria  de  Desarrollo  Social) kindly  provided  scientific collecting permits  (to E.  Arévalo) for field  work  in  1989  and  1991.","oa_version":"Published Version","publication_status":"published","page":"9 - 36","day":"01","abstract":[{"lang":"eng","text":"The F5 (2n = 34) and FM2 (2n = 44-46) chromosome races of the Sceloporus grammicus complex form a parapatric hybrid zone in the Mexican state of Hidalgo, characterized by steep concordant clines among three diagnostic chromosome markers across a straight-line distance of about 2 km. Here, we show that this zone is actually structured into local patches in which hybridization extends over an extremely irregular front. The distribution of hybrid-index (HI) scores across the transect reveals some hybridization at almost all localities mapped in a central 7 km x 3 km area. Pooling the central samples produces both a strong heterozygote deficit for all diagnostic markers and strong linkage disequilibria between all pairwise combinations of these (unlinked) markers. Moreover, a highly significant association exists between the habitat on which each individual was caught and its karyotype (F5 chromosomes are more likely to be found on oak). Analysis of genotype frequencies over a range of spatial scales shows that there is no significant heterozygote deficit or habitat association within local areas of less than about 200 m; however, there is significant linkage disequilibrium over the smallest scales (R = D (pquv)1/2 = 0.29, support limits, 0.18-0.36) over 100 m. These patterns suggest that lizards mate and choose habitats randomly within local patches. This conclusion is supported by mark-recapture estimates of dispersal (≈ 80 m in a generation) and by inference of matings from embryo and maternal karyotypes. Closer examination of the two-dimensional pattern reveals a convoluted cline for all three markers, with a width of 830 m (support limits 770 m-930 m). This cline width, combined with the strength of local linkage disequilibrium, implies a dispersal rate of σ = 160 m in a generation and an effective selection pressure of 30% on each chromosome marker. The proportion of inviable embryos is greater in females from the center of the hybrid zone; this is caused by effects associated with both karyotype and location. The hybrid zone is likely to be maintained by selection against chromosomal heterozygotes, by other kinds of selection against hybrids, and by selection adapting the chromosome races to different habitats. The structure of the contact may be caused by both random drift and by selection in relation to habitat."}],"status":"public","date_updated":"2022-06-13T09:24:40Z","publication":"Evolution","external_id":{"pmid":["28593667"]},"title":"The genetic structure of a mosaic hybrid zone between two chromosome races of the Sceloporus grammicus complex (Sauria, Phrynosomatidae) in central Mexico","main_file_link":[{"open_access":"1","url":"https://onlinelibrary.wiley.com/doi/abs/10.1111/j.1558-5646.1995.tb05955.x"}],"issue":"1","scopus_import":"1","citation":{"ista":"Sites J, Barton NH, Reed K. 1995. The genetic structure of a mosaic hybrid zone between two chromosome races of the Sceloporus grammicus complex (Sauria, Phrynosomatidae) in central Mexico. Evolution. 49(1), 9–36.","apa":"Sites, J., Barton, N. H., &#38; Reed, K. (1995). The genetic structure of a mosaic hybrid zone between two chromosome races of the Sceloporus grammicus complex (Sauria, Phrynosomatidae) in central Mexico. <i>Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1558-5646.1995.tb05955.x\">https://doi.org/10.1111/j.1558-5646.1995.tb05955.x</a>","mla":"Sites, Jack, et al. “The Genetic Structure of a Mosaic Hybrid Zone between Two Chromosome Races of the Sceloporus Grammicus Complex (Sauria, Phrynosomatidae) in Central Mexico.” <i>Evolution</i>, vol. 49, no. 1, Wiley-Blackwell, 1995, pp. 9–36, doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1995.tb05955.x\">10.1111/j.1558-5646.1995.tb05955.x</a>.","short":"J. Sites, N.H. Barton, K. Reed, Evolution 49 (1995) 9–36.","ama":"Sites J, Barton NH, Reed K. The genetic structure of a mosaic hybrid zone between two chromosome races of the Sceloporus grammicus complex (Sauria, Phrynosomatidae) in central Mexico. <i>Evolution</i>. 1995;49(1):9-36. doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1995.tb05955.x\">10.1111/j.1558-5646.1995.tb05955.x</a>","chicago":"Sites, Jack, Nicholas H Barton, and Kent Reed. “The Genetic Structure of a Mosaic Hybrid Zone between Two Chromosome Races of the Sceloporus Grammicus Complex (Sauria, Phrynosomatidae) in Central Mexico.” <i>Evolution</i>. Wiley-Blackwell, 1995. <a href=\"https://doi.org/10.1111/j.1558-5646.1995.tb05955.x\">https://doi.org/10.1111/j.1558-5646.1995.tb05955.x</a>.","ieee":"J. Sites, N. H. Barton, and K. Reed, “The genetic structure of a mosaic hybrid zone between two chromosome races of the Sceloporus grammicus complex (Sauria, Phrynosomatidae) in central Mexico,” <i>Evolution</i>, vol. 49, no. 1. Wiley-Blackwell, pp. 9–36, 1995."}},{"main_file_link":[{"url":"https://doi.org/10.1111/j.1558-5646.1995.tb04431.x","open_access":"1"}],"publication":"Evolution","title":"Appendix to \"A simulation study of multilocus clines\" by S J E Baird","citation":{"ieee":"N. H. Barton, “Appendix to ‘A simulation study of multilocus clines’ by S J E Baird,” <i>Evolution</i>, vol. 49, no. 6. Wiley, pp. 1038–1045, 1995.","chicago":"Barton, Nicholas H. “Appendix to ‘A Simulation Study of Multilocus Clines’ by S J E Baird.” <i>Evolution</i>. Wiley, 1995. <a href=\"https://doi.org/10.1111/j.1558-5646.1995.tb04431.x\">https://doi.org/10.1111/j.1558-5646.1995.tb04431.x</a>.","ama":"Barton NH. Appendix to “A simulation study of multilocus clines” by S J E Baird. <i>Evolution</i>. 1995;49(6):1038-1045. doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1995.tb04431.x\">10.1111/j.1558-5646.1995.tb04431.x</a>","mla":"Barton, Nicholas H. “Appendix to ‘A Simulation Study of Multilocus Clines’ by S J E Baird.” <i>Evolution</i>, vol. 49, no. 6, Wiley, 1995, pp. 1038–45, doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1995.tb04431.x\">10.1111/j.1558-5646.1995.tb04431.x</a>.","short":"N.H. Barton, Evolution 49 (1995) 1038–1045.","ista":"Barton NH. 1995. Appendix to ‘A simulation study of multilocus clines’ by S J E Baird. Evolution. 49(6), 1038–1045.","apa":"Barton, N. H. (1995). Appendix to “A simulation study of multilocus clines” by S J E Baird. <i>Evolution</i>. Wiley. <a href=\"https://doi.org/10.1111/j.1558-5646.1995.tb04431.x\">https://doi.org/10.1111/j.1558-5646.1995.tb04431.x</a>"},"issue":"6","oa_version":"Published Version","publication_status":"published","page":"1038 - 1045","day":"01","date_updated":"2022-06-28T07:47:30Z","status":"public","month":"12","quality_controlled":"1","publication_identifier":{"issn":["1558-5646"]},"publist_id":"1773","volume":49,"article_type":"original","date_created":"2018-12-11T12:08:07Z","extern":"1","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","intvolume":"        49","author":[{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","full_name":"Barton, Nicholas H","first_name":"Nicholas H"}],"oa":1,"_id":"4298","date_published":"1995-12-01T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.1111/j.1558-5646.1995.tb04431.x","publisher":"Wiley","year":"1995","type":"journal_article"},{"date_updated":"2022-06-28T07:30:34Z","publisher":"Cornell University","year":"1995","language":[{"iso":"eng"}],"type":"dissertation","status":"public","oa":1,"_id":"4428","degree_awarded":"PhD","author":[{"last_name":"Ho","first_name":"Pei","full_name":"Ho, Pei"}],"abstract":[{"lang":"eng","text":"Hybrid systems are real-time systems that react to both discrete and continuous activities (such as analog signals, time, temperature, and speed). Typical examples of hybrid systems are embedded systems, timing-based communication protocols, and digital circuits at the transistor level. Due to the rapid development of microprocessor technology, hybrid systems directly control much of what we depend on in our daily lives. Consequently, the formal specification and verification of hybrid systems has become an active area of research. This dissertation presents the first general framework for the formal specification and verification of hybrid systems, as well as the first hybrid-system analysis tool--HyTech. The framework consists of a graphical finite-state-machine-like language for modeling hybrid systems, a temporal logic for modeling the requirements of hybrid systems, and a computer procedure that verifies modeled hybrid systems against modeled requirements. The tool HyTech is the implementation of the framework using C++ and Mathematica.\r\n\r\nMore specifically, our hybrid-system modeling language, Hybrid Automata, is an extension of timed automata with discrete and continuous variables whose dynamics are governed by differential equations. Our requirement modeling language, ICTL, is a branching-time temporal logic, and is an extension of TCTL with stop-watch variables. Our verification procedure is a symbolic model-checking procedure that verifies linear hybrid automata against ICTL formulas. To make HyTech more efficient and effective, we use model-checking strategies and abstract operators that can expedite the verification process. To enable HyTech to verify nonlinear hybrid automata, we introduce two translations from nonlinear hybrid automata to linear hybrid automata. We have applied HyTech to analyze more than 30 hybrid-system benchmarks. In this dissertation, we present the application of HyTech to three nontrivial hybrid systems taken from the literature."}],"page":"1 - 188","date_published":"1995-08-01T00:00:00Z","publication_status":"published","oa_version":"Published Version","day":"01","citation":{"ieee":"P. Ho, “Automatic analysis of hybrid systems,” Cornell University, 1995.","chicago":"Ho, Pei. “Automatic Analysis of Hybrid Systems.” Cornell University, 1995.","ama":"Ho P. Automatic analysis of hybrid systems. 1995:1-188.","mla":"Ho, Pei. <i>Automatic Analysis of Hybrid Systems</i>. Cornell University, 1995, pp. 1–188.","apa":"Ho, P. (1995). <i>Automatic analysis of hybrid systems</i>. Cornell University.","ista":"Ho P. 1995. Automatic analysis of hybrid systems. Cornell University.","short":"P. Ho, Automatic Analysis of Hybrid Systems, Cornell University, 1995."},"date_created":"2018-12-11T12:08:48Z","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","publist_id":"304","main_file_link":[{"url":"https://hdl.handle.net/1813/7193","open_access":"1"}],"month":"08","title":"Automatic analysis of hybrid systems","supervisor":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}]},{"citation":{"mla":"Henzinger, Thomas A., and Pei Ho. “HyTech: The Cornell Hybrid Technology Tool.” <i>4th International Hybrid Systems Workshop</i>, edited by Antsaklis Panos et al., vol. 999, Springer, 1995, pp. 265–93, doi:<a href=\"https://doi.org/10.1007/3-540-60472-3_14\">10.1007/3-540-60472-3_14</a>.","short":"T.A. Henzinger, P. Ho, in:, A. Panos, W. Kohn, A. Nerode, S. Sastry (Eds.), 4th International Hybrid Systems Workshop, Springer, 1995, pp. 265–293.","apa":"Henzinger, T. A., &#38; Ho, P. (1995). HyTech: The Cornell Hybrid Technology Tool. In A. Panos, W. Kohn, A. Nerode, &#38; S. Sastry (Eds.), <i>4th International Hybrid Systems Workshop</i> (Vol. 999, pp. 265–293).  New Brunswick, NJ, United States of America: Springer. <a href=\"https://doi.org/10.1007/3-540-60472-3_14\">https://doi.org/10.1007/3-540-60472-3_14</a>","ista":"Henzinger TA, Ho P. 1995. HyTech: The Cornell Hybrid Technology Tool. 4th International Hybrid Systems Workshop. Hybrid Systems IIILNCS, LNCS, vol. 999, 265–293.","ama":"Henzinger TA, Ho P. HyTech: The Cornell Hybrid Technology Tool. In: Panos A, Kohn W, Nerode A, Sastry S, eds. <i>4th International Hybrid Systems Workshop</i>. Vol 999. LNCS. Springer; 1995:265-293. doi:<a href=\"https://doi.org/10.1007/3-540-60472-3_14\">10.1007/3-540-60472-3_14</a>","chicago":"Henzinger, Thomas A, and Pei Ho. “HyTech: The Cornell Hybrid Technology Tool.” In <i>4th International Hybrid Systems Workshop</i>, edited by Antsaklis Panos, Wolf Kohn, Anil Nerode, and Shankar Sastry, 999:265–93. LNCS. Springer, 1995. <a href=\"https://doi.org/10.1007/3-540-60472-3_14\">https://doi.org/10.1007/3-540-60472-3_14</a>.","ieee":"T. A. Henzinger and P. Ho, “HyTech: The Cornell Hybrid Technology Tool,” in <i>4th International Hybrid Systems Workshop</i>,  New Brunswick, NJ, United States of America, 1995, vol. 999, pp. 265–293."},"editor":[{"last_name":"Panos","first_name":"Antsaklis","full_name":"Panos, Antsaklis"},{"last_name":"Kohn","first_name":"Wolf","full_name":"Kohn, Wolf"},{"last_name":"Nerode","full_name":"Nerode, Anil","first_name":"Anil"},{"first_name":"Shankar","full_name":"Sastry, Shankar","last_name":"Sastry"}],"alternative_title":["LNCS"],"main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-60472-3_14"}],"series_title":"LNCS","publication":"4th International Hybrid Systems Workshop","title":"HyTech: The Cornell Hybrid Technology Tool","date_updated":"2022-06-10T11:24:15Z","status":"public","day":"01","publication_status":"published","oa_version":"None","page":"265 - 293","abstract":[{"text":"This paper is addressed to potential users of HyTech, the Cornell Hybrid Technology Tool, an automatic tool for analyzing hybrid systems. We review the formal technologies that have been incorporated into HyTech, and we illustrate the use of HyTech with three nontrivial case studies.","lang":"eng"}],"date_created":"2018-12-11T12:08:54Z","acknowledgement":"This research was supported in part by the National Science Foundation under grant CCR-9200794, by the Air Force Office of Scientific Research under contract F49620-93-1-0056, by the Office of Naval Research under YIP grant N00014-95-1-0520, and by the Defense Advanced Research Projects Agency under grant NAG2-892.","conference":{"location":" New Brunswick, NJ, United States of America","name":"Hybrid Systems III","start_date":"1995-10-22","end_date":"1955-10-25"},"article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","intvolume":"       999","month":"01","publist_id":"281","publication_identifier":{"isbn":["9783540683346"]},"quality_controlled":"1","volume":999,"doi":"10.1007/3-540-60472-3_14","language":[{"iso":"eng"}],"year":"1995","publisher":"Springer","type":"conference","author":[{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Ho","full_name":"Ho, Pei","first_name":"Pei"}],"_id":"4447","date_published":"1995-01-01T00:00:00Z"},{"date_created":"2018-12-11T12:08:54Z","acknowledgement":" National Science Foundation under grant CCR-9200794, by the Air Force Office of Scientific Research under contract F49620-93-1-0056, by the Office of Naval Research under YIP grant N00014-95-1-0520, and by the Defense Advanced Research Projects Agency under grant NAG2-892.","conference":{"location":"Ithaca, NY, United States of America","start_date":"1994-10-28","end_date":"1994-10-30","name":"Hybrid Systems II"},"extern":"1","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","intvolume":"       999","month":"01","publist_id":"282","publication_identifier":{"isbn":["9783540604723"]},"quality_controlled":"1","volume":999,"doi":"10.1007/3-540-60472-3_13","language":[{"iso":"eng"}],"year":"1995","publisher":"Springer","type":"conference","author":[{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"first_name":"Pei","full_name":"Ho, Pei","last_name":"Ho"}],"_id":"4448","date_published":"1995-01-01T00:00:00Z","citation":{"ama":"Henzinger TA, Ho P. A note on abstract-interpretation strategies for hybrid automata. In: Panos A, Kohn W, Nerode A, Sastry S, eds. <i>3rd International Hybrid Systems Workshop</i>. Vol 999. Springer; 1995:252-264. doi:<a href=\"https://doi.org/10.1007/3-540-60472-3_13\">10.1007/3-540-60472-3_13</a>","short":"T.A. Henzinger, P. Ho, in:, A. Panos, W. Kohn, A. Nerode, S. Sastry (Eds.), 3rd International Hybrid Systems Workshop, Springer, 1995, pp. 252–264.","ista":"Henzinger TA, Ho P. 1995. A note on abstract-interpretation strategies for hybrid automata. 3rd International Hybrid Systems Workshop. Hybrid Systems II, LNCS, vol. 999, 252–264.","mla":"Henzinger, Thomas A., and Pei Ho. “A Note on Abstract-Interpretation Strategies for Hybrid Automata.” <i>3rd International Hybrid Systems Workshop</i>, edited by Antsaklis Panos et al., vol. 999, Springer, 1995, pp. 252–64, doi:<a href=\"https://doi.org/10.1007/3-540-60472-3_13\">10.1007/3-540-60472-3_13</a>.","apa":"Henzinger, T. A., &#38; Ho, P. (1995). A note on abstract-interpretation strategies for hybrid automata. In A. Panos, W. Kohn, A. Nerode, &#38; S. Sastry (Eds.), <i>3rd International Hybrid Systems Workshop</i> (Vol. 999, pp. 252–264). Ithaca, NY, United States of America: Springer. <a href=\"https://doi.org/10.1007/3-540-60472-3_13\">https://doi.org/10.1007/3-540-60472-3_13</a>","ieee":"T. A. Henzinger and P. Ho, “A note on abstract-interpretation strategies for hybrid automata,” in <i>3rd International Hybrid Systems Workshop</i>, Ithaca, NY, United States of America, 1995, vol. 999, pp. 252–264.","chicago":"Henzinger, Thomas A, and Pei Ho. “A Note on Abstract-Interpretation Strategies for Hybrid Automata.” In <i>3rd International Hybrid Systems Workshop</i>, edited by Antsaklis Panos, Wolf Kohn, Anil Nerode, and Shankar Sastry, 999:252–64. Springer, 1995. <a href=\"https://doi.org/10.1007/3-540-60472-3_13\">https://doi.org/10.1007/3-540-60472-3_13</a>."},"editor":[{"first_name":"Antsaklis","full_name":"Panos, Antsaklis","last_name":"Panos"},{"first_name":"Wolf","full_name":"Kohn, Wolf","last_name":"Kohn"},{"last_name":"Nerode","full_name":"Nerode, Anil","first_name":"Anil"},{"last_name":"Sastry","full_name":"Sastry, Shankar","first_name":"Shankar"}],"alternative_title":["LNCS"],"main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-60472-3_13"}],"publication":"3rd International Hybrid Systems Workshop","title":"A note on abstract-interpretation strategies for hybrid automata","date_updated":"2022-06-10T11:48:59Z","status":"public","day":"01","publication_status":"published","oa_version":"None","page":"252 - 264","abstract":[{"lang":"eng","text":"We report on several abstract interpretation strategies that are designed to improve the performance of HyTech, a symbolic model checker for linear hybrid systems. We (1) simultaneously compute the target region from different directions, (2) conservatively approximate the target region by dropping constraints, and (3) iteratively refine the approximation until sufficient precision is obtained. We consider the standard abstract convex-hull operator and a novel abstract extrapolation operator."}]},{"oa_version":"None","publication_status":"published","page":"225 - 238","day":"01","abstract":[{"text":"Hybrid systems model discrete programs that are embedded in continuous environments. Model-checking tools are available for the analysis of linear hybrid systems, whose continuous variables are bounded by piecewise-linear trajectories. Most embedded programs, however, operate in nonlinear environments. We present, analyze, and apply two algorithms for translating nonlinear hybrid systems into linear hybrid systems.\r\nThe clock translation replaces nonlinear variables by clock variables; the rate translation approximates nonlinear variables by piecewise-linear envelopes. Both translations are sound for reachability; that is, if we establish a safety property of the translated linear system, we may conclude that the original nonlinear system satisfies the property. The clock translation is also complete for reachability; that is, the original system and the translated system satisfy the same safety properties. The two translations apply to incomparable classes of nonlinear hybrid systems. From the clock translation we obtain a new decidability result for hybrid systems.\r\nWith the help of Hytech, a symbolic model checker for linear hybrid systems, we automatically verify a nonlinear railroad gate control program using the clock translation, and a nonlinear temperature control program using the rate translation.","lang":"eng"}],"date_updated":"2022-06-10T09:48:52Z","status":"public","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-60045-0_53"}],"publication":"7th International Conference on Computer Aided Verification","title":"Algorithmic analysis of nonlinear hybrid systems","citation":{"chicago":"Henzinger, Thomas A, and Pei Ho. “Algorithmic Analysis of Nonlinear Hybrid Systems.” In <i>7th International Conference on Computer Aided Verification</i>, 939:225–38. Springer, 1995. <a href=\"https://doi.org/10.1007/3-540-60045-0_53\">https://doi.org/10.1007/3-540-60045-0_53</a>.","ieee":"T. A. Henzinger and P. Ho, “Algorithmic analysis of nonlinear hybrid systems,” in <i>7th International Conference on Computer Aided Verification</i>, Liege, Belgium, 1995, vol. 939, pp. 225–238.","ista":"Henzinger TA, Ho P. 1995. Algorithmic analysis of nonlinear hybrid systems. 7th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 939, 225–238.","short":"T.A. Henzinger, P. Ho, in:, 7th International Conference on Computer Aided Verification, Springer, 1995, pp. 225–238.","mla":"Henzinger, Thomas A., and Pei Ho. “Algorithmic Analysis of Nonlinear Hybrid Systems.” <i>7th International Conference on Computer Aided Verification</i>, vol. 939, Springer, 1995, pp. 225–38, doi:<a href=\"https://doi.org/10.1007/3-540-60045-0_53\">10.1007/3-540-60045-0_53</a>.","apa":"Henzinger, T. A., &#38; Ho, P. (1995). Algorithmic analysis of nonlinear hybrid systems. In <i>7th International Conference on Computer Aided Verification</i> (Vol. 939, pp. 225–238). Liege, Belgium: Springer. <a href=\"https://doi.org/10.1007/3-540-60045-0_53\">https://doi.org/10.1007/3-540-60045-0_53</a>","ama":"Henzinger TA, Ho P. Algorithmic analysis of nonlinear hybrid systems. In: <i>7th International Conference on Computer Aided Verification</i>. Vol 939. Springer; 1995:225-238. doi:<a href=\"https://doi.org/10.1007/3-540-60045-0_53\">10.1007/3-540-60045-0_53</a>"},"scopus_import":"1","alternative_title":["LNCS"],"author":[{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"last_name":"Ho","first_name":"Pei","full_name":"Ho, Pei"}],"_id":"4450","date_published":"1995-01-01T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.1007/3-540-60045-0_53","publisher":"Springer","year":"1995","type":"conference","month":"01","quality_controlled":"1","publist_id":"280","publication_identifier":{"isbn":["9783540494133"]},"volume":939,"date_created":"2018-12-11T12:08:55Z","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.","article_processing_charge":"No","extern":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","conference":{"start_date":"1995-07-03","end_date":"1995-07-05","name":"CAV: Computer Aided Verification","location":"Liege, Belgium"},"intvolume":"       939"},{"acknowledgement":"This research was supported in part by the ONR YIP award N00014-95-1-0520, by the NSF CAREER award CCR-9501708, by the NSF grants CCR-9200794 and CCR-9504469, by the AFOSR contract F49620-93-1-0056, and by the ARPA grant NAG2-892.","date_created":"2018-12-11T12:09:09Z","intvolume":"      1019","extern":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","conference":{"location":"Aarhus, Denmark","start_date":"1995-05-19","end_date":"1995-05-20","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"quality_controlled":"1","publication_identifier":{"isbn":["9783540606307"]},"publist_id":"230","month":"01","volume":1019,"publisher":"Springer","year":"1995","language":[{"iso":"eng"}],"doi":"10.1007/3-540-60630-0_3","type":"conference","_id":"4497","author":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"last_name":"Ho","first_name":"Pei","full_name":"Ho, Pei"},{"last_name":"Wong Toi","first_name":"Howard","full_name":"Wong Toi, Howard"}],"date_published":"1995-01-01T00:00:00Z","citation":{"chicago":"Henzinger, Thomas A, Pei Ho, and Howard Wong Toi. “A User Guide to HyTech.” In <i>1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems</i>, 1019:41–71. Springer, 1995. <a href=\"https://doi.org/10.1007/3-540-60630-0_3\">https://doi.org/10.1007/3-540-60630-0_3</a>.","ieee":"T. A. Henzinger, P. Ho, and H. Wong Toi, “A user guide to HyTech,” in <i>1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems</i>, Aarhus, Denmark, 1995, vol. 1019, pp. 41–71.","mla":"Henzinger, Thomas A., et al. “A User Guide to HyTech.” <i>1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 1019, Springer, 1995, pp. 41–71, doi:<a href=\"https://doi.org/10.1007/3-540-60630-0_3\">10.1007/3-540-60630-0_3</a>.","ista":"Henzinger TA, Ho P, Wong Toi H. 1995. A user guide to HyTech. 1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 1019, 41–71.","apa":"Henzinger, T. A., Ho, P., &#38; Wong Toi, H. (1995). A user guide to HyTech. In <i>1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 1019, pp. 41–71). Aarhus, Denmark: Springer. <a href=\"https://doi.org/10.1007/3-540-60630-0_3\">https://doi.org/10.1007/3-540-60630-0_3</a>","short":"T.A. Henzinger, P. Ho, H. Wong Toi, in:, 1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems, Springer, 1995, pp. 41–71.","ama":"Henzinger TA, Ho P, Wong Toi H. A user guide to HyTech. In: <i>1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 1019. Springer; 1995:41-71. doi:<a href=\"https://doi.org/10.1007/3-540-60630-0_3\">10.1007/3-540-60630-0_3</a>"},"alternative_title":["LNCS"],"scopus_import":"1","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-60630-0_3"}],"title":"A user guide to HyTech","publication":"1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems","date_updated":"2022-06-10T09:00:05Z","status":"public","abstract":[{"text":"HyTech is a tool for the automated analysis of embedded systems. This document, designed for the first-time user of HyTech, guides the reader through the underlying system model, and through the input language for describing and analyzing systems. The guide gives several examples of usage, and some hints for gaining maximal computational efficiency from the tool.\r\nThe version of HyTech described in this guide was released in August 1995, and is available through anonymous ftp from ftp.cs.cornell.edu in the directory pub/tah/HyTech, and through the World-Wide Web via HyTech's home page http:/www.cs.cornell.edu/Info/People/tah/hytech.html.","lang":"eng"}],"oa_version":"None","publication_status":"published","page":"41 - 71","day":"01"},{"publist_id":"231","publication_identifier":{"issn":["0272-5428"],"isbn":["0818671831"]},"quality_controlled":"1","month":"11","title":"Computing simulations on finite and infinite graphs","publication":"Proceedings of IEEE 36th Annual Foundations of Computer Science","citation":{"ista":"Henzinger MH, Henzinger TA, Kopke P. 1995. Computing simulations on finite and infinite graphs. Proceedings of IEEE 36th Annual Foundations of Computer Science. FOCS: Foundations of Computer Science, 453–462.","apa":"Henzinger, M. H., Henzinger, T. A., &#38; Kopke, P. (1995). Computing simulations on finite and infinite graphs. In <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i> (pp. 453–462). Milwaukee, WI, United States of America: IEEE. <a href=\"https://doi.org/10.1109/SFCS.1995.492576\">https://doi.org/10.1109/SFCS.1995.492576</a>","mla":"Henzinger, Monika H., et al. “Computing Simulations on Finite and Infinite Graphs.” <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i>, IEEE, 1995, pp. 453–62, doi:<a href=\"https://doi.org/10.1109/SFCS.1995.492576\">10.1109/SFCS.1995.492576</a>.","short":"M.H. Henzinger, T.A. Henzinger, P. Kopke, in:, Proceedings of IEEE 36th Annual Foundations of Computer Science, IEEE, 1995, pp. 453–462.","ama":"Henzinger MH, Henzinger TA, Kopke P. Computing simulations on finite and infinite graphs. In: <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i>. IEEE; 1995:453-462. doi:<a href=\"https://doi.org/10.1109/SFCS.1995.492576\">10.1109/SFCS.1995.492576</a>","chicago":"Henzinger, Monika H, Thomas A Henzinger, and Peter Kopke. “Computing Simulations on Finite and Infinite Graphs.” In <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i>, 453–62. IEEE, 1995. <a href=\"https://doi.org/10.1109/SFCS.1995.492576\">https://doi.org/10.1109/SFCS.1995.492576</a>.","ieee":"M. H. Henzinger, T. A. Henzinger, and P. Kopke, “Computing simulations on finite and infinite graphs,” in <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i>, Milwaukee, WI, United States of America, 1995, pp. 453–462."},"date_created":"2018-12-11T12:09:10Z","scopus_import":"1","conference":{"name":"FOCS: Foundations of Computer Science","start_date":"1995-10-23","end_date":"1995-10-25","location":"Milwaukee, WI, United States of America"},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","_id":"4498","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"first_name":"Peter","full_name":"Kopke, Peter","last_name":"Kopke"}],"abstract":[{"lang":"eng","text":"We present algorithms for computing similarity relations of labeled graphs. Similarity relations have applications for the refinement and verification of reactive systems. For finite graphs, we present an O(mn) algorithm for computing the similarity relation of a graph with n vertices and m edges (assuming m⩾n). For effectively presented infinite graphs, we present a symbolic similarity-checking procedure that terminates if a finite similarity relation exists. We show that 2D rectangular automata, which model discrete reactive systems with continuous environments, define effectively presented infinite graphs with finite similarity relations. It follows that the refinement problem and the ∀CTL* model-checking problem are decidable for 2D rectangular automata"}],"day":"01","publication_status":"published","oa_version":"None","date_published":"1995-11-01T00:00:00Z","page":"453 - 462","year":"1995","date_updated":"2023-02-09T08:43:48Z","publisher":"IEEE","doi":"10.1109/SFCS.1995.492576","language":[{"iso":"eng"}],"type":"conference","status":"public"},{"title":"HyTech: The next generation","publication":"Proceedings 16th IEEE Real-Time Systems Symposium","quality_controlled":"1","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/495196"}],"publist_id":"232","publication_identifier":{"isbn":["0818673370"]},"month":"01","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","extern":"1","scopus_import":"1","conference":{"location":"Pisa, Italy","start_date":"1995-12-05","end_date":"1995-12-07","name":"RTSS: Real-Time Systems Symposium"},"citation":{"ieee":"T. A. Henzinger, P. Ho, and H. Wong Toi, “HyTech: The next generation,” in <i>Proceedings 16th IEEE Real-Time Systems Symposium</i>, Pisa, Italy, 1995, pp. 56–65.","chicago":"Henzinger, Thomas A, Pei Ho, and Howard Wong Toi. “HyTech: The next Generation.” In <i>Proceedings 16th IEEE Real-Time Systems Symposium</i>, 56–65. IEEE, 1995. <a href=\"https://doi.org/10.1109/REAL.1995.495196 \">https://doi.org/10.1109/REAL.1995.495196 </a>.","ama":"Henzinger TA, Ho P, Wong Toi H. HyTech: The next generation. In: <i>Proceedings 16th IEEE Real-Time Systems Symposium</i>. IEEE; 1995:56-65. doi:<a href=\"https://doi.org/10.1109/REAL.1995.495196 \">10.1109/REAL.1995.495196 </a>","apa":"Henzinger, T. A., Ho, P., &#38; Wong Toi, H. (1995). HyTech: The next generation. In <i>Proceedings 16th IEEE Real-Time Systems Symposium</i> (pp. 56–65). Pisa, Italy: IEEE. <a href=\"https://doi.org/10.1109/REAL.1995.495196 \">https://doi.org/10.1109/REAL.1995.495196 </a>","ista":"Henzinger TA, Ho P, Wong Toi H. 1995. HyTech: The next generation. Proceedings 16th IEEE Real-Time Systems Symposium. RTSS: Real-Time Systems Symposium, 56–65.","short":"T.A. Henzinger, P. Ho, H. Wong Toi, in:, Proceedings 16th IEEE Real-Time Systems Symposium, IEEE, 1995, pp. 56–65.","mla":"Henzinger, Thomas A., et al. “HyTech: The next Generation.” <i>Proceedings 16th IEEE Real-Time Systems Symposium</i>, IEEE, 1995, pp. 56–65, doi:<a href=\"https://doi.org/10.1109/REAL.1995.495196 \">10.1109/REAL.1995.495196 </a>."},"date_created":"2018-12-11T12:09:10Z","abstract":[{"lang":"eng","text":"We describe a new implementation of HYTECH, a symbolic model checker for hybrid systems. Given a parametric description of an embedded system as a collection of communicating automata, HYTECH automatically computes the conditions on the parameters under which the system satisfies its safety and timing requirements. While the original HYTECH prototype was based on the symbolic algebra tool Mathematica, the new implementation is written in C++ and builds on geometric algorithms instead of formula manipulation. The new HYTECH offers a cleaner and more expressive input language, greater portability, superior performance (typically two to three orders of magnitude), and new features such as diagnostic error-trace generation. We illustrate the effectiveness of the new implementation by applying HYTECH to the automatic parametric analysis of the generic railroad crossing benchmark problem and to an active structure control algorithm"}],"date_published":"1995-01-01T00:00:00Z","publication_status":"published","page":"56 - 65","oa_version":"None","day":"01","_id":"4499","author":[{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"first_name":"Pei","full_name":"Ho, Pei","last_name":"Ho"},{"last_name":"Wong Toi","full_name":"Wong Toi, Howard","first_name":"Howard"}],"type":"conference","status":"public","publisher":"IEEE","date_updated":"2022-06-10T09:33:19Z","year":"1995","language":[{"iso":"eng"}],"doi":"10.1109/REAL.1995.495196 "},{"volume":944,"quality_controlled":"1","publist_id":"229","publication_identifier":{"isbn":["9783540600848"]},"month":"01","intvolume":"       944","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","extern":"1","conference":{"location":"Szeged, Hungary","end_date":"1995-07-14","start_date":"1995-07-10","name":"ICALP: Automata, Languages and Programming"},"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.","date_created":"2018-12-11T12:09:10Z","date_published":"1995-01-01T00:00:00Z","_id":"4500","author":[{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"first_name":"Peter","full_name":"Kopke, Peter","last_name":"Kopke"},{"first_name":"Howard","full_name":"Wong Toi, Howard","last_name":"Wong Toi"}],"type":"conference","publisher":"Springer","year":"1995","language":[{"iso":"eng"}],"doi":"10.1007/3-540-60084-1_93","title":"The expressive power of clocks","publication":"22nd International Colloquium on Automata, Languages and Programming ","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-60084-1_93"}],"alternative_title":["LNCS"],"citation":{"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>.","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.","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.","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>","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>"},"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."}],"page":"417 - 428","publication_status":"published","oa_version":"None","day":"01","status":"public","date_updated":"2022-06-09T14:58:31Z"},{"title":"What's decidable about hybrid automata?","publication":"Proceedings of the 27th annual ACM symposium on Theory of computing","publication_identifier":{"isbn":["9780897917186"]},"publist_id":"228","main_file_link":[{"open_access":"1","url":"https://dl.acm.org/doi/10.1145/225058.225162"}],"quality_controlled":"1","month":"01","conference":{"location":"Las Vegas, NV, United States of America","start_date":"1995-05-29","end_date":"1995-06-01","name":"STOC: Symposium on the Theory of Computing"},"article_processing_charge":"No","extern":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"short":"T.A. Henzinger, P. Kopke, A. Puri, P. Varaiya, in:, Proceedings of the 27th Annual ACM Symposium on Theory of Computing, ACM, 1995, pp. 373–382.","ista":"Henzinger TA, Kopke P, Puri A, Varaiya P. 1995. What’s decidable about hybrid automata? Proceedings of the 27th annual ACM symposium on Theory of computing. STOC: Symposium on the Theory of Computing, 373–382.","mla":"Henzinger, Thomas A., et al. “What’s Decidable about Hybrid Automata?” <i>Proceedings of the 27th Annual ACM Symposium on Theory of Computing</i>, ACM, 1995, pp. 373–82, doi:<a href=\"https://doi.org/10.1145/225058.225162\">10.1145/225058.225162</a>.","apa":"Henzinger, T. A., Kopke, P., Puri, A., &#38; Varaiya, P. (1995). What’s decidable about hybrid automata? In <i>Proceedings of the 27th annual ACM symposium on Theory of computing</i> (pp. 373–382). Las Vegas, NV, United States of America: ACM. <a href=\"https://doi.org/10.1145/225058.225162\">https://doi.org/10.1145/225058.225162</a>","ama":"Henzinger TA, Kopke P, Puri A, Varaiya P. What’s decidable about hybrid automata? In: <i>Proceedings of the 27th Annual ACM Symposium on Theory of Computing</i>. ACM; 1995:373-382. doi:<a href=\"https://doi.org/10.1145/225058.225162\">10.1145/225058.225162</a>","chicago":"Henzinger, Thomas A, Peter Kopke, Anuj Puri, and P. Varaiya. “What’s Decidable about Hybrid Automata?” In <i>Proceedings of the 27th Annual ACM Symposium on Theory of Computing</i>, 373–82. ACM, 1995. <a href=\"https://doi.org/10.1145/225058.225162\">https://doi.org/10.1145/225058.225162</a>.","ieee":"T. A. Henzinger, P. Kopke, A. Puri, and P. Varaiya, “What’s decidable about hybrid automata?,” in <i>Proceedings of the 27th annual ACM symposium on Theory of computing</i>, Las Vegas, NV, United States of America, 1995, pp. 373–382."},"acknowledgement":"We thank Howard Wong-Toi for a careful reading.\r\n","date_created":"2018-12-11T12:09:11Z","abstract":[{"text":"Hybrid automata model systems with both digital and analog components, such as embedded control programs. Many verification tasks for such programs can be expressed as reachability problems for hybrid automata. By improving on previous decidability and undecidability results, we identify the precise boundary between decidability and undecidability of the reachability problem for hybrid automata.\r\n\r\nOn the positive side, we give an (optimal) PSPACE reachability algorithm for the case of initialized rectangular automata, where all analog variables follow trajectories within piecewise-linear envelopes and are reinitialized whenever the envelope changes. Our algorithm is based on the construction of a timed automaton that contains all reachability information about a given initialized rectangular automaton. The translation has practical significance for verification, because it guarantees the termination of symbolic procedures for the reachability analysis of initialized rectangular automata. The translation also preserves the omega-languages of initialized rectangular automata with bounded nondeterminism.\r\n\r\nOn the negative side, we show that several slight generalizations of initialized rectangular automata lead to an undecidable reachability problem. In particular, we prove that the reachability problem is undecidable for timed automata augmented with a single stopwatch.","lang":"eng"}],"day":"01","page":"373 - 382","oa_version":"Published Version","publication_status":"published","date_published":"1995-01-01T00:00:00Z","_id":"4502","oa":1,"author":[{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"first_name":"Peter","full_name":"Kopke, Peter","last_name":"Kopke"},{"last_name":"Puri","first_name":"Anuj","full_name":"Puri, Anuj"},{"full_name":"Varaiya, P.","first_name":"P.","last_name":"Varaiya"}],"type":"conference","status":"public","year":"1995","date_updated":"2022-06-09T14:40:29Z","publisher":"ACM","doi":"10.1145/225058.225162","language":[{"iso":"eng"}]},{"alternative_title":["LNCS"],"citation":{"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.","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>.","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.","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>","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>.","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."},"title":"Hybrid automata with finite bisimulations","publication":"22nd International Colloquium on Automata, Languages and Programming ","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-60084-1_85"}],"status":"public","date_updated":"2022-06-09T14:21:08Z","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."}],"day":"01","oa_version":"None","page":"324 - 335","publication_status":"published","intvolume":"       944","conference":{"end_date":"1995-07-14","start_date":"1995-07-10","name":"ICALP: Automata, Languages and Programming","location":"Szeged, Hungary"},"extern":"1","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","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","date_created":"2018-12-11T12:09:16Z","volume":944,"publist_id":"212","publication_identifier":{"isbn":["9783540600848"]},"quality_controlled":"1","month":"01","type":"conference","year":"1995","publisher":"Springer","doi":"10.1007/3-540-60084-1_85","language":[{"iso":"eng"}],"date_published":"1995-01-01T00:00:00Z","_id":"4518","author":[{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}]}]