---
_id: '4046'
abstract:
- lang: eng
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.
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."
article_processing_charge: No
article_type: original
author:
- first_name: Bernard
full_name: Chazelle, Bernard
last_name: Chazelle
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: Chazelle B, Edelsbrunner H. An optimal algorithm for intersecting line segments
in the plane. Journal of the ACM. 1992;39(1):1-54. doi:10.1145/147508.147511
apa: Chazelle, B., & Edelsbrunner, H. (1992). An optimal algorithm for intersecting
line segments in the plane. Journal of the ACM. ACM. https://doi.org/10.1145/147508.147511
chicago: Chazelle, Bernard, and Herbert Edelsbrunner. “An Optimal Algorithm for
Intersecting Line Segments in the Plane.” Journal of the ACM. ACM, 1992.
https://doi.org/10.1145/147508.147511.
ieee: B. Chazelle and H. Edelsbrunner, “An optimal algorithm for intersecting line
segments in the plane,” Journal of the ACM, vol. 39, no. 1. ACM, pp. 1–54,
1992.
ista: Chazelle B, Edelsbrunner H. 1992. An optimal algorithm for intersecting line
segments in the plane. Journal of the ACM. 39(1), 1–54.
mla: Chazelle, Bernard, and Herbert Edelsbrunner. “An Optimal Algorithm for Intersecting
Line Segments in the Plane.” Journal of the ACM, vol. 39, no. 1, ACM, 1992,
pp. 1–54, doi:10.1145/147508.147511.
short: B. Chazelle, H. Edelsbrunner, Journal of the ACM 39 (1992) 1–54.
date_created: 2018-12-11T12:06:37Z
date_published: 1992-01-01T00:00:00Z
date_updated: 2022-03-16T08:32:17Z
day: '01'
doi: 10.1145/147508.147511
extern: '1'
intvolume: ' 39'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/doi/10.1145/147508.147511
month: '01'
oa_version: None
page: 1 - 54
publication: Journal of the ACM
publication_identifier:
eissn:
- 1557-735X
issn:
- 0004-5411
publication_status: published
publisher: ACM
publist_id: '2078'
quality_controlled: '1'
scopus_import: '1'
status: public
title: An optimal algorithm for intersecting line segments in the plane
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 39
year: '1992'
...
---
_id: '4047'
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.
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. '
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Leonidas
full_name: Guibas, Leonidas
last_name: Guibas
- first_name: János
full_name: Pach, János
last_name: Pach
- first_name: Richard
full_name: Pollack, Richard
last_name: Pollack
- first_name: Raimund
full_name: Seidel, Raimund
last_name: Seidel
- first_name: Micha
full_name: Sharir, Micha
last_name: Sharir
citation:
ama: Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. Arrangements
of curves in the plane - topology, combinatorics, and algorithms. Theoretical
Computer Science. 1992;92(2):319-336. doi:10.1016/0304-3975(92)90319-B
apa: 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. Elsevier. https://doi.org/10.1016/0304-3975(92)90319-B
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.” Theoretical Computer Science. Elsevier, 1992. https://doi.org/10.1016/0304-3975(92)90319-B.
ieee: H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, and M. Sharir,
“Arrangements of curves in the plane - topology, combinatorics, and algorithms,”
Theoretical Computer Science, vol. 92, no. 2. Elsevier, pp. 319–336, 1992.
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.” Theoretical Computer Science, vol. 92,
no. 2, Elsevier, 1992, pp. 319–36, doi:10.1016/0304-3975(92)90319-B.
short: H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, M. Sharir, Theoretical
Computer Science 92 (1992) 319–336.
date_created: 2018-12-11T12:06:37Z
date_published: 1992-01-20T00:00:00Z
date_updated: 2022-03-16T09:04:37Z
day: '20'
doi: 10.1016/0304-3975(92)90319-B
extern: '1'
intvolume: ' 92'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/030439759290319B?via%3Dihub
month: '01'
oa: 1
oa_version: Published Version
page: 319 - 336
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
publist_id: '2079'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Arrangements of curves in the plane - topology, combinatorics, and algorithms
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 92
year: '1992'
...
---
_id: '4048'
abstract:
- lang: eng
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.'
acknowledgement: Research supported by the National Science Foundation under Grant
CCR-8714565.
article_processing_charge: No
article_type: original
author:
- first_name: Alok
full_name: Aggarwal, Alok
last_name: Aggarwal
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Prabhakar
full_name: Raghavan, Prabhakar
last_name: Raghavan
- first_name: Prasoon
full_name: Tiwari, Prasoon
last_name: Tiwari
citation:
ama: Aggarwal A, Edelsbrunner H, Raghavan P, Tiwari P. Optimal time bounds for some
proximity problems in the plane. Information Processing Letters. 1992;42(1):55-60.
doi:10.1016/0020-0190(92)90133-G
apa: Aggarwal, A., Edelsbrunner, H., Raghavan, P., & Tiwari, P. (1992). Optimal
time bounds for some proximity problems in the plane. Information Processing
Letters. Elsevier. https://doi.org/10.1016/0020-0190(92)90133-G
chicago: Aggarwal, Alok, Herbert Edelsbrunner, Prabhakar Raghavan, and Prasoon Tiwari.
“Optimal Time Bounds for Some Proximity Problems in the Plane.” Information
Processing Letters. Elsevier, 1992. https://doi.org/10.1016/0020-0190(92)90133-G.
ieee: A. Aggarwal, H. Edelsbrunner, P. Raghavan, and P. Tiwari, “Optimal time bounds
for some proximity problems in the plane,” Information Processing Letters,
vol. 42, no. 1. Elsevier, pp. 55–60, 1992.
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.
mla: Aggarwal, Alok, et al. “Optimal Time Bounds for Some Proximity Problems in
the Plane.” Information Processing Letters, vol. 42, no. 1, Elsevier, 1992,
pp. 55–60, doi:10.1016/0020-0190(92)90133-G.
short: A. Aggarwal, H. Edelsbrunner, P. Raghavan, P. Tiwari, Information Processing
Letters 42 (1992) 55–60.
date_created: 2018-12-11T12:06:38Z
date_published: 1992-04-27T00:00:00Z
date_updated: 2022-03-16T09:20:13Z
day: '27'
doi: 10.1016/0020-0190(92)90133-G
extern: '1'
intvolume: ' 42'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://www.sciencedirect.com/science/article/pii/002001909290133G
month: '04'
oa_version: None
page: 55 - 60
publication: Information Processing Letters
publication_identifier:
eissn:
- 1872-6119
issn:
- 0020-0190
publication_status: published
publisher: Elsevier
publist_id: '2080'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal time bounds for some proximity problems in the plane
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 42
year: '1992'
...
---
_id: '4049'
abstract:
- lang: eng
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.
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.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Marshall
full_name: Bern, Marshall
last_name: Bern
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: David
full_name: Eppstein, David
last_name: Eppstein
- first_name: Stephen
full_name: Mitchell, Stephen
last_name: Mitchell
- first_name: Tiow
full_name: Tan, Tiow
last_name: Tan
citation:
ama: 'Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. Edge insertion for
optimal triangulations. In: Simon I, ed. 1st Latin American Symposium on Theoretical
Informatics. Vol 583. Springer; 1992:46-60. doi:10.1007/BFb0023816'
apa: 'Bern, M., Edelsbrunner, H., Eppstein, D., Mitchell, S., & Tan, T. (1992).
Edge insertion for optimal triangulations. In I. Simon (Ed.), 1st Latin American
Symposium on Theoretical Informatics (Vol. 583, pp. 46–60). São Paulo, Brazil:
Springer. https://doi.org/10.1007/BFb0023816'
chicago: Bern, Marshall, Herbert Edelsbrunner, David Eppstein, Stephen Mitchell,
and Tiow Tan. “Edge Insertion for Optimal Triangulations.” In 1st Latin American
Symposium on Theoretical Informatics, edited by Imre Simon, 583:46–60. Springer,
1992. https://doi.org/10.1007/BFb0023816.
ieee: M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, and T. Tan, “Edge insertion
for optimal triangulations,” in 1st Latin American Symposium on Theoretical
Informatics, São Paulo, Brazil, 1992, vol. 583, pp. 46–60.
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.'
mla: Bern, Marshall, et al. “Edge Insertion for Optimal Triangulations.” 1st
Latin American Symposium on Theoretical Informatics, edited by Imre Simon,
vol. 583, Springer, 1992, pp. 46–60, doi:10.1007/BFb0023816.
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.
conference:
end_date: 1992-04-10
location: São Paulo, Brazil
name: 'LATIN: Latin American Symposium on Theoretical Informatics '
start_date: 1992-04-06
date_created: 2018-12-11T12:06:38Z
date_published: 1992-04-07T00:00:00Z
date_updated: 2022-03-16T08:04:53Z
day: '07'
doi: 10.1007/BFb0023816
editor:
- first_name: Imre
full_name: Simon, Imre
last_name: Simon
extern: '1'
intvolume: ' 583'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007/BFb0023816
month: '04'
oa_version: None
page: 46 - 60
publication: 1st Latin American Symposium on Theoretical Informatics
publication_identifier:
isbn:
- 978-3-540-55284-0
publication_status: published
publisher: Springer
publist_id: '2076'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Edge insertion for optimal triangulations
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 583
year: '1992'
...
---
_id: '4050'
article_processing_charge: No
article_type: letter_note
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: Edelsbrunner H. Guest editor’s foreword. Discrete & Computational Geometry.
1992;8(1):217-217. doi:10.1007/BF02293046
apa: Edelsbrunner, H. (1992). Guest editor’s foreword. Discrete & Computational
Geometry. Springer. https://doi.org/10.1007/BF02293046
chicago: Edelsbrunner, Herbert. “Guest Editor’s Foreword.” Discrete & Computational
Geometry. Springer, 1992. https://doi.org/10.1007/BF02293046.
ieee: H. Edelsbrunner, “Guest editor’s foreword,” Discrete & Computational
Geometry, vol. 8, no. 1. Springer, pp. 217–217, 1992.
ista: Edelsbrunner H. 1992. Guest editor’s foreword. Discrete & Computational
Geometry. 8(1), 217–217.
mla: Edelsbrunner, Herbert. “Guest Editor’s Foreword.” Discrete & Computational
Geometry, vol. 8, no. 1, Springer, 1992, pp. 217–217, doi:10.1007/BF02293046.
short: H. Edelsbrunner, Discrete & Computational Geometry 8 (1992) 217–217.
date_created: 2018-12-11T12:06:39Z
date_published: 1992-08-01T00:00:00Z
date_updated: 2022-03-16T08:15:04Z
day: '01'
doi: 10.1007/BF02293046
extern: '1'
intvolume: ' 8'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF02293046
month: '08'
oa_version: None
page: 217 - 217
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '2077'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Guest editor's foreword
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 8
year: '1992'
...
---
_id: '4053'
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.
article_processing_charge: No
article_type: original
author:
- first_name: Boris
full_name: Aronov, Boris
last_name: Aronov
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Leonidas
full_name: Guibas, Leonidas
last_name: Guibas
- first_name: Micha
full_name: Sharir, Micha
last_name: Sharir
citation:
ama: Aronov B, Edelsbrunner H, Guibas L, Sharir M. The number of edges of many faces
in a line segment arrangement. Combinatorica. 1992;12(3):261-274. doi:10.1007/BF01285815
apa: Aronov, B., Edelsbrunner, H., Guibas, L., & Sharir, M. (1992). The number
of edges of many faces in a line segment arrangement. Combinatorica. Springer.
https://doi.org/10.1007/BF01285815
chicago: Aronov, Boris, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir.
“The Number of Edges of Many Faces in a Line Segment Arrangement.” Combinatorica.
Springer, 1992. https://doi.org/10.1007/BF01285815.
ieee: B. Aronov, H. Edelsbrunner, L. Guibas, and M. Sharir, “The number of edges
of many faces in a line segment arrangement,” Combinatorica, vol. 12, no.
3. Springer, pp. 261–274, 1992.
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.
mla: Aronov, Boris, et al. “The Number of Edges of Many Faces in a Line Segment
Arrangement.” Combinatorica, vol. 12, no. 3, Springer, 1992, pp. 261–74,
doi:10.1007/BF01285815.
short: B. Aronov, H. Edelsbrunner, L. Guibas, M. Sharir, Combinatorica 12 (1992)
261–274.
date_created: 2018-12-11T12:06:40Z
date_published: 1992-09-01T00:00:00Z
date_updated: 2022-03-15T15:44:26Z
day: '01'
doi: 10.1007/BF01285815
extern: '1'
intvolume: ' 12'
issue: '3'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF01285815
month: '09'
oa_version: None
page: 261 - 274
publication: Combinatorica
publication_identifier:
issn:
- 0209-9683
publication_status: published
publisher: Springer
publist_id: '2074'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The number of edges of many faces in a line segment arrangement
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 12
year: '1992'
...
---
_id: '4195'
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.
article_processing_charge: No
article_type: original
author:
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
- first_name: Hans
full_name: Thoenen, Hans
last_name: Thoenen
- first_name: Dan
full_name: Lindholm, Dan
last_name: Lindholm
citation:
ama: Heisenberg C-PJ, Thoenen H, Lindholm D. Triiodothyronine Regulates Survival
and Differentiation of Rat Cerebellar Granule Neurons. Neuroreport. 1992;3(8):685-688.
doi:10.1097/00001756-199208000-00008
apa: Heisenberg, C.-P. J., Thoenen, H., & Lindholm, D. (1992). Triiodothyronine
Regulates Survival and Differentiation of Rat Cerebellar Granule Neurons. Neuroreport.
Lippincott, Williams & Wilkins. https://doi.org/10.1097/00001756-199208000-00008
chicago: Heisenberg, Carl-Philipp J, Hans Thoenen, and Dan Lindholm. “Triiodothyronine
Regulates Survival and Differentiation of Rat Cerebellar Granule Neurons.” Neuroreport.
Lippincott, Williams & Wilkins, 1992. https://doi.org/10.1097/00001756-199208000-00008 .
ieee: C.-P. J. Heisenberg, H. Thoenen, and D. Lindholm, “Triiodothyronine Regulates
Survival and Differentiation of Rat Cerebellar Granule Neurons,” Neuroreport,
vol. 3, no. 8. Lippincott, Williams & Wilkins, pp. 685–688, 1992.
ista: Heisenberg C-PJ, Thoenen H, Lindholm D. 1992. Triiodothyronine Regulates Survival
and Differentiation of Rat Cerebellar Granule Neurons. Neuroreport. 3(8), 685–688.
mla: Heisenberg, Carl-Philipp J., et al. “Triiodothyronine Regulates Survival and
Differentiation of Rat Cerebellar Granule Neurons.” Neuroreport, vol. 3,
no. 8, Lippincott, Williams & Wilkins, 1992, pp. 685–88, doi:10.1097/00001756-199208000-00008 .
short: C.-P.J. Heisenberg, H. Thoenen, D. Lindholm, Neuroreport 3 (1992) 685–688.
date_created: 2018-12-11T12:07:31Z
date_published: 1992-01-01T00:00:00Z
date_updated: 2022-03-15T15:25:24Z
day: '01'
doi: '10.1097/00001756-199208000-00008 '
extern: '1'
external_id:
pmid:
- '1387811 '
intvolume: ' 3'
issue: '8'
language:
- iso: eng
main_file_link:
- url: https://journals.lww.com/neuroreport/abstract/1992/08000/tri_iodothyronine_regulates_survival_and.8.aspx
month: '01'
oa_version: None
page: 685 - 688
pmid: 1
publication: Neuroreport
publication_identifier:
eissn:
- 1473-558X
issn:
- 0959-4965
publication_status: published
publisher: Lippincott, Williams & Wilkins
publist_id: '1922'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Triiodothyronine Regulates Survival and Differentiation of Rat Cerebellar Granule
Neurons
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 3
year: '1992'
...
---
_id: '4305'
abstract:
- lang: eng
text: The common shrew (Sorex araneus) is subdivided into several karyotypic races
in Britain. Two of these races meet near Oxford to form the "Oxford-Hermitage"
hybrid zone. We present a model which describes this system as a "tension
zone," 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.
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. '
article_processing_charge: No
article_type: original
author:
- first_name: Todd
full_name: Hatfield, Todd
last_name: Hatfield
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Jeremy
full_name: Searle, Jeremy
last_name: Searle
citation:
ama: Hatfield T, Barton NH, Searle J. A model of a hybrid zone between two chromosomal
races of the common shrew (Sorex araneus). Evolution; International Journal
of Organic Evolution. 1992;46(4):1129-1145. doi:10.1111/j.1558-5646.1992.tb00624.x
apa: Hatfield, T., Barton, N. H., & 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. Wiley-Blackwell. https://doi.org/10.1111/j.1558-5646.1992.tb00624.x
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).” Evolution;
International Journal of Organic Evolution. Wiley-Blackwell, 1992. https://doi.org/10.1111/j.1558-5646.1992.tb00624.x.
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),” Evolution; International
Journal of Organic Evolution, vol. 46, no. 4. Wiley-Blackwell, pp. 1129–1145,
1992.
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.
mla: Hatfield, Todd, et al. “A Model of a Hybrid Zone between Two Chromosomal Races
of the Common Shrew (Sorex Araneus).” Evolution; International Journal of Organic
Evolution, vol. 46, no. 4, Wiley-Blackwell, 1992, pp. 1129–45, doi:10.1111/j.1558-5646.1992.tb00624.x.
short: T. Hatfield, N.H. Barton, J. Searle, Evolution; International Journal of
Organic Evolution 46 (1992) 1129–1145.
date_created: 2018-12-11T12:08:09Z
date_published: 1992-08-01T00:00:00Z
date_updated: 2022-03-15T14:49:26Z
day: '01'
doi: 10.1111/j.1558-5646.1992.tb00624.x
extern: '1'
external_id:
pmid:
- '28564402'
intvolume: ' 46'
issue: '4'
language:
- iso: eng
main_file_link:
- url: http://www.jstor.org/stable/2409761
month: '08'
oa_version: Published Version
page: 1129 - 1145
pmid: 1
publication: Evolution; International Journal of Organic Evolution
publication_identifier:
eissn:
- 1558-5646
issn:
- 0014-3820
publication_status: published
publisher: Wiley-Blackwell
publist_id: '1759'
quality_controlled: '1'
status: public
title: A model of a hybrid zone between two chromosomal races of the common shrew
(Sorex araneus)
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 46
year: '1992'
...
---
_id: '4306'
article_processing_charge: No
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Nick
full_name: Goldman, Nick
last_name: Goldman
citation:
ama: Barton NH, Goldman N. Genetics and geography. Nature. 1992;357:440-441.
doi:10.1038/357440a0
apa: Barton, N. H., & Goldman, N. (1992). Genetics and geography. Nature.
Nature Publishing Group. https://doi.org/10.1038/357440a0
chicago: Barton, Nicholas H, and Nick Goldman. “Genetics and Geography.” Nature.
Nature Publishing Group, 1992. https://doi.org/10.1038/357440a0.
ieee: N. H. Barton and N. Goldman, “Genetics and geography,” Nature, vol.
357. Nature Publishing Group, pp. 440–441, 1992.
ista: Barton NH, Goldman N. 1992. Genetics and geography. Nature. 357, 440–441.
mla: Barton, Nicholas H., and Nick Goldman. “Genetics and Geography.” Nature,
vol. 357, Nature Publishing Group, 1992, pp. 440–41, doi:10.1038/357440a0.
short: N.H. Barton, N. Goldman, Nature 357 (1992) 440–441.
date_created: 2018-12-11T12:08:10Z
date_published: 1992-06-11T00:00:00Z
date_updated: 2022-03-15T14:27:10Z
day: '11'
doi: 10.1038/357440a0
extern: '1'
intvolume: ' 357'
language:
- iso: eng
main_file_link:
- url: https://www.nature.com/articles/357440a0
month: '06'
oa_version: None
page: 440 - 441
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '1758'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Genetics and geography
type: review
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 357
year: '1992'
...
---
_id: '4307'
article_processing_charge: No
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: 'Barton NH. The genetic consequences of dispersal. In: Stenseth N, Lidicker
W, eds. Animal Dispersal: Small Mammals as a Model. Chapman Hall; 1992:37-60.
doi:10.1007/978-94-011-2338-9_3'
apa: 'Barton, N. H. (1992). The genetic consequences of dispersal. In N. Stenseth
& W. Lidicker (Eds.), Animal dispersal: small mammals as a model (pp.
37–60). Chapman Hall. https://doi.org/10.1007/978-94-011-2338-9_3'
chicago: 'Barton, Nicholas H. “The Genetic Consequences of Dispersal.” In Animal
Dispersal: Small Mammals as a Model, edited by Nils Stenseth and William Lidicker,
37–60. Chapman Hall, 1992. https://doi.org/10.1007/978-94-011-2338-9_3.'
ieee: 'N. H. Barton, “The genetic consequences of dispersal,” in Animal dispersal:
small mammals as a model, N. Stenseth and W. Lidicker, Eds. 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.'
mla: 'Barton, Nicholas H. “The Genetic Consequences of Dispersal.” Animal Dispersal:
Small Mammals as a Model, edited by Nils Stenseth and William Lidicker, Chapman
Hall, 1992, pp. 37–60, doi:10.1007/978-94-011-2338-9_3.'
short: 'N.H. Barton, in:, N. Stenseth, W. Lidicker (Eds.), Animal Dispersal: Small
Mammals as a Model, Chapman Hall, 1992, pp. 37–60.'
date_created: 2018-12-11T12:08:10Z
date_published: 1992-01-01T00:00:00Z
date_updated: 2022-03-14T14:19:36Z
day: '01'
doi: 10.1007/978-94-011-2338-9_3
editor:
- first_name: Nils
full_name: Stenseth, Nils
last_name: Stenseth
- first_name: William
full_name: Lidicker, William
last_name: Lidicker
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007/978-94-011-2338-9_3
month: '01'
oa_version: None
page: 37 - 60
publication: 'Animal dispersal: small mammals as a model'
publication_status: published
publisher: Chapman Hall
publist_id: '1757'
quality_controlled: '1'
status: public
title: The genetic consequences of dispersal
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1992'
...
---
_id: '4308'
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.
article_processing_charge: No
article_type: original
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Barton NH. On the spread of new gene combinations in the third phase of Wright’s
shifting balance. Evolution; International Journal of Organic Evolution.
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. Evolution; International Journal of Organic Evolution.
Wiley-Blackwell.
chicago: Barton, Nicholas H. “On the Spread of New Gene Combinations in the Third
Phase of Wright’s Shifting Balance.” Evolution; International Journal of Organic
Evolution. Wiley-Blackwell, 1992.
ieee: N. H. Barton, “On the spread of new gene combinations in the third phase of
Wright’s shifting balance,” Evolution; International Journal of Organic Evolution,
vol. 46, no. 2. Wiley-Blackwell, pp. 551–557, 1992.
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.
mla: Barton, Nicholas H. “On the Spread of New Gene Combinations in the Third Phase
of Wright’s Shifting Balance.” Evolution; International Journal of Organic
Evolution, vol. 46, no. 2, Wiley-Blackwell, 1992, pp. 551–57.
short: N.H. Barton, Evolution; International Journal of Organic Evolution 46 (1992)
551–557.
date_created: 2018-12-11T12:08:10Z
date_published: 1992-04-01T00:00:00Z
date_updated: 2022-03-14T13:36:15Z
day: '01'
extern: '1'
intvolume: ' 46'
issue: '2'
language:
- iso: eng
main_file_link:
- url: http://www.jstor.org/stable/2409871
month: '04'
oa_version: None
page: 551 - 557
publication: Evolution; International Journal of Organic Evolution
publication_identifier:
eissn:
- 1558-5646
issn:
- 0014-3820
publication_status: published
publisher: Wiley-Blackwell
publist_id: '1756'
quality_controlled: '1'
status: public
title: On the spread of new gene combinations in the third phase of Wright's shifting
balance
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 46
year: '1992'
...
---
_id: '4504'
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."
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"
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Zohar
full_name: Manna, Zohar
last_name: Manna
- first_name: Amir
full_name: Pnueli, Amir
last_name: Pnueli
citation:
ama: 'Henzinger TA, Manna Z, Pnueli A. What good are digital clocks? In: 19th
International Colloquium on Automata, Languages and Programming. Vol 623.
Springer; 1992:545-558. doi:10.1007/3-540-55719-9_103'
apa: 'Henzinger, T. A., Manna, Z., & Pnueli, A. (1992). What good are digital
clocks? In 19th International Colloquium on Automata, Languages and Programming
(Vol. 623, pp. 545–558). Vienna, Austria: Springer. https://doi.org/10.1007/3-540-55719-9_103'
chicago: Henzinger, Thomas A, Zohar Manna, and Amir Pnueli. “What Good Are Digital
Clocks?” In 19th International Colloquium on Automata, Languages and Programming,
623:545–58. Springer, 1992. https://doi.org/10.1007/3-540-55719-9_103.
ieee: T. A. Henzinger, Z. Manna, and A. Pnueli, “What good are digital clocks?,”
in 19th International Colloquium on Automata, Languages and Programming,
Vienna, Austria, 1992, vol. 623, pp. 545–558.
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.'
mla: Henzinger, Thomas A., et al. “What Good Are Digital Clocks?” 19th International
Colloquium on Automata, Languages and Programming, vol. 623, Springer, 1992,
pp. 545–58, doi:10.1007/3-540-55719-9_103.
short: T.A. Henzinger, Z. Manna, A. Pnueli, in:, 19th International Colloquium on
Automata, Languages and Programming, Springer, 1992, pp. 545–558.
conference:
end_date: 1992-07-17
location: Vienna, Austria
name: 'ICALP: Automata, Languages and Programming'
start_date: 1992-07-13
date_created: 2018-12-11T12:09:11Z
date_published: 1992-01-01T00:00:00Z
date_updated: 2022-03-14T09:47:09Z
day: '01'
doi: 10.1007/3-540-55719-9_103
extern: '1'
intvolume: ' 623'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007/3-540-55719-9_103
month: '01'
oa_version: None
page: 545 - 558
publication: 19th International Colloquium on Automata, Languages and Programming
publication_status: published
publisher: Springer
publist_id: '223'
quality_controlled: '1'
status: public
title: What good are digital clocks?
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 623
year: '1992'
...
---
_id: '4505'
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 "implementable"
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."
article_processing_charge: No
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Xavier
full_name: Nicollin, Xavier
last_name: Nicollin
- first_name: Joseph
full_name: Sifakis, Joseph
last_name: Sifakis
- first_name: Sergio
full_name: Yovine, Sergio
last_name: Yovine
citation:
ama: 'Henzinger TA, Nicollin X, Sifakis J, Yovine S. Symbolic model checking for
real-time systems. In: Proceedings of the 7th Annual IEEE Symposium on Logic
in Computer Science. IEEE; 1992:394-406. doi:10.1109/LICS.1992.185551'
apa: 'Henzinger, T. A., Nicollin, X., Sifakis, J., & Yovine, S. (1992). Symbolic
model checking for real-time systems. In Proceedings of the 7th Annual IEEE
Symposium on Logic in Computer Science (pp. 394–406). Santa Cruz, CA, United
States of America: IEEE. https://doi.org/10.1109/LICS.1992.185551'
chicago: Henzinger, Thomas A, Xavier Nicollin, Joseph Sifakis, and Sergio Yovine.
“Symbolic Model Checking for Real-Time Systems.” In Proceedings of the 7th
Annual IEEE Symposium on Logic in Computer Science, 394–406. IEEE, 1992. https://doi.org/10.1109/LICS.1992.185551.
ieee: T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, “Symbolic model checking
for real-time systems,” in Proceedings of the 7th Annual IEEE Symposium on
Logic in Computer Science, Santa Cruz, CA, United States of America, 1992,
pp. 394–406.
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.'
mla: Henzinger, Thomas A., et al. “Symbolic Model Checking for Real-Time Systems.”
Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science,
IEEE, 1992, pp. 394–406, doi:10.1109/LICS.1992.185551.
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.
conference:
end_date: 1992-06-25
location: Santa Cruz, CA, United States of America
name: 'LICS: Logic in Computer Science'
start_date: 1992-06-22
date_created: 2018-12-11T12:09:12Z
date_published: 1992-01-01T00:00:00Z
date_updated: 2022-03-14T13:20:50Z
day: '01'
doi: 10.1109/LICS.1992.185551
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/185551
month: '01'
oa_version: None
page: 394 - 406
publication: Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science
publication_identifier:
isbn:
- 0-8186-2735-2
publication_status: published
publisher: IEEE
publist_id: '224'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Symbolic model checking for real-time systems
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1992'
...
---
_id: '4507'
abstract:
- lang: eng
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.
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)'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Zohar
full_name: Manna, Zohar
last_name: Manna
- first_name: Amir
full_name: Pnueli, Amir
last_name: Pnueli
citation:
ama: 'Henzinger TA, Manna Z, Pnueli A. Timed transition systems. In: Real Time:
Theory in Practice. Vol 600. Springer; 1992:226-251. doi:10.1007/BFb0031995'
apa: 'Henzinger, T. A., Manna, Z., & Pnueli, A. (1992). Timed transition systems.
In Real Time: Theory in Practice (Vol. 600, pp. 226–251). Springer. https://doi.org/10.1007/BFb0031995'
chicago: 'Henzinger, Thomas A, Zohar Manna, and Amir Pnueli. “Timed Transition Systems.”
In Real Time: Theory in Practice, 600:226–51. Springer, 1992. https://doi.org/10.1007/BFb0031995.'
ieee: 'T. A. Henzinger, Z. Manna, and A. Pnueli, “Timed transition systems,” in
Real Time: Theory in Practice, vol. 600, Springer, 1992, pp. 226–251.'
ista: 'Henzinger TA, Manna Z, Pnueli A. 1992.Timed transition systems. In: Real
Time: Theory in Practice. LNCS, vol. 600, 226–251.'
mla: 'Henzinger, Thomas A., et al. “Timed Transition Systems.” Real Time: Theory
in Practice, vol. 600, Springer, 1992, pp. 226–51, doi:10.1007/BFb0031995.'
short: 'T.A. Henzinger, Z. Manna, A. Pnueli, in:, Real Time: Theory in Practice,
Springer, 1992, pp. 226–251.'
date_created: 2018-12-11T12:09:12Z
date_published: 1992-01-01T00:00:00Z
date_updated: 2022-03-14T09:34:44Z
day: '01'
doi: 10.1007/BFb0031995
extern: '1'
intvolume: ' 600'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007/BFb0031995
month: '01'
oa_version: None
page: 226 - 251
publication: 'Real Time: Theory in Practice'
publication_status: published
publisher: Springer
publist_id: '222'
status: public
title: Timed transition systems
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 600
year: '1992'
...
---
_id: '4517'
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.
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. '
article_processing_charge: No
article_type: original
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: Henzinger TA. Sooner Is Safer Than Later. Information Processing Letters.
1992;43(3):135-141. doi:10.1016/0020-0190(92)90005-G
apa: Henzinger, T. A. (1992). Sooner Is Safer Than Later. Information Processing
Letters. Elsevier. https://doi.org/10.1016/0020-0190(92)90005-G
chicago: Henzinger, Thomas A. “Sooner Is Safer Than Later.” Information Processing
Letters. Elsevier, 1992. https://doi.org/10.1016/0020-0190(92)90005-G.
ieee: T. A. Henzinger, “Sooner Is Safer Than Later,” Information Processing Letters,
vol. 43, no. 3. Elsevier, pp. 135–141, 1992.
ista: Henzinger TA. 1992. Sooner Is Safer Than Later. Information Processing Letters.
43(3), 135–141.
mla: Henzinger, Thomas A. “Sooner Is Safer Than Later.” Information Processing
Letters, vol. 43, no. 3, Elsevier, 1992, pp. 135–41, doi:10.1016/0020-0190(92)90005-G.
short: T.A. Henzinger, Information Processing Letters 43 (1992) 135–141.
date_created: 2018-12-11T12:09:16Z
date_published: 1992-09-14T00:00:00Z
date_updated: 2022-03-07T11:31:23Z
day: '14'
doi: 10.1016/0020-0190(92)90005-G
extern: '1'
intvolume: ' 43'
issue: '3'
language:
- iso: eng
main_file_link:
- url: https://www.sciencedirect.com/science/article/pii/002001909290005G?via%3Dihub
month: '09'
oa_version: None
page: 135 - 141
publication: Information Processing Letters
publication_identifier:
issn:
- 0020-0190
publication_status: published
publisher: Elsevier
publist_id: '211'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sooner Is Safer Than Later
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 43
year: '1992'
...