[{"abstract":[{"text":"The main contribution of this work is an O(n log n + k)-time algorithm for computing all k intersections among n line segments in the plane. This time complexity is easily shown to be optimal. Within the same asymptotic cost, our algorithm can also construct the subdivision of the plane defined by the segments and compute which segment (if any) lies right above (or below) each intersection and each endpoint. The algorithm has been implemented and performs very well. The storage requirement is on the order of n + k in the worst case, but it is considerably lower in practice. To analyze the complexity of the algorithm, an amortization argument based on a new combinatorial theorem on line arrangements is used.","lang":"eng"}],"day":"01","doi":"10.1145/147508.147511","citation":{"short":"B. Chazelle, H. Edelsbrunner, Journal of the ACM 39 (1992) 1–54.","mla":"Chazelle, Bernard, and Herbert Edelsbrunner. “An Optimal Algorithm for Intersecting Line Segments in the Plane.” <i>Journal of the ACM</i>, vol. 39, no. 1, ACM, 1992, pp. 1–54, doi:<a href=\"https://doi.org/10.1145/147508.147511\">10.1145/147508.147511</a>.","ista":"Chazelle B, Edelsbrunner H. 1992. An optimal algorithm for intersecting line segments in the plane. Journal of the ACM. 39(1), 1–54.","ama":"Chazelle B, Edelsbrunner H. An optimal algorithm for intersecting line segments in the plane. <i>Journal of the ACM</i>. 1992;39(1):1-54. doi:<a href=\"https://doi.org/10.1145/147508.147511\">10.1145/147508.147511</a>","apa":"Chazelle, B., &#38; Edelsbrunner, H. (1992). An optimal algorithm for intersecting line segments in the plane. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/147508.147511\">https://doi.org/10.1145/147508.147511</a>","chicago":"Chazelle, Bernard, and Herbert Edelsbrunner. “An Optimal Algorithm for Intersecting Line Segments in the Plane.” <i>Journal of the ACM</i>. ACM, 1992. <a href=\"https://doi.org/10.1145/147508.147511\">https://doi.org/10.1145/147508.147511</a>.","ieee":"B. Chazelle and H. Edelsbrunner, “An optimal algorithm for intersecting line segments in the plane,” <i>Journal of the ACM</i>, vol. 39, no. 1. ACM, pp. 1–54, 1992."},"year":"1992","date_updated":"2022-03-16T08:32:17Z","extern":"1","acknowledgement":"B, Chazelle wishes to acknowledge the National Science Foundation for supporting this research in part under Grant CCR 87-00917. H, Edelsbrunner is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and the NSF under Grant CCR 87-14565. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for\r\nComputing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.","volume":39,"intvolume":"        39","title":"An optimal algorithm for intersecting line segments in the plane","article_processing_charge":"No","date_created":"2018-12-11T12:06:37Z","publication_status":"published","issue":"1","author":[{"last_name":"Chazelle","first_name":"Bernard","full_name":"Chazelle, Bernard"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner"}],"scopus_import":"1","_id":"4046","article_type":"original","publisher":"ACM","quality_controlled":"1","page":"1 - 54","publist_id":"2078","publication_identifier":{"eissn":["1557-735X"],"issn":["0004-5411"]},"type":"journal_article","date_published":"1992-01-01T00:00:00Z","status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/147508.147511"}],"month":"01","oa_version":"None","publication":"Journal of the ACM","language":[{"iso":"eng"}]},{"volume":92,"acknowledgement":"Work on this paper by the first author has been supported by the National Science Foundation under grant CCR-8714565. Work by the third and sixth authors has been supported by Office of Naval Research Grant NOOOl4-82-K-0381, by National Science Foundation Grant No. NSF-DCR-83-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation. Work by the sixth author has also been supported by a research grant from the NCRD- the Israeli National Council for Research and Development. Work by the fourth author has been supported by National Science Foundation Grant DMS-8501947. ","extern":"1","doi":"10.1016/0304-3975(92)90319-B","day":"20","abstract":[{"lang":"eng","text":"Arrangements of curves in the plane are fundamental to many problems in computational and combinatorial geometry (e.g. motion planning, algebraic cell decomposition, etc.). In this paper we study various topological and combinatorial properties of such arrangements under some mild assumptions on the shape of the curves, and develop basic tools for the construction, manipulation, and analysis of these arrangements. Our main results include a generalization of the zone theorem of Edelsbrunner (1986) and Chazelle (1985) to arrangements of curves (in which we show that the combinatorial complexity of the zone of a curve is nearly linear in the number of curves) and an application of that theorem to obtain a nearly quadratic incremental algorithm for the construction of such arrangements."}],"date_updated":"2022-03-16T09:04:37Z","citation":{"chicago":"Edelsbrunner, Herbert, Leonidas Guibas, János Pach, Richard Pollack, Raimund Seidel, and Micha Sharir. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.” <i>Theoretical Computer Science</i>. Elsevier, 1992. <a href=\"https://doi.org/10.1016/0304-3975(92)90319-B\">https://doi.org/10.1016/0304-3975(92)90319-B</a>.","ieee":"H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, and M. Sharir, “Arrangements of curves in the plane - topology, combinatorics, and algorithms,” <i>Theoretical Computer Science</i>, vol. 92, no. 2. Elsevier, pp. 319–336, 1992.","apa":"Edelsbrunner, H., Guibas, L., Pach, J., Pollack, R., Seidel, R., &#38; Sharir, M. (1992). Arrangements of curves in the plane - topology, combinatorics, and algorithms. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/0304-3975(92)90319-B\">https://doi.org/10.1016/0304-3975(92)90319-B</a>","ama":"Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. Arrangements of curves in the plane - topology, combinatorics, and algorithms. <i>Theoretical Computer Science</i>. 1992;92(2):319-336. doi:<a href=\"https://doi.org/10.1016/0304-3975(92)90319-B\">10.1016/0304-3975(92)90319-B</a>","ista":"Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. 1992. Arrangements of curves in the plane - topology, combinatorics, and algorithms. Theoretical Computer Science. 92(2), 319–336.","mla":"Edelsbrunner, Herbert, et al. “Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms.” <i>Theoretical Computer Science</i>, vol. 92, no. 2, Elsevier, 1992, pp. 319–36, doi:<a href=\"https://doi.org/10.1016/0304-3975(92)90319-B\">10.1016/0304-3975(92)90319-B</a>.","short":"H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, M. Sharir, Theoretical Computer Science 92 (1992) 319–336."},"year":"1992","publisher":"Elsevier","article_type":"original","page":"319 - 336","quality_controlled":"1","publication_status":"published","article_processing_charge":"No","date_created":"2018-12-11T12:06:37Z","title":"Arrangements of curves in the plane - topology, combinatorics, and algorithms","intvolume":"        92","_id":"4047","scopus_import":"1","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"},{"full_name":"Guibas, Leonidas","first_name":"Leonidas","last_name":"Guibas"},{"first_name":"János","last_name":"Pach","full_name":"Pach, János"},{"last_name":"Pollack","first_name":"Richard","full_name":"Pollack, Richard"},{"full_name":"Seidel, Raimund","last_name":"Seidel","first_name":"Raimund"},{"full_name":"Sharir, Micha","last_name":"Sharir","first_name":"Micha"}],"issue":"2","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/030439759290319B?via%3Dihub","open_access":"1"}],"status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_identifier":{"issn":["0304-3975"]},"oa":1,"publist_id":"2079","date_published":"1992-01-20T00:00:00Z","type":"journal_article","language":[{"iso":"eng"}],"oa_version":"Published Version","month":"01","publication":"Theoretical Computer Science"},{"date_updated":"2022-03-16T09:20:13Z","citation":{"ama":"Aggarwal A, Edelsbrunner H, Raghavan P, Tiwari P. Optimal time bounds for some proximity problems in the plane. <i>Information Processing Letters</i>. 1992;42(1):55-60. doi:<a href=\"https://doi.org/10.1016/0020-0190(92)90133-G\">10.1016/0020-0190(92)90133-G</a>","apa":"Aggarwal, A., Edelsbrunner, H., Raghavan, P., &#38; Tiwari, P. (1992). Optimal time bounds for some proximity problems in the plane. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/0020-0190(92)90133-G\">https://doi.org/10.1016/0020-0190(92)90133-G</a>","ieee":"A. Aggarwal, H. Edelsbrunner, P. Raghavan, and P. Tiwari, “Optimal time bounds for some proximity problems in the plane,” <i>Information Processing Letters</i>, vol. 42, no. 1. Elsevier, pp. 55–60, 1992.","chicago":"Aggarwal, Alok, Herbert Edelsbrunner, Prabhakar Raghavan, and Prasoon Tiwari. “Optimal Time Bounds for Some Proximity Problems in the Plane.” <i>Information Processing Letters</i>. Elsevier, 1992. <a href=\"https://doi.org/10.1016/0020-0190(92)90133-G\">https://doi.org/10.1016/0020-0190(92)90133-G</a>.","short":"A. Aggarwal, H. Edelsbrunner, P. Raghavan, P. Tiwari, Information Processing Letters 42 (1992) 55–60.","mla":"Aggarwal, Alok, et al. “Optimal Time Bounds for Some Proximity Problems in the Plane.” <i>Information Processing Letters</i>, vol. 42, no. 1, Elsevier, 1992, pp. 55–60, doi:<a href=\"https://doi.org/10.1016/0020-0190(92)90133-G\">10.1016/0020-0190(92)90133-G</a>.","ista":"Aggarwal A, Edelsbrunner H, Raghavan P, Tiwari P. 1992. Optimal time bounds for some proximity problems in the plane. Information Processing Letters. 42(1), 55–60."},"year":"1992","doi":"10.1016/0020-0190(92)90133-G","day":"27","abstract":[{"text":"Given a sequence of n points that form the vertices of a simple polygon, we show that determining a closest pair requires OMEGA(n log n) time in the algebraic decision tree model. Together with the well-known O(n log n) upper bound for finding a closest pair, this settles an open problem of Lee and Preparata. We also extend this O(n log n) upper bound to the following problem: Given a collection of sets with a total of n points in the plane, find for each point a closest neighbor that does not belong to the same set.","lang":"eng"}],"acknowledgement":"Research supported by the National Science Foundation under Grant CCR-8714565.","volume":42,"extern":"1","_id":"4048","scopus_import":"1","author":[{"first_name":"Alok","last_name":"Aggarwal","full_name":"Aggarwal, Alok"},{"last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Raghavan","first_name":"Prabhakar","full_name":"Raghavan, Prabhakar"},{"full_name":"Tiwari, Prasoon","last_name":"Tiwari","first_name":"Prasoon"}],"issue":"1","publication_status":"published","date_created":"2018-12-11T12:06:38Z","article_processing_charge":"No","title":"Optimal time bounds for some proximity problems in the plane","intvolume":"        42","page":"55 - 60","quality_controlled":"1","publisher":"Elsevier","article_type":"original","date_published":"1992-04-27T00:00:00Z","type":"journal_article","publication_identifier":{"eissn":["1872-6119"],"issn":["0020-0190"]},"publist_id":"2080","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/002001909290133G"}],"status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication":"Information Processing Letters","oa_version":"None","month":"04","language":[{"iso":"eng"}]},{"author":[{"first_name":"Marshall","last_name":"Bern","full_name":"Bern, Marshall"},{"last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Eppstein, David","last_name":"Eppstein","first_name":"David"},{"full_name":"Mitchell, Stephen","first_name":"Stephen","last_name":"Mitchell"},{"full_name":"Tan, Tiow","first_name":"Tiow","last_name":"Tan"}],"scopus_import":"1","_id":"4049","intvolume":"       583","alternative_title":["LNCS"],"title":"Edge insertion for optimal triangulations","article_processing_charge":"No","date_created":"2018-12-11T12:06:38Z","publication_status":"published","quality_controlled":"1","page":"46 - 60","editor":[{"first_name":"Imre","last_name":"Simon","full_name":"Simon, Imre"}],"publisher":"Springer","citation":{"chicago":"Bern, Marshall, Herbert Edelsbrunner, David Eppstein, Stephen Mitchell, and Tiow Tan. “Edge Insertion for Optimal Triangulations.” In <i>1st Latin American Symposium on Theoretical Informatics</i>, edited by Imre Simon, 583:46–60. Springer, 1992. <a href=\"https://doi.org/10.1007/BFb0023816\">https://doi.org/10.1007/BFb0023816</a>.","ieee":"M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, and T. Tan, “Edge insertion for optimal triangulations,” in <i>1st Latin American Symposium on Theoretical Informatics</i>, São Paulo, Brazil, 1992, vol. 583, pp. 46–60.","apa":"Bern, M., Edelsbrunner, H., Eppstein, D., Mitchell, S., &#38; Tan, T. (1992). Edge insertion for optimal triangulations. In I. Simon (Ed.), <i>1st Latin American Symposium on Theoretical Informatics</i> (Vol. 583, pp. 46–60). São Paulo, Brazil: Springer. <a href=\"https://doi.org/10.1007/BFb0023816\">https://doi.org/10.1007/BFb0023816</a>","ama":"Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. Edge insertion for optimal triangulations. In: Simon I, ed. <i>1st Latin American Symposium on Theoretical Informatics</i>. Vol 583. Springer; 1992:46-60. doi:<a href=\"https://doi.org/10.1007/BFb0023816\">10.1007/BFb0023816</a>","ista":"Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. 1992. Edge insertion for optimal triangulations. 1st Latin American Symposium on Theoretical Informatics. LATIN: Latin American Symposium on Theoretical Informatics , LNCS, vol. 583, 46–60.","short":"M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, T. Tan, in:, I. Simon (Ed.), 1st Latin American Symposium on Theoretical Informatics, Springer, 1992, pp. 46–60.","mla":"Bern, Marshall, et al. “Edge Insertion for Optimal Triangulations.” <i>1st Latin American Symposium on Theoretical Informatics</i>, edited by Imre Simon, vol. 583, Springer, 1992, pp. 46–60, doi:<a href=\"https://doi.org/10.1007/BFb0023816\">10.1007/BFb0023816</a>."},"year":"1992","date_updated":"2022-03-16T08:04:53Z","abstract":[{"text":"The edge-insertion paradigm improves a triangulation of a finite point set in R2 iteratively by adding a new edge, deleting intersecting old edges, and retriangulating the resulting two polygonal regions. After presenting an abstract view of the paradigm, this paper shows that it can be used to obtain polynomial time algorithms for several types of optimal triangulations.","lang":"eng"}],"day":"07","doi":"10.1007/BFb0023816","extern":"1","volume":583,"acknowledgement":"Research of the second author is supported by the National Science Foundation under grant no. CCR-8921421 and under the Alan T. Waterman award, grant no. CCR-9118874. Any opinions, finding and conclusions or recommendations expressed in this publication are those of the authors and do not necessarily reflect the view of the National Science Foundation. Part of the work was done while the second, third, and fourth authors visited the Xerox Palo Alto Research Center. The fifth author is on study leave from the National University of Singapore, Republic of Singapore.","publication":"1st Latin American Symposium on Theoretical Informatics","month":"04","oa_version":"None","language":[{"iso":"eng"}],"conference":{"name":"LATIN: Latin American Symposium on Theoretical Informatics ","start_date":"1992-04-06","end_date":"1992-04-10","location":"São Paulo, Brazil"},"type":"conference","date_published":"1992-04-07T00:00:00Z","publist_id":"2076","publication_identifier":{"isbn":["978-3-540-55284-0"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/BFb0023816"}]},{"main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02293046"}],"volume":8,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","extern":"1","citation":{"ieee":"H. Edelsbrunner, “Guest editor’s foreword,” <i>Discrete &#38; Computational Geometry</i>, vol. 8, no. 1. Springer, pp. 217–217, 1992.","chicago":"Edelsbrunner, Herbert. “Guest Editor’s Foreword.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1992. <a href=\"https://doi.org/10.1007/BF02293046\">https://doi.org/10.1007/BF02293046</a>.","apa":"Edelsbrunner, H. (1992). Guest editor’s foreword. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02293046\">https://doi.org/10.1007/BF02293046</a>","ama":"Edelsbrunner H. Guest editor’s foreword. <i>Discrete &#38; Computational Geometry</i>. 1992;8(1):217-217. doi:<a href=\"https://doi.org/10.1007/BF02293046\">10.1007/BF02293046</a>","ista":"Edelsbrunner H. 1992. Guest editor’s foreword. Discrete &#38; Computational Geometry. 8(1), 217–217.","short":"H. Edelsbrunner, Discrete &#38; Computational Geometry 8 (1992) 217–217.","mla":"Edelsbrunner, Herbert. “Guest Editor’s Foreword.” <i>Discrete &#38; Computational Geometry</i>, vol. 8, no. 1, Springer, 1992, pp. 217–217, doi:<a href=\"https://doi.org/10.1007/BF02293046\">10.1007/BF02293046</a>."},"year":"1992","date_updated":"2022-03-16T08:15:04Z","type":"journal_article","date_published":"1992-08-01T00:00:00Z","day":"01","doi":"10.1007/BF02293046","publist_id":"2077","quality_controlled":"1","page":"217 - 217","language":[{"iso":"eng"}],"publisher":"Springer","article_type":"letter_note","scopus_import":"1","publication":"Discrete & Computational Geometry","_id":"4050","issue":"1","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","date_created":"2018-12-11T12:06:39Z","oa_version":"None","publication_status":"published","intvolume":"         8","title":"Guest editor's foreword","month":"08"},{"language":[{"iso":"eng"}],"publication":"Combinatorica","month":"09","oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF01285815"}],"type":"journal_article","date_published":"1992-09-01T00:00:00Z","publist_id":"2074","publication_identifier":{"issn":["0209-9683"]},"quality_controlled":"1","page":"261 - 274","article_type":"original","publisher":"Springer","issue":"3","author":[{"last_name":"Aronov","first_name":"Boris","full_name":"Aronov, Boris"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner"},{"full_name":"Guibas, Leonidas","last_name":"Guibas","first_name":"Leonidas"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"}],"scopus_import":"1","_id":"4053","intvolume":"        12","title":"The number of edges of many faces in a line segment arrangement","date_created":"2018-12-11T12:06:40Z","article_processing_charge":"No","publication_status":"published","extern":"1","volume":12,"citation":{"ista":"Aronov B, Edelsbrunner H, Guibas L, Sharir M. 1992. The number of edges of many faces in a line segment arrangement. Combinatorica. 12(3), 261–274.","short":"B. Aronov, H. Edelsbrunner, L. Guibas, M. Sharir, Combinatorica 12 (1992) 261–274.","mla":"Aronov, Boris, et al. “The Number of Edges of Many Faces in a Line Segment Arrangement.” <i>Combinatorica</i>, vol. 12, no. 3, Springer, 1992, pp. 261–74, doi:<a href=\"https://doi.org/10.1007/BF01285815\">10.1007/BF01285815</a>.","ieee":"B. Aronov, H. Edelsbrunner, L. Guibas, and M. Sharir, “The number of edges of many faces in a line segment arrangement,” <i>Combinatorica</i>, vol. 12, no. 3. Springer, pp. 261–274, 1992.","chicago":"Aronov, Boris, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “The Number of Edges of Many Faces in a Line Segment Arrangement.” <i>Combinatorica</i>. Springer, 1992. <a href=\"https://doi.org/10.1007/BF01285815\">https://doi.org/10.1007/BF01285815</a>.","ama":"Aronov B, Edelsbrunner H, Guibas L, Sharir M. The number of edges of many faces in a line segment arrangement. <i>Combinatorica</i>. 1992;12(3):261-274. doi:<a href=\"https://doi.org/10.1007/BF01285815\">10.1007/BF01285815</a>","apa":"Aronov, B., Edelsbrunner, H., Guibas, L., &#38; Sharir, M. (1992). The number of edges of many faces in a line segment arrangement. <i>Combinatorica</i>. Springer. <a href=\"https://doi.org/10.1007/BF01285815\">https://doi.org/10.1007/BF01285815</a>"},"year":"1992","date_updated":"2022-03-15T15:44:26Z","abstract":[{"lang":"eng","text":"We show that the maximum number of edges bounding m faces in an arrangement of n line segments in the plane is O(m2/3n2/3+nα(n)+nlog m). This improves a previous upper bound of Edelsbrunner et al. [5] and almost matches the best known lower bound which is Ω(m2/3n2/3+nα(n)). In addition, we show that the number of edges bounding any m faces in an arrangement of n line segments with a total of t intersecting pairs is O(m2/3t1/3+nα(t/n)+nmin{log m,log t/n}), almost matching the lower bound of Ω(m2/3t1/3+nα(t/n)) demonstrated in this paper."}],"day":"01","doi":"10.1007/BF01285815"},{"extern":"1","volume":3,"abstract":[{"lang":"eng","text":"The effects of tri-iodothyronine (T3), which are known to affect cerebellar development, were tested on neuronal survival and differentiation of cultured cerebellar granule neurons. T3 in physiological concentrations increased both granule neuron survival after three days in culture and synaptic vesicle protein formation, as shown by immunostaining with antibodies against synaptophysin. Likewise, T3 increased the mRNA level for synapsin(I), but not that for GAP43 in granule neurons. Antibodies against microtubule associated protein Tau, which is expressed in developing neurites, showed that T3 also enhanced neurite formation."}],"doi":"10.1097/00001756-199208000-00008 ","day":"01","external_id":{"pmid":["1387811 "]},"date_updated":"2022-03-15T15:25:24Z","citation":{"ista":"Heisenberg C-PJ, Thoenen H, Lindholm D. 1992. Triiodothyronine Regulates Survival and Differentiation of Rat Cerebellar Granule Neurons. Neuroreport. 3(8), 685–688.","short":"C.-P.J. Heisenberg, H. Thoenen, D. Lindholm, Neuroreport 3 (1992) 685–688.","mla":"Heisenberg, Carl-Philipp J., et al. “Triiodothyronine Regulates Survival and Differentiation of Rat Cerebellar Granule Neurons.” <i>Neuroreport</i>, vol. 3, no. 8, Lippincott, Williams &#38; Wilkins, 1992, pp. 685–88, doi:<a href=\"https://doi.org/10.1097/00001756-199208000-00008 \">10.1097/00001756-199208000-00008 </a>.","ieee":"C.-P. J. Heisenberg, H. Thoenen, and D. Lindholm, “Triiodothyronine Regulates Survival and Differentiation of Rat Cerebellar Granule Neurons,” <i>Neuroreport</i>, vol. 3, no. 8. Lippincott, Williams &#38; Wilkins, pp. 685–688, 1992.","chicago":"Heisenberg, Carl-Philipp J, Hans Thoenen, and Dan Lindholm. “Triiodothyronine Regulates Survival and Differentiation of Rat Cerebellar Granule Neurons.” <i>Neuroreport</i>. Lippincott, Williams &#38; Wilkins, 1992. <a href=\"https://doi.org/10.1097/00001756-199208000-00008 \">https://doi.org/10.1097/00001756-199208000-00008 </a>.","apa":"Heisenberg, C.-P. J., Thoenen, H., &#38; Lindholm, D. (1992). Triiodothyronine Regulates Survival and Differentiation of Rat Cerebellar Granule Neurons. <i>Neuroreport</i>. Lippincott, Williams &#38; Wilkins. <a href=\"https://doi.org/10.1097/00001756-199208000-00008 \">https://doi.org/10.1097/00001756-199208000-00008 </a>","ama":"Heisenberg C-PJ, Thoenen H, Lindholm D. Triiodothyronine Regulates Survival and Differentiation of Rat Cerebellar Granule Neurons. <i>Neuroreport</i>. 1992;3(8):685-688. doi:<a href=\"https://doi.org/10.1097/00001756-199208000-00008 \">10.1097/00001756-199208000-00008 </a>"},"year":"1992","article_type":"original","publisher":"Lippincott, Williams & Wilkins","page":"685 - 688","quality_controlled":"1","title":"Triiodothyronine Regulates Survival and Differentiation of Rat Cerebellar Granule Neurons","intvolume":"         3","publication_status":"published","date_created":"2018-12-11T12:07:31Z","article_processing_charge":"No","author":[{"orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Hans","last_name":"Thoenen","full_name":"Thoenen, Hans"},{"full_name":"Lindholm, Dan","last_name":"Lindholm","first_name":"Dan"}],"issue":"8","pmid":1,"_id":"4195","scopus_import":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","main_file_link":[{"url":"https://journals.lww.com/neuroreport/abstract/1992/08000/tri_iodothyronine_regulates_survival_and.8.aspx"}],"publist_id":"1922","publication_identifier":{"eissn":["1473-558X"],"issn":["0959-4965"]},"date_published":"1992-01-01T00:00:00Z","type":"journal_article","language":[{"iso":"eng"}],"month":"01","oa_version":"None","publication":"Neuroreport"},{"month":"08","oa_version":"Published Version","publication":"Evolution; International Journal of Organic Evolution","language":[{"iso":"eng"}],"publist_id":"1759","publication_identifier":{"eissn":["1558-5646"],"issn":["0014-3820"]},"date_published":"1992-08-01T00:00:00Z","type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","main_file_link":[{"url":"http://www.jstor.org/stable/2409761"}],"title":"A model of a hybrid zone between two chromosomal races of the common shrew (Sorex araneus)","intvolume":"        46","publication_status":"published","article_processing_charge":"No","date_created":"2018-12-11T12:08:09Z","author":[{"last_name":"Hatfield","first_name":"Todd","full_name":"Hatfield, Todd"},{"last_name":"Barton","first_name":"Nicholas H","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Searle, Jeremy","first_name":"Jeremy","last_name":"Searle"}],"issue":"4","_id":"4305","pmid":1,"article_type":"original","publisher":"Wiley-Blackwell","page":"1129 - 1145","quality_controlled":"1","abstract":[{"text":"The common shrew (Sorex araneus) is subdivided into several karyotypic races in Britain. Two of these races meet near Oxford to form the &quot;Oxford-Hermitage&quot; hybrid zone. We present a model which describes this system as a &quot;tension zone,&quot; i.e., a set of clines maintained by a balance between dispersal and selection against chromosomal heterozygotes. The Oxford and Hermitage races differ by Robertsonian fusions with monobrachial homology (kq, no versus ko), and so F1 hybrids between them would have low fertility. However, the acrocentric karyotype is found at high frequency within the hybrid zone, so that complex Robertsonian heterozygotes (kq no/q ko n) are replaced by more fertile combinations, such as (kq no/k q n o). This suggests that the hybrid zone has been modified so as to increase hybrid fitness. Mathematical analysis and simulation show that, if selection against complex heterozygotes is sufficiently strong relative to selection against simple heterozygotes, acrocentrics increase, and displace the clines for kq and no from the cline for ko. Superimposed on this separation is a tendency for the hybrid zone to move m favor of the Oxford (kq no) race. We compare the model with estimates of linkage disequilibrium and cline shape made from field data.","lang":"eng"}],"doi":"10.1111/j.1558-5646.1992.tb00624.x","day":"01","external_id":{"pmid":["28564402"]},"date_updated":"2022-03-15T14:49:26Z","year":"1992","citation":{"ama":"Hatfield T, Barton NH, Searle J. A model of a hybrid zone between two chromosomal races of the common shrew (Sorex araneus). <i>Evolution; International Journal of Organic Evolution</i>. 1992;46(4):1129-1145. doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1992.tb00624.x\">10.1111/j.1558-5646.1992.tb00624.x</a>","apa":"Hatfield, T., Barton, N. H., &#38; Searle, J. (1992). A model of a hybrid zone between two chromosomal races of the common shrew (Sorex araneus). <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1558-5646.1992.tb00624.x\">https://doi.org/10.1111/j.1558-5646.1992.tb00624.x</a>","chicago":"Hatfield, Todd, Nicholas H Barton, and Jeremy Searle. “A Model of a Hybrid Zone between Two Chromosomal Races of the Common Shrew (Sorex Araneus).” <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell, 1992. <a href=\"https://doi.org/10.1111/j.1558-5646.1992.tb00624.x\">https://doi.org/10.1111/j.1558-5646.1992.tb00624.x</a>.","ieee":"T. Hatfield, N. H. Barton, and J. Searle, “A model of a hybrid zone between two chromosomal races of the common shrew (Sorex araneus),” <i>Evolution; International Journal of Organic Evolution</i>, vol. 46, no. 4. Wiley-Blackwell, pp. 1129–1145, 1992.","short":"T. Hatfield, N.H. Barton, J. Searle, Evolution; International Journal of Organic Evolution 46 (1992) 1129–1145.","mla":"Hatfield, Todd, et al. “A Model of a Hybrid Zone between Two Chromosomal Races of the Common Shrew (Sorex Araneus).” <i>Evolution; International Journal of Organic Evolution</i>, vol. 46, no. 4, Wiley-Blackwell, 1992, pp. 1129–45, doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1992.tb00624.x\">10.1111/j.1558-5646.1992.tb00624.x</a>.","ista":"Hatfield T, Barton NH, Searle J. 1992. A model of a hybrid zone between two chromosomal races of the common shrew (Sorex araneus). Evolution; International Journal of Organic Evolution. 46(4), 1129–1145."},"extern":"1","acknowledgement":"This study was funded by grants from the Royal Society of London to J.B.S., and from the S.E.R.C., N.E.R.C. and the Darwin Trust to N.Barton. A.J.Reilly, Y.Luo, and S. J.Mercer provided unpublished data and D.Currie, A.E.Douglas, K.  S.Jackson, X.Lambin and D.Kapan made helpful comments on the manuscript. We appreciate our discussions with B. O.Bengtsson. ","volume":46},{"year":"1992","citation":{"apa":"Barton, N. H., &#38; Goldman, N. (1992). Genetics and geography. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/357440a0\">https://doi.org/10.1038/357440a0</a>","ama":"Barton NH, Goldman N. Genetics and geography. <i>Nature</i>. 1992;357:440-441. doi:<a href=\"https://doi.org/10.1038/357440a0\">10.1038/357440a0</a>","ieee":"N. H. Barton and N. Goldman, “Genetics and geography,” <i>Nature</i>, vol. 357. Nature Publishing Group, pp. 440–441, 1992.","chicago":"Barton, Nicholas H, and Nick Goldman. “Genetics and Geography.” <i>Nature</i>. Nature Publishing Group, 1992. <a href=\"https://doi.org/10.1038/357440a0\">https://doi.org/10.1038/357440a0</a>.","mla":"Barton, Nicholas H., and Nick Goldman. “Genetics and Geography.” <i>Nature</i>, vol. 357, Nature Publishing Group, 1992, pp. 440–41, doi:<a href=\"https://doi.org/10.1038/357440a0\">10.1038/357440a0</a>.","short":"N.H. Barton, N. Goldman, Nature 357 (1992) 440–441.","ista":"Barton NH, Goldman N. 1992. Genetics and geography. Nature. 357, 440–441."},"date_updated":"2022-03-15T14:27:10Z","type":"review","date_published":"1992-06-11T00:00:00Z","day":"11","doi":"10.1038/357440a0","publist_id":"1758","main_file_link":[{"url":"https://www.nature.com/articles/357440a0"}],"volume":357,"status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","scopus_import":"1","_id":"4306","publication":"Nature","author":[{"orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Goldman","first_name":"Nick","full_name":"Goldman, Nick"}],"article_processing_charge":"No","date_created":"2018-12-11T12:08:10Z","oa_version":"None","publication_status":"published","intvolume":"       357","month":"06","title":"Genetics and geography","quality_controlled":"1","page":"440 - 441","language":[{"iso":"eng"}],"publisher":"Nature Publishing Group"},{"date_created":"2018-12-11T12:08:10Z","article_processing_charge":"No","publication_status":"published","oa_version":"None","month":"01","title":"The genetic consequences of dispersal","publication":"Animal dispersal: small mammals as a model","_id":"4307","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","first_name":"Nicholas H","last_name":"Barton"}],"editor":[{"last_name":"Stenseth","first_name":"Nils","full_name":"Stenseth, Nils"},{"full_name":"Lidicker, William","first_name":"William","last_name":"Lidicker"}],"publisher":"Chapman Hall","quality_controlled":"1","page":"37 - 60","language":[{"iso":"eng"}],"day":"01","doi":"10.1007/978-94-011-2338-9_3","publist_id":"1757","citation":{"apa":"Barton, N. H. (1992). The genetic consequences of dispersal. In N. Stenseth &#38; W. Lidicker (Eds.), <i>Animal dispersal: small mammals as a model</i> (pp. 37–60). Chapman Hall. <a href=\"https://doi.org/10.1007/978-94-011-2338-9_3\">https://doi.org/10.1007/978-94-011-2338-9_3</a>","ama":"Barton NH. The genetic consequences of dispersal. In: Stenseth N, Lidicker W, eds. <i>Animal Dispersal: Small Mammals as a Model</i>. Chapman Hall; 1992:37-60. doi:<a href=\"https://doi.org/10.1007/978-94-011-2338-9_3\">10.1007/978-94-011-2338-9_3</a>","ieee":"N. H. Barton, “The genetic consequences of dispersal,” in <i>Animal dispersal: small mammals as a model</i>, N. Stenseth and W. Lidicker, Eds. Chapman Hall, 1992, pp. 37–60.","chicago":"Barton, Nicholas H. “The Genetic Consequences of Dispersal.” In <i>Animal Dispersal: Small Mammals as a Model</i>, edited by Nils Stenseth and William Lidicker, 37–60. Chapman Hall, 1992. <a href=\"https://doi.org/10.1007/978-94-011-2338-9_3\">https://doi.org/10.1007/978-94-011-2338-9_3</a>.","mla":"Barton, Nicholas H. “The Genetic Consequences of Dispersal.” <i>Animal Dispersal: Small Mammals as a Model</i>, edited by Nils Stenseth and William Lidicker, Chapman Hall, 1992, pp. 37–60, doi:<a href=\"https://doi.org/10.1007/978-94-011-2338-9_3\">10.1007/978-94-011-2338-9_3</a>.","short":"N.H. Barton, in:, N. Stenseth, W. Lidicker (Eds.), Animal Dispersal: Small Mammals as a Model, Chapman Hall, 1992, pp. 37–60.","ista":"Barton NH. 1992.The genetic consequences of dispersal. In: Animal dispersal: small mammals as a model. , 37–60."},"year":"1992","date_updated":"2022-03-14T14:19:36Z","type":"book_chapter","date_published":"1992-01-01T00:00:00Z","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/978-94-011-2338-9_3"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","extern":"1"},{"intvolume":"        46","month":"04","title":"On the spread of new gene combinations in the third phase of Wright's shifting balance","date_created":"2018-12-11T12:08:10Z","article_processing_charge":"No","oa_version":"None","publication_status":"published","issue":"2","author":[{"orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"_id":"4308","publication":"Evolution; International Journal of Organic Evolution","article_type":"original","publisher":"Wiley-Blackwell","language":[{"iso":"eng"}],"quality_controlled":"1","page":"551 - 557","publist_id":"1756","day":"01","publication_identifier":{"issn":["0014-3820"],"eissn":["1558-5646"]},"type":"journal_article","date_published":"1992-04-01T00:00:00Z","year":"1992","citation":{"short":"N.H. Barton, Evolution; International Journal of Organic Evolution 46 (1992) 551–557.","mla":"Barton, Nicholas H. “On the Spread of New Gene Combinations in the Third Phase of Wright’s Shifting Balance.” <i>Evolution; International Journal of Organic Evolution</i>, vol. 46, no. 2, Wiley-Blackwell, 1992, pp. 551–57.","ista":"Barton NH. 1992. On the spread of new gene combinations in the third phase of Wright’s shifting balance. Evolution; International Journal of Organic Evolution. 46(2), 551–557.","ama":"Barton NH. On the spread of new gene combinations in the third phase of Wright’s shifting balance. <i>Evolution; International Journal of Organic Evolution</i>. 1992;46(2):551-557.","apa":"Barton, N. H. (1992). On the spread of new gene combinations in the third phase of Wright’s shifting balance. <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell.","ieee":"N. H. Barton, “On the spread of new gene combinations in the third phase of Wright’s shifting balance,” <i>Evolution; International Journal of Organic Evolution</i>, vol. 46, no. 2. Wiley-Blackwell, pp. 551–557, 1992.","chicago":"Barton, Nicholas H. “On the Spread of New Gene Combinations in the Third Phase of Wright’s Shifting Balance.” <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell, 1992."},"date_updated":"2022-03-14T13:36:15Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","extern":"1","main_file_link":[{"url":"http://www.jstor.org/stable/2409871"}],"acknowledgement":"This work was supported by the Darwin Trust, NSF  grant BSR/866548, and SERC grant GR/E/08507. Valuable comments on the manuscript were received  from D. Currie, K. Dawson, K. S. Jackson, W. G. Hill,  M. Turelli, and an anonymous referee. I would particularly like to thank K. Dawson and the referee, for  pointing out the complexities involved in calculating  P(i, j; k), and J. F. Crow, for supplying detailed simulation results, and for his helpful comments on the draft of this paper.","volume":46},{"publication":"19th International Colloquium on Automata, Languages and Programming","month":"01","oa_version":"None","language":[{"iso":"eng"}],"conference":{"location":"Vienna, Austria","end_date":"1992-07-17","start_date":"1992-07-13","name":"ICALP: Automata, Languages and Programming"},"date_published":"1992-01-01T00:00:00Z","type":"conference","publist_id":"223","status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-55719-9_103"}],"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Manna, Zohar","first_name":"Zohar","last_name":"Manna"},{"last_name":"Pnueli","first_name":"Amir","full_name":"Pnueli, Amir"}],"_id":"4504","alternative_title":["LNCS"],"title":"What good are digital clocks?","intvolume":"       623","publication_status":"published","date_created":"2018-12-11T12:09:11Z","article_processing_charge":"No","page":"545 - 558","quality_controlled":"1","publisher":"Springer","date_updated":"2022-03-14T09:47:09Z","year":"1992","citation":{"ama":"Henzinger TA, Manna Z, Pnueli A. What good are digital clocks? In: <i>19th International Colloquium on Automata, Languages and Programming</i>. Vol 623. Springer; 1992:545-558. doi:<a href=\"https://doi.org/10.1007/3-540-55719-9_103\">10.1007/3-540-55719-9_103</a>","apa":"Henzinger, T. A., Manna, Z., &#38; Pnueli, A. (1992). What good are digital clocks? In <i>19th International Colloquium on Automata, Languages and Programming</i> (Vol. 623, pp. 545–558). Vienna, Austria: Springer. <a href=\"https://doi.org/10.1007/3-540-55719-9_103\">https://doi.org/10.1007/3-540-55719-9_103</a>","chicago":"Henzinger, Thomas A, Zohar Manna, and Amir Pnueli. “What Good Are Digital Clocks?” In <i>19th International Colloquium on Automata, Languages and Programming</i>, 623:545–58. Springer, 1992. <a href=\"https://doi.org/10.1007/3-540-55719-9_103\">https://doi.org/10.1007/3-540-55719-9_103</a>.","ieee":"T. A. Henzinger, Z. Manna, and A. Pnueli, “What good are digital clocks?,” in <i>19th International Colloquium on Automata, Languages and Programming</i>, Vienna, Austria, 1992, vol. 623, pp. 545–558.","short":"T.A. Henzinger, Z. Manna, A. Pnueli, in:, 19th International Colloquium on Automata, Languages and Programming, Springer, 1992, pp. 545–558.","mla":"Henzinger, Thomas A., et al. “What Good Are Digital Clocks?” <i>19th International Colloquium on Automata, Languages and Programming</i>, vol. 623, Springer, 1992, pp. 545–58, doi:<a href=\"https://doi.org/10.1007/3-540-55719-9_103\">10.1007/3-540-55719-9_103</a>.","ista":"Henzinger TA, Manna Z, Pnueli A. 1992. What good are digital clocks? 19th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 623, 545–558."},"abstract":[{"lang":"eng","text":"Real-time systems operate in “real,” continuous time and state changes may occur at any real-numbered time point. Yet many verification methods are based on the assumption that states are observed at integer time points only. What can we conclude if a real-time system has been shown “correct” for integral observations?\r\n\r\nInteger time verification techniques suffice if the problem of whether all real-numbered behaviors of a system satisfy a property can be reduced to the question of whether the integral observations satisfy a (possibly modified) property. We show that this reduction is possible for a large and important class of systems and properties: the class of systems includes all systems that can be modeled as timed transition systems; the class of properties includes time-bounded invariance and time-bounded response."}],"doi":"10.1007/3-540-55719-9_103","day":"01","extern":"1","volume":623,"acknowledgement":"A full version of this paper (including all proofs) is available as a technical report from Cornell University and Stanford University. The research was supported in part by the National Science Foundation under grants CCR-89-11512 and CCR-89-13641, by the Defense Advanced Research Projects Agency under contract NAG2-703, by the United States Air Force Office of Scientific Research under contract AFOSR-90-0057, and by the European Community ESPRIT Basic Research Action Project 3096 (SPEC).\r\n\r\nSponsors: National Science Foundation grant CCR-89-11512,  National Science Foundation grant CCR-89-13641, Defense Advanced Research Projects Agency contract NAG2-703, United States Air Force Office of Scientific Research contract AFOSR-90-0057, European Community ESPRIT Basic Research Action Project 3096 (SPEC).\r\n"},{"title":"Symbolic model checking for real-time systems","month":"01","oa_version":"None","publication_status":"published","article_processing_charge":"No","date_created":"2018-12-11T12:09:12Z","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Xavier","last_name":"Nicollin","full_name":"Nicollin, Xavier"},{"full_name":"Sifakis, Joseph","last_name":"Sifakis","first_name":"Joseph"},{"full_name":"Yovine, Sergio","last_name":"Yovine","first_name":"Sergio"}],"_id":"4505","publication":"Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science","scopus_import":"1","conference":{"start_date":"1992-06-22","name":"LICS: Logic in Computer Science","end_date":"1992-06-25","location":"Santa Cruz, CA, United States of America"},"publisher":"IEEE","language":[{"iso":"eng"}],"page":"394 - 406","quality_controlled":"1","abstract":[{"lang":"eng","text":"We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space.\r\n\r\nFor this purpose, we introduce a mu-calculus on computation trees over real-numbered time. Unfortunately, many standard program properties, such as response for all nonzeno execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed mu-calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does not impair the symbolic verification of &quot;implementable&quot; real-time programs--those whose safety constraints are machine-closed with respect to diverging time and whose fairness constraints are restricted to finite upper bounds on clock values. All timed CTL properties of such programs are shown to be computable as finitely approximable fixpoints in a simple decidable theory."}],"publist_id":"224","doi":"10.1109/LICS.1992.185551","day":"01","publication_identifier":{"isbn":["0-8186-2735-2"]},"date_published":"1992-01-01T00:00:00Z","type":"conference","date_updated":"2022-03-14T13:20:50Z","year":"1992","citation":{"ieee":"T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, “Symbolic model checking for real-time systems,” in <i>Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science</i>, Santa Cruz, CA, United States of America, 1992, pp. 394–406.","chicago":"Henzinger, Thomas A, Xavier Nicollin, Joseph Sifakis, and Sergio Yovine. “Symbolic Model Checking for Real-Time Systems.” In <i>Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science</i>, 394–406. IEEE, 1992. <a href=\"https://doi.org/10.1109/LICS.1992.185551\">https://doi.org/10.1109/LICS.1992.185551</a>.","apa":"Henzinger, T. A., Nicollin, X., Sifakis, J., &#38; Yovine, S. (1992). Symbolic model checking for real-time systems. In <i>Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science</i> (pp. 394–406). Santa Cruz, CA, United States of America: IEEE. <a href=\"https://doi.org/10.1109/LICS.1992.185551\">https://doi.org/10.1109/LICS.1992.185551</a>","ama":"Henzinger TA, Nicollin X, Sifakis J, Yovine S. Symbolic model checking for real-time systems. In: <i>Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science</i>. IEEE; 1992:394-406. doi:<a href=\"https://doi.org/10.1109/LICS.1992.185551\">10.1109/LICS.1992.185551</a>","ista":"Henzinger TA, Nicollin X, Sifakis J, Yovine S. 1992. Symbolic model checking for real-time systems. Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 394–406.","short":"T.A. Henzinger, X. Nicollin, J. Sifakis, S. Yovine, in:, Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, IEEE, 1992, pp. 394–406.","mla":"Henzinger, Thomas A., et al. “Symbolic Model Checking for Real-Time Systems.” <i>Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science</i>, IEEE, 1992, pp. 394–406, doi:<a href=\"https://doi.org/10.1109/LICS.1992.185551\">10.1109/LICS.1992.185551</a>."},"extern":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/185551"}]},{"publication_status":"published","oa_version":"None","article_processing_charge":"No","date_created":"2018-12-11T12:09:12Z","title":"Timed transition systems","month":"01","alternative_title":["LNCS"],"intvolume":"       600","_id":"4507","publication":"Real Time: Theory in Practice","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Manna, Zohar","last_name":"Manna","first_name":"Zohar"},{"full_name":"Pnueli, Amir","first_name":"Amir","last_name":"Pnueli"}],"publisher":"Springer","page":"226 - 251","language":[{"iso":"eng"}],"doi":"10.1007/BFb0031995","day":"01","abstract":[{"text":"We incorporate time into an interleaving model of concurrency. In timed transition systems, the qualitative fairness requirements of traditional transition system are replaced (and superseded) by quantitative lower-bound and upperbound timing constraints on transitions. The purpose of this paper is to explore the scope of applicability for the abstract model of timed transition systems. We demonstrate that the model can represent a wide variety of phenomena that routinely occur in conjunction with the timed execution of concurrent processes. Our treatment covers both processes that are executed in parallel on separate processors and communicate either through shared variables or by message passing, and processes that time-share a limited number of processors under a given scheduling policy. Often it is this scheduling policy that determines if a system meets its real-time requirements. Thus we explicitly address such questions as time-outs, interrupts, static and dynamic priorities.","lang":"eng"}],"publist_id":"222","date_updated":"2022-03-14T09:34:44Z","year":"1992","citation":{"ista":"Henzinger TA, Manna Z, Pnueli A. 1992.Timed transition systems. In: Real Time: Theory in Practice. LNCS, vol. 600, 226–251.","short":"T.A. Henzinger, Z. Manna, A. Pnueli, in:, Real Time: Theory in Practice, Springer, 1992, pp. 226–251.","mla":"Henzinger, Thomas A., et al. “Timed Transition Systems.” <i>Real Time: Theory in Practice</i>, vol. 600, Springer, 1992, pp. 226–51, doi:<a href=\"https://doi.org/10.1007/BFb0031995\">10.1007/BFb0031995</a>.","chicago":"Henzinger, Thomas A, Zohar Manna, and Amir Pnueli. “Timed Transition Systems.” In <i>Real Time: Theory in Practice</i>, 600:226–51. Springer, 1992. <a href=\"https://doi.org/10.1007/BFb0031995\">https://doi.org/10.1007/BFb0031995</a>.","ieee":"T. A. Henzinger, Z. Manna, and A. Pnueli, “Timed transition systems,” in <i>Real Time: Theory in Practice</i>, vol. 600, Springer, 1992, pp. 226–251.","ama":"Henzinger TA, Manna Z, Pnueli A. Timed transition systems. In: <i>Real Time: Theory in Practice</i>. Vol 600. Springer; 1992:226-251. doi:<a href=\"https://doi.org/10.1007/BFb0031995\">10.1007/BFb0031995</a>","apa":"Henzinger, T. A., Manna, Z., &#38; Pnueli, A. (1992). Timed transition systems. In <i>Real Time: Theory in Practice</i> (Vol. 600, pp. 226–251). Springer. <a href=\"https://doi.org/10.1007/BFb0031995\">https://doi.org/10.1007/BFb0031995</a>"},"date_published":"1992-01-01T00:00:00Z","type":"book_chapter","volume":600,"acknowledgement":"Sponsor: IBM graduate fellowship, National Science Foundation grant CCR-89-11512 National Science Foundation grant CCR-89-13641,  Defense Advanced Research Projects Agency contract N00039-84-C-0211, United States Air Force Office of Scientific Research under contract AFOSR-90-0057,  European Community ESPRIT Basic Research Action project 3096 (SPEC)","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/BFb0031995"}],"extern":"1","status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"},{"publisher":"Elsevier","article_type":"original","page":"135 - 141","quality_controlled":"1","publication_status":"published","date_created":"2018-12-11T12:09:16Z","article_processing_charge":"No","title":"Sooner Is Safer Than Later","intvolume":"        43","_id":"4517","scopus_import":"1","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"}],"issue":"3","volume":43,"acknowledgement":"The author thanks Martin Abadi, Rajeev Alur, David Dill, Leslie Lamport, Zohar Manna, Amir Pnueli, Fred Schneider, and two anonymous referees for many valuable suggestions and improvements. ","extern":"1","doi":"10.1016/0020-0190(92)90005-G","day":"14","abstract":[{"lang":"eng","text":"It has been observed repeatedly that the standard safety-liveness classification for properties of reactive systems does not fit for real-time properties. This is because the implicit “liveliness” of time shifts the spectrum towards the safety side. While, for example, response—that “something good” will happen eventually—is a classical liveness property, bounded response—that “something good” will happen soon, within a certain amount of time—has many characteristics of safety. We account for this phenomenon formally by defining safety and liveness relative to a given condition, such as the progress of time."}],"date_updated":"2022-03-07T11:31:23Z","citation":{"mla":"Henzinger, Thomas A. “Sooner Is Safer Than Later.” <i>Information Processing Letters</i>, vol. 43, no. 3, Elsevier, 1992, pp. 135–41, doi:<a href=\"https://doi.org/10.1016/0020-0190(92)90005-G\">10.1016/0020-0190(92)90005-G</a>.","short":"T.A. Henzinger, Information Processing Letters 43 (1992) 135–141.","ista":"Henzinger TA. 1992. Sooner Is Safer Than Later. Information Processing Letters. 43(3), 135–141.","ama":"Henzinger TA. Sooner Is Safer Than Later. <i>Information Processing Letters</i>. 1992;43(3):135-141. doi:<a href=\"https://doi.org/10.1016/0020-0190(92)90005-G\">10.1016/0020-0190(92)90005-G</a>","apa":"Henzinger, T. A. (1992). Sooner Is Safer Than Later. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/0020-0190(92)90005-G\">https://doi.org/10.1016/0020-0190(92)90005-G</a>","chicago":"Henzinger, Thomas A. “Sooner Is Safer Than Later.” <i>Information Processing Letters</i>. Elsevier, 1992. <a href=\"https://doi.org/10.1016/0020-0190(92)90005-G\">https://doi.org/10.1016/0020-0190(92)90005-G</a>.","ieee":"T. A. Henzinger, “Sooner Is Safer Than Later,” <i>Information Processing Letters</i>, vol. 43, no. 3. Elsevier, pp. 135–141, 1992."},"year":"1992","language":[{"iso":"eng"}],"oa_version":"None","month":"09","publication":"Information Processing Letters","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/002001909290005G?via%3Dihub"}],"status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_identifier":{"issn":["0020-0190"]},"publist_id":"211","date_published":"1992-09-14T00:00:00Z","type":"journal_article"}]