---
_id: '4596'
abstract:
- lang: eng
  text: A real-time temporal logic for the specification of reactive systems is introduced.
    The novel feature of the logic, TPTL, is the adoption of temporal operators as
    quantifiers over time variables; every modality binds a variable to the time(s)
    it refers to. TPTL is demonstrated to be both a natural specification language
    and a suitable formalism for verification and synthesis. A tableau-based decision
    procedure and model-checking algorithm for TPTL are presented. Several generalizations
    of TPTL are shown to be highly undecidable.
acknowledgement: 'We thank Zohar Manna, Amir Pnueli, and David Dill for their guidance.
  Moshe Vardi and Joe Halpern gave us very helpful advice for refilling our undecidability
  results. '
article_processing_charge: No
author:
- first_name: Rajeev
  full_name: Alur, Rajeev
  last_name: Alur
- 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: 'Alur R, Henzinger TA. A really temporal logic. In: <i>30th Annual Symposium
    on Foundations of Computer Science</i>. FCOS. IEEE; 1989:164-169. doi:<a href="https://doi.org/10.1109/SFCS.1989.63473">10.1109/SFCS.1989.63473</a>'
  apa: 'Alur, R., &#38; Henzinger, T. A. (1989). A really temporal logic. In <i>30th
    Annual Symposium on Foundations of Computer Science</i> (pp. 164–169). Research
    Triangle Park, NC, USA: IEEE. <a href="https://doi.org/10.1109/SFCS.1989.63473">https://doi.org/10.1109/SFCS.1989.63473</a>'
  chicago: Alur, Rajeev, and Thomas A Henzinger. “A Really Temporal Logic.” In <i>30th
    Annual Symposium on Foundations of Computer Science</i>, 164–69. FCOS. IEEE, 1989.
    <a href="https://doi.org/10.1109/SFCS.1989.63473">https://doi.org/10.1109/SFCS.1989.63473</a>.
  ieee: R. Alur and T. A. Henzinger, “A really temporal logic,” in <i>30th Annual
    Symposium on Foundations of Computer Science</i>, Research Triangle Park, NC,
    USA, 1989, pp. 164–169.
  ista: 'Alur R, Henzinger TA. 1989. A really temporal logic. 30th Annual Symposium
    on Foundations of Computer Science. FOCS: Foundations of Computer ScienceFCOS,
    164–169.'
  mla: Alur, Rajeev, and Thomas A. Henzinger. “A Really Temporal Logic.” <i>30th Annual
    Symposium on Foundations of Computer Science</i>, IEEE, 1989, pp. 164–69, doi:<a
    href="https://doi.org/10.1109/SFCS.1989.63473">10.1109/SFCS.1989.63473</a>.
  short: R. Alur, T.A. Henzinger, in:, 30th Annual Symposium on Foundations of Computer
    Science, IEEE, 1989, pp. 164–169.
conference:
  end_date: 1989-11-01
  location: Research Triangle Park, NC, USA
  name: 'FOCS: Foundations of Computer Science'
  start_date: 1989-10-30
date_created: 2018-12-11T12:09:40Z
date_published: 1989-01-01T00:00:00Z
date_updated: 2022-02-09T10:40:13Z
day: '01'
doi: 10.1109/SFCS.1989.63473
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/63473
month: '01'
oa_version: None
page: 164 - 169
publication: 30th Annual Symposium on Foundations of Computer Science
publication_identifier:
  eissn:
  - 1558-0814
  isbn:
  - 0-8186-1982-1
  issn:
  - 0018-9162
publication_status: published
publisher: IEEE
publist_id: '111'
quality_controlled: '1'
series_title: FCOS
status: public
title: A really temporal logic
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1989'
...
---
_id: '4128'
abstract:
- lang: eng
  text: A generalization of the convex hull of a finite set of points in the plane
    is introduced and analyzed. This generalization leads to a family of straight-line
    graphs, " \alpha -shapes," which seem to capture the intuitive notions of "fine
    shape" and "crude shape" of point sets. It is shown that a-shapes are subgraphs
    of the closest point or furthest point Delaunay triangulation. Relying on this
    result an optimal O(n \log n) algorithm that constructs \alpha -shapes is developed.
acknowledgement: "The authors express their appreciation for numerous constructive
  suggestions, which led to improvements on\r\nvarious phases of the manuscript, to
  Dr. Marvin Simon of JPL and to Professor George L. Turin of University of\r\nCalifornia,
  Berkeley. The junior author also gratefully acknowledges the role of the latter
  as her M.S. research\r\nadvisor on the project which formed the nucleus of this
  work. \r\n"
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: David
  full_name: Kirkpatrick, David
  last_name: Kirkpatrick
- first_name: Raimund
  full_name: Seidel, Raimund
  last_name: Seidel
citation:
  ama: Edelsbrunner H, Kirkpatrick D, Seidel R. On the shape of a set of points in
    the plane. <i>IEEE Transactions on Information Theory</i>. 1983;29(4):551-559.
    doi:<a href="https://doi.org/10.1109/TIT.1983.1056714 ">10.1109/TIT.1983.1056714
    </a>
  apa: Edelsbrunner, H., Kirkpatrick, D., &#38; Seidel, R. (1983). On the shape of
    a set of points in the plane. <i>IEEE Transactions on Information Theory</i>.
    IEEE. <a href="https://doi.org/10.1109/TIT.1983.1056714 ">https://doi.org/10.1109/TIT.1983.1056714
    </a>
  chicago: Edelsbrunner, Herbert, David Kirkpatrick, and Raimund Seidel. “On the Shape
    of a Set of Points in the Plane.” <i>IEEE Transactions on Information Theory</i>.
    IEEE, 1983. <a href="https://doi.org/10.1109/TIT.1983.1056714 ">https://doi.org/10.1109/TIT.1983.1056714
    </a>.
  ieee: H. Edelsbrunner, D. Kirkpatrick, and R. Seidel, “On the shape of a set of
    points in the plane,” <i>IEEE Transactions on Information Theory</i>, vol. 29,
    no. 4. IEEE, pp. 551–559, 1983.
  ista: Edelsbrunner H, Kirkpatrick D, Seidel R. 1983. On the shape of a set of points
    in the plane. IEEE Transactions on Information Theory. 29(4), 551–559.
  mla: Edelsbrunner, Herbert, et al. “On the Shape of a Set of Points in the Plane.”
    <i>IEEE Transactions on Information Theory</i>, vol. 29, no. 4, IEEE, 1983, pp.
    551–59, doi:<a href="https://doi.org/10.1109/TIT.1983.1056714 ">10.1109/TIT.1983.1056714
    </a>.
  short: H. Edelsbrunner, D. Kirkpatrick, R. Seidel, IEEE Transactions on Information
    Theory 29 (1983) 551–559.
date_created: 2018-12-11T12:07:06Z
date_published: 1983-06-01T00:00:00Z
date_updated: 2022-01-25T12:55:07Z
day: '01'
doi: '10.1109/TIT.1983.1056714 '
extern: '1'
intvolume: '        29'
issue: '4'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/1056714
month: '06'
oa_version: None
page: 551 - 559
publication: IEEE Transactions on Information Theory
publication_identifier:
  eissn:
  - 1558-0814
  issn:
  - 0018-9162
publication_status: published
publisher: IEEE
publist_id: '1995'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the shape of a set of points in the plane
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 29
year: '1983'
...