---
_id: '4017'
abstract:
- lang: eng
text: Identification and size characterization of surface pockets and occluded cavities
are initial steps in protein structure-based ligand design. A new program, CAST,
for automatically locating and measuring protein pockets and cavities, is based
on precise computational geometry methods, including alpha shape and discrete
flow theory. CAST identifies and measures pockets and pocket mouth openings, as
well as cavities. The program specifies the atoms lining pockets, pocket openings.
and buried cavities; the volume and area of pockets and cavities; and the area
and circumference of mouth openings. CAST analysis of over 100 proteins has been
carried out; proteins examined include a set of 51 monomeric enzyme-ligand structures,
several elastase-inhibitor complexes, the FK506 binding protein, 30 HIV-1 protease-inhibitor
complexes, and a number of small and large protein inhibitors, Medium-sized globular
proteins typically have 10-20 pockets/cavities. Most often, binding sites are
pockets with 1-2 mouth openings; much less frequently they are cavities. Ligand
binding pockets vary widely in size, most within the range 10(2)-10(3) Angstrom(3).
Statistical analysis reveals that the number of pockets and cavities is correlated
with protein size, but there is no correlation between the size of the protein
and the size of binding sites. Most frequently, the largest pocket/cavity is thp
active site, but there are a number of instructive exceptions. Ligand volume and
binding site volume are somewhat correlated when binding site volume is less than
or equal to 700 Angstrom(3), but the ligand seldom occupies the entire site. Auxiliary
pockets near the active site have been suggested as additional binding surface
for designed ligands (Mattos C ct al., 1993, Nat Struct Biol 1:55-58). Analysis
of elastase-inhibitor complexes suggests that CAST can identify ancillary pockets,
suitable for recruitment in ligand design strategies. Analysis of the FK506 binding
protein, and of compounds developed in SAR by NMR (Shuker SE et al.. 1996, Science
274:1531-1534), indicates that CAST pocket computation may provide a priori identification
of target proteins for Linked-fragment design. CAST analysis of 30 HIV-1 protease-inhibitor
complexes shows that the flexible active site pocket can vary over a range of
853-1,566 Angstrom(3), and that there are two pockets near or adjoining the active
site that may be recruited for ligand design.
article_processing_charge: No
article_type: original
author:
- first_name: Jie
full_name: Liang, Jie
last_name: Liang
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Clare
full_name: Woodward, Clare
last_name: Woodward
citation:
ama: 'Liang J, Edelsbrunner H, Woodward C. Anatomy of protein pockets and cavities:
Measurement of binding site geometry and implications for ligand design. Protein
Science. 1998;7(9):1884-1897. doi:10.1002/pro.5560070905'
apa: 'Liang, J., Edelsbrunner, H., & Woodward, C. (1998). Anatomy of protein
pockets and cavities: Measurement of binding site geometry and implications for
ligand design. Protein Science. Wiley-Blackwell. https://doi.org/10.1002/pro.5560070905'
chicago: 'Liang, Jie, Herbert Edelsbrunner, and Clare Woodward. “Anatomy of Protein
Pockets and Cavities: Measurement of Binding Site Geometry and Implications for
Ligand Design.” Protein Science. Wiley-Blackwell, 1998. https://doi.org/10.1002/pro.5560070905.'
ieee: 'J. Liang, H. Edelsbrunner, and C. Woodward, “Anatomy of protein pockets and
cavities: Measurement of binding site geometry and implications for ligand design,”
Protein Science, vol. 7, no. 9. Wiley-Blackwell, pp. 1884–1897, 1998.'
ista: 'Liang J, Edelsbrunner H, Woodward C. 1998. Anatomy of protein pockets and
cavities: Measurement of binding site geometry and implications for ligand design.
Protein Science. 7(9), 1884–1897.'
mla: 'Liang, Jie, et al. “Anatomy of Protein Pockets and Cavities: Measurement of
Binding Site Geometry and Implications for Ligand Design.” Protein Science,
vol. 7, no. 9, Wiley-Blackwell, 1998, pp. 1884–97, doi:10.1002/pro.5560070905.'
short: J. Liang, H. Edelsbrunner, C. Woodward, Protein Science 7 (1998) 1884–1897.
date_created: 2018-12-11T12:06:27Z
date_published: 1998-09-01T00:00:00Z
date_updated: 2022-08-25T12:49:41Z
day: '01'
doi: 10.1002/pro.5560070905
extern: '1'
external_id:
pmid:
- '9761470 '
intvolume: ' 7'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2144175/
month: '09'
oa: 1
oa_version: Published Version
page: 1884 - 1897
pmid: 1
publication: Protein Science
publication_identifier:
issn:
- 0961-8368
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2111'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Anatomy of protein pockets and cavities: Measurement of binding site geometry
and implications for ligand design'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 7
year: '1998'
...
---
_id: '4019'
abstract:
- lang: eng
text: 'The construction of shape spaces is studied from a mathematical and a computational
viewpoint. A program is outlined reducing the problem to four tasks: the representation
of geometry, the canonical deformation of geometry, the measuring of distance
in shape space, and the selection of base shapes. The technical part of this paper
focuses on the second task: the specification of a deformation mixing two or more
shapes in continuously, changing proportions.'
acknowledgement: This research is partially supported by the National Science Foundation
under grants CCR-96-19542 and CCR-97-12088, and by the Army Research O*ce under
grant DAAG55-98-1-0177.
article_processing_charge: No
author:
- first_name: Ho
full_name: Cheng, Ho
last_name: Cheng
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Ping
full_name: Fu, Ping
last_name: Fu
citation:
ama: 'Cheng H, Edelsbrunner H, Fu P. Shape space from deformation. In: Proceedings
of the 6th Pacific Conference on Computer Graphics and Applications. IEEE;
1998:104-113. doi:10.1109/PCCGA.1998.732056'
apa: 'Cheng, H., Edelsbrunner, H., & Fu, P. (1998). Shape space from deformation.
In Proceedings of the 6th Pacific Conference on Computer Graphics and Applications
(pp. 104–113). Singapore: IEEE. https://doi.org/10.1109/PCCGA.1998.732056'
chicago: Cheng, Ho, Herbert Edelsbrunner, and Ping Fu. “Shape Space from Deformation.”
In Proceedings of the 6th Pacific Conference on Computer Graphics and Applications,
104–13. IEEE, 1998. https://doi.org/10.1109/PCCGA.1998.732056.
ieee: H. Cheng, H. Edelsbrunner, and P. Fu, “Shape space from deformation,” in Proceedings
of the 6th Pacific Conference on Computer Graphics and Applications, Singapore,
1998, pp. 104–113.
ista: 'Cheng H, Edelsbrunner H, Fu P. 1998. Shape space from deformation. Proceedings
of the 6th Pacific Conference on Computer Graphics and Applications. CGA: Conference
on Computer Graphics and Applications , 104–113.'
mla: Cheng, Ho, et al. “Shape Space from Deformation.” Proceedings of the 6th
Pacific Conference on Computer Graphics and Applications, IEEE, 1998, pp.
104–13, doi:10.1109/PCCGA.1998.732056.
short: H. Cheng, H. Edelsbrunner, P. Fu, in:, Proceedings of the 6th Pacific Conference
on Computer Graphics and Applications, IEEE, 1998, pp. 104–113.
conference:
end_date: 1998-10-29
location: Singapore
name: 'CGA: Conference on Computer Graphics and Applications '
start_date: 1998-10-26
date_created: 2018-12-11T12:06:28Z
date_published: 1998-10-01T00:00:00Z
date_updated: 2022-08-25T12:06:20Z
day: '01'
doi: 10.1109/PCCGA.1998.732056
extern: '1'
language:
- iso: eng
month: '10'
oa_version: None
page: 104 - 113
publication: Proceedings of the 6th Pacific Conference on Computer Graphics and Applications
publication_identifier:
isbn:
- '0818686200'
publication_status: published
publisher: IEEE
publist_id: '2107'
quality_controlled: '1'
status: public
title: Shape space from deformation
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1998'
...
---
_id: '4020'
abstract:
- lang: eng
text: Space Filing diagrams are geometric models of molecular conformations in three-dimensional
space. Each atom is a location is space and a quantitative expression of influence
on the immediate surrounding. This paper surveys the basic types of space filling
diagrams with a focus on the dual alpha shape. Properties of those diagrams that
relate to questions of connectivity, size, shape and symmetry, and metamorphosis
are discussed.
article_processing_charge: No
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. Geometry for modeling biomolecules. In: Robotics: The Algorithmic
Perspective. AK Peters; 1998:265-277.'
apa: 'Edelsbrunner, H. (1998). Geometry for modeling biomolecules. In Robotics:
The Algorithmic Perspective (pp. 265–277). AK Peters.'
chicago: 'Edelsbrunner, Herbert. “Geometry for Modeling Biomolecules.” In Robotics:
The Algorithmic Perspective, 265–77. AK Peters, 1998.'
ieee: 'H. Edelsbrunner, “Geometry for modeling biomolecules,” in Robotics: The
Algorithmic Perspective, AK Peters, 1998, pp. 265–277.'
ista: 'Edelsbrunner H. 1998.Geometry for modeling biomolecules. In: Robotics: The
Algorithmic Perspective. , 265–277.'
mla: 'Edelsbrunner, Herbert. “Geometry for Modeling Biomolecules.” Robotics:
The Algorithmic Perspective, AK Peters, 1998, pp. 265–77.'
short: 'H. Edelsbrunner, in:, Robotics: The Algorithmic Perspective, AK Peters,
1998, pp. 265–277.'
date_created: 2018-12-11T12:06:28Z
date_published: 1998-10-01T00:00:00Z
date_updated: 2022-08-25T12:12:04Z
day: '01'
extern: '1'
language:
- iso: eng
month: '10'
oa_version: None
page: 265 - 277
publication: 'Robotics: The Algorithmic Perspective'
publication_identifier:
isbn:
- '9781568810812'
publication_status: published
publisher: AK Peters
publist_id: '2108'
quality_controlled: '1'
status: public
title: Geometry for modeling biomolecules
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1998'
...
---
_id: '4280'
article_processing_charge: No
article_type: original
author:
- first_name: Mike
full_name: Ritchie, Mike
last_name: Ritchie
- 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: 'Ritchie M, Barton NH. Hybrids and hybrid zones: Reply from M.G. Ritchie and
N.H. Barton. Trends in Ecology and Evolution. 1998;13(7):282-283. doi:10.1016/S0169-5347(98)01396-2'
apa: 'Ritchie, M., & Barton, N. H. (1998). Hybrids and hybrid zones: Reply from
M.G. Ritchie and N.H. Barton. Trends in Ecology and Evolution. Cell Press.
https://doi.org/10.1016/S0169-5347(98)01396-2'
chicago: 'Ritchie, Mike, and Nicholas H Barton. “Hybrids and Hybrid Zones: Reply
from M.G. Ritchie and N.H. Barton.” Trends in Ecology and Evolution. Cell
Press, 1998. https://doi.org/10.1016/S0169-5347(98)01396-2.'
ieee: 'M. Ritchie and N. H. Barton, “Hybrids and hybrid zones: Reply from M.G. Ritchie
and N.H. Barton,” Trends in Ecology and Evolution, vol. 13, no. 7. Cell
Press, pp. 282–283, 1998.'
ista: 'Ritchie M, Barton NH. 1998. Hybrids and hybrid zones: Reply from M.G. Ritchie
and N.H. Barton. Trends in Ecology and Evolution. 13(7), 282–283.'
mla: 'Ritchie, Mike, and Nicholas H. Barton. “Hybrids and Hybrid Zones: Reply from
M.G. Ritchie and N.H. Barton.” Trends in Ecology and Evolution, vol. 13,
no. 7, Cell Press, 1998, pp. 282–83, doi:10.1016/S0169-5347(98)01396-2.'
short: M. Ritchie, N.H. Barton, Trends in Ecology and Evolution 13 (1998) 282–283.
date_created: 2018-12-11T12:08:01Z
date_published: 1998-07-01T00:00:00Z
date_updated: 2022-08-25T11:56:08Z
day: '01'
doi: 10.1016/S0169-5347(98)01396-2
extern: '1'
external_id:
pmid:
- '21238302'
intvolume: ' 13'
issue: '7'
language:
- iso: eng
month: '07'
oa_version: None
page: 282 - 283
pmid: 1
publication: Trends in Ecology and Evolution
publication_identifier:
issn:
- 0169-5347
publication_status: published
publisher: Cell Press
publist_id: '1806'
quality_controlled: '1'
status: public
title: 'Hybrids and hybrid zones: Reply from M.G. Ritchie and N.H. Barton'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 13
year: '1998'
...
---
_id: '4281'
abstract:
- lang: eng
text: 'Most higher organisms reproduce sexually, despite the automatic reproductive
advantage experienced by asexual variants. This implies the operation of selective
forces that confer an advantage to sexuality and genetic recombination, at either
the population or individual level. The effect of sex and recombination in breaking
down negative correlations between favorable variants at different genetic loci,
which increases the efficiency of natural selection, is likely to be a major factor
favoring their evolution and maintenance. Various processes that can cause such
an effect have been studied theoretically. It has, however, so far proved hard
to discriminate among them empirically. '
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
- first_name: Brian
full_name: Charlesworth, Brian
last_name: Charlesworth
citation:
ama: Barton NH, Charlesworth B. Why sex and recombination? Science. 1998;281(5385):1986-1990.
doi:10.1126/science.281.5385.1986
apa: Barton, N. H., & Charlesworth, B. (1998). Why sex and recombination? Science.
American Association for the Advancement of Science. https://doi.org/10.1126/science.281.5385.1986
chicago: Barton, Nicholas H, and Brian Charlesworth. “Why Sex and Recombination?”
Science. American Association for the Advancement of Science, 1998. https://doi.org/10.1126/science.281.5385.1986.
ieee: N. H. Barton and B. Charlesworth, “Why sex and recombination?,” Science,
vol. 281, no. 5385. American Association for the Advancement of Science, pp. 1986–1990,
1998.
ista: Barton NH, Charlesworth B. 1998. Why sex and recombination? Science. 281(5385),
1986–1990.
mla: Barton, Nicholas H., and Brian Charlesworth. “Why Sex and Recombination?” Science,
vol. 281, no. 5385, American Association for the Advancement of Science, 1998,
pp. 1986–90, doi:10.1126/science.281.5385.1986.
short: N.H. Barton, B. Charlesworth, Science 281 (1998) 1986–1990.
date_created: 2018-12-11T12:08:01Z
date_published: 1998-09-25T00:00:00Z
date_updated: 2022-08-25T11:53:29Z
day: '25'
doi: 10.1126/science.281.5385.1986
extern: '1'
external_id:
pmid:
- '9748151'
intvolume: ' 281'
issue: '5385'
language:
- iso: eng
month: '09'
oa_version: None
page: 1986 - 1990
pmid: 1
publication: Science
publication_identifier:
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '1804'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Why sex and recombination?
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 281
year: '1998'
...
---
_id: '4282'
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. Genetics and analysis of quantitative traits. Genetical Research.
1998;72(1):73-73. doi:10.1017/S0016672398219732
apa: Barton, N. H. (1998). Genetics and analysis of quantitative traits. Genetical
Research. Cambridge University Press. https://doi.org/10.1017/S0016672398219732
chicago: Barton, Nicholas H. “Genetics and Analysis of Quantitative Traits.” Genetical
Research. Cambridge University Press, 1998. https://doi.org/10.1017/S0016672398219732.
ieee: N. H. Barton, “Genetics and analysis of quantitative traits,” Genetical
Research, vol. 72, no. 1. Cambridge University Press, pp. 73–73, 1998.
ista: Barton NH. 1998. Genetics and analysis of quantitative traits. Genetical Research.
72(1), 73–73.
mla: Barton, Nicholas H. “Genetics and Analysis of Quantitative Traits.” Genetical
Research, vol. 72, no. 1, Cambridge University Press, 1998, pp. 73–73, doi:10.1017/S0016672398219732.
short: N.H. Barton, Genetical Research 72 (1998) 73–73.
date_created: 2018-12-11T12:08:01Z
date_published: 1998-08-01T00:00:00Z
date_updated: 2022-08-24T13:36:46Z
day: '01'
doi: 10.1017/S0016672398219732
extern: '1'
intvolume: ' 72'
issue: '1'
language:
- iso: eng
month: '08'
oa_version: None
page: 73 - 73
publication: Genetical Research
publication_identifier:
issn:
- 0016-6723
publication_status: published
publisher: Cambridge University Press
publist_id: '1801'
status: public
title: Genetics and analysis of quantitative traits
type: review
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 72
year: '1998'
...
---
_id: '4283'
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 geometry of adaptation. Nature. 1998;395(6704):751-752.
doi:10.1038/27338
apa: Barton, N. H. (1998). The geometry of adaptation. Nature. Nature Publishing
Group. https://doi.org/10.1038/27338
chicago: Barton, Nicholas H. “The Geometry of Adaptation.” Nature. Nature
Publishing Group, 1998. https://doi.org/10.1038/27338.
ieee: N. H. Barton, “The geometry of adaptation,” Nature, vol. 395, no. 6704.
Nature Publishing Group, pp. 751–752, 1998.
ista: Barton NH. 1998. The geometry of adaptation. Nature. 395(6704), 751–752.
mla: Barton, Nicholas H. “The Geometry of Adaptation.” Nature, vol. 395,
no. 6704, Nature Publishing Group, 1998, pp. 751–52, doi:10.1038/27338.
short: N.H. Barton, Nature 395 (1998) 751–752.
date_created: 2018-12-11T12:08:02Z
date_published: 1998-10-01T00:00:00Z
date_updated: 2022-08-24T13:50:49Z
day: '01'
doi: 10.1038/27338
extern: '1'
intvolume: ' 395'
issue: '6704'
language:
- iso: eng
month: '10'
oa_version: None
page: 751 - 752
publication: Nature
publication_identifier:
issn:
- 0028-0836
publication_status: published
publisher: Nature Publishing Group
publist_id: '1802'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The geometry of adaptation
type: review
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 395
year: '1998'
...
---
_id: '4408'
abstract:
- lang: eng
text: 'This paper presents a complete axiomatization of fully decidable propositional
real-time linear temporal logics with past: the Event Clock Logic (ECL) and the
Metric Interval Temporal Logic with past (MITL). The completeness proof consists
of an effective proof building procedure for ECL. From this result we obtain a
complete axiomatization of MITL by providing axioms translating MITL formulae
into ECL formulae, the two logics being equally expressive. Our proof is structured
to yield a similar axiomatization and procedure for interesting fragments of these
logics, such as the linear temporal logic of the real numbers (LTR).'
acknowledgement: This work is supported in part by the ONR YIP award N00014-95-1-0520,
by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the DARPA/NASA
grant NAG2-1214, by the ARO MURI grant DAAH-04-96-1-0341, by the SRC contract 97-DC-324.041,
the Belgian National Fund for Scientific Research (FNRS), the European Commission
under WGs Aspire and Fireworks, the Portuguese FCT, and by Belgacom.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Jean
full_name: Raskin, Jean
last_name: Raskin
- first_name: Pierre
full_name: Schobbens, Pierre
last_name: Schobbens
- 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: 'Raskin J, Schobbens P, Henzinger TA. Axioms for real-time logics. In: Proceedings
of the 9th Interantional Conference on Concurrency Theory. Vol 1466. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 1998:219-236. doi:10.1007/BFb0055625'
apa: 'Raskin, J., Schobbens, P., & Henzinger, T. A. (1998). Axioms for real-time
logics. In Proceedings of the 9th Interantional Conference on Concurrency Theory
(Vol. 1466, pp. 219–236). Nice, France: Schloss Dagstuhl - Leibniz-Zentrum für
Informatik. https://doi.org/10.1007/BFb0055625'
chicago: Raskin, Jean, Pierre Schobbens, and Thomas A Henzinger. “Axioms for Real-Time
Logics.” In Proceedings of the 9th Interantional Conference on Concurrency
Theory, 1466:219–36. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998.
https://doi.org/10.1007/BFb0055625.
ieee: J. Raskin, P. Schobbens, and T. A. Henzinger, “Axioms for real-time logics,”
in Proceedings of the 9th Interantional Conference on Concurrency Theory,
Nice, France, 1998, vol. 1466, pp. 219–236.
ista: 'Raskin J, Schobbens P, Henzinger TA. 1998. Axioms for real-time logics. Proceedings
of the 9th Interantional Conference on Concurrency Theory. CONCUR: Concurrency
Theory, LNCS, vol. 1466, 219–236.'
mla: Raskin, Jean, et al. “Axioms for Real-Time Logics.” Proceedings of the 9th
Interantional Conference on Concurrency Theory, vol. 1466, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 1998, pp. 219–36, doi:10.1007/BFb0055625.
short: J. Raskin, P. Schobbens, T.A. Henzinger, in:, Proceedings of the 9th Interantional
Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
1998, pp. 219–236.
conference:
end_date: 1998-09-11
location: Nice, France
name: 'CONCUR: Concurrency Theory'
start_date: 1998-09-08
date_created: 2018-12-11T12:08:42Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-24T12:15:17Z
day: '01'
doi: 10.1007/BFb0055625
extern: '1'
intvolume: ' 1466'
language:
- iso: eng
month: '01'
oa_version: None
page: 219 - 236
publication: Proceedings of the 9th Interantional Conference on Concurrency Theory
publication_identifier:
isbn:
- '9783540648963'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '323'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Axioms for real-time logics
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1466
year: '1998'
...
---
_id: '4410'
abstract:
- lang: eng
text: "Rectangular automata are well suited for approximate modeling of continuous-discrete
systems. The exact analysis of these automata is feasible for small examples but
can encounter severe numerical problems for even medium-sized systems. This paper
presents an analysis algorithm that uses conservative overapproximation to avoid
these numerical problems. The algorithm is demonstrated on a simple benchmark
system consisting of two connected tanks.\r\nSupported by the German Research
Council (DFG) under grant Ko1430/3 in the special program KONDISK (‘Continuous-discrete
dynamics of technical systems’)."
acknowledgement: This research was supported in part by the ONR YIP award N00014-95-1-0520,
by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the DARPA/NASA
grant NAG2-1214, by the ARO MURI grant DAAH-04-96-1-0341, and by the SRC contract
97-DC-324.041.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Jörg
full_name: Preußig, Jörg
last_name: Preußig
- first_name: Stefan
full_name: Kowalewski, Stefan
last_name: Kowalewski
- first_name: Howard
full_name: Wong Toi, Howard
last_name: Wong Toi
- 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: 'Preußig J, Kowalewski S, Wong Toi H, Henzinger TA. An algorithm for the approximative
analysis of rectangular automata. In: Proceedings of the 5th International
Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems. Vol
1486. Springer; 1998:228-240. doi:10.1007/BFb0055350'
apa: 'Preußig, J., Kowalewski, S., Wong Toi, H., & Henzinger, T. A. (1998).
An algorithm for the approximative analysis of rectangular automata. In Proceedings
of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant
Systems (Vol. 1486, pp. 228–240). Lyngby, Denmark: Springer. https://doi.org/10.1007/BFb0055350'
chicago: Preußig, Jörg, Stefan Kowalewski, Howard Wong Toi, and Thomas A Henzinger.
“An Algorithm for the Approximative Analysis of Rectangular Automata.” In Proceedings
of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant
Systems, 1486:228–40. Springer, 1998. https://doi.org/10.1007/BFb0055350.
ieee: J. Preußig, S. Kowalewski, H. Wong Toi, and T. A. Henzinger, “An algorithm
for the approximative analysis of rectangular automata,” in Proceedings of
the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant
Systems, Lyngby, Denmark, 1998, vol. 1486, pp. 228–240.
ista: 'Preußig J, Kowalewski S, Wong Toi H, Henzinger TA. 1998. An algorithm for
the approximative analysis of rectangular automata. Proceedings of the 5th International
Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT:
Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS, vol. 1486, 228–240.'
mla: Preußig, Jörg, et al. “An Algorithm for the Approximative Analysis of Rectangular
Automata.” Proceedings of the 5th International Symposium on Formal Techniques
in Real-Time and Fault-Tolerant Systems, vol. 1486, Springer, 1998, pp. 228–40,
doi:10.1007/BFb0055350.
short: J. Preußig, S. Kowalewski, H. Wong Toi, T.A. Henzinger, in:, Proceedings
of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant
Systems, Springer, 1998, pp. 228–240.
conference:
end_date: 1998-09-18
location: Lyngby, Denmark
name: 'FTRTFT: Formal Techniques in Real-Time and Fault-Tolerant Systems'
start_date: 1998-09-14
date_created: 2018-12-11T12:08:43Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-24T12:01:57Z
day: '01'
doi: 10.1007/BFb0055350
extern: '1'
intvolume: ' 1486'
language:
- iso: eng
month: '01'
oa_version: None
page: 228 - 240
publication: Proceedings of the 5th International Symposium on Formal Techniques in
Real-Time and Fault-Tolerant Systems
publication_identifier:
isbn:
- '9783540650034'
publication_status: published
publisher: Springer
publist_id: '320'
quality_controlled: '1'
scopus_import: '1'
status: public
title: An algorithm for the approximative analysis of rectangular automata
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1486
year: '1998'
...
---
_id: '4429'
abstract:
- lang: eng
text: We study the reachability problem for hybrid automata. Automatic approaches,
which attempt to construct the reachable region by symbolic execution, often do
not terminate. In these cases, we require the user to guess the reachable region,
and we use a theorem prover (Pvs) to verify the guess. We classify hybrid automata
according to the theory in which their reachable region can be defined finitely.
This is the theory in which the prover needs to operate in order to verify the
guess. The approach is interesting, because an appropriate guess can often be
deduced by extrapolating from the first few steps of symbolic execution.
acknowledgement: "This research was supported in part by the ONR YIP award N00014-95-1-0520,
by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the AFOSR
contract F49620-93-1-0056, by the ARO MURI grant DAAH-04-96-1-0341, by the ARPA
grant NAG2-892, and by the SRC contract 95-DC-324.036.\r\nSupported by Lavoisier
grant of the French Foreign Affairs Ministry and by SRI."
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: Vlad
full_name: Rusu, Vlad
last_name: Rusu
citation:
ama: 'Henzinger TA, Rusu V. Reachability verification for hybrid automata. In: Proceedings
of the 1st International Workshop on Hybrid Systems: Computation and Control.
Vol 1386. Springer; 1998:190-204. doi:10.1007/3-540-64358-3_40'
apa: 'Henzinger, T. A., & Rusu, V. (1998). Reachability verification for hybrid
automata. In Proceedings of the 1st International Workshop on Hybrid Systems:
Computation and Control (Vol. 1386, pp. 190–204). Berkely, CA, United States
of America: Springer. https://doi.org/10.1007/3-540-64358-3_40'
chicago: 'Henzinger, Thomas A, and Vlad Rusu. “Reachability Verification for Hybrid
Automata.” In Proceedings of the 1st International Workshop on Hybrid Systems:
Computation and Control, 1386:190–204. Springer, 1998. https://doi.org/10.1007/3-540-64358-3_40.'
ieee: 'T. A. Henzinger and V. Rusu, “Reachability verification for hybrid automata,”
in Proceedings of the 1st International Workshop on Hybrid Systems: Computation
and Control, Berkely, CA, United States of America, 1998, vol. 1386, pp. 190–204.'
ista: 'Henzinger TA, Rusu V. 1998. Reachability verification for hybrid automata.
Proceedings of the 1st International Workshop on Hybrid Systems: Computation and
Control. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 1386, 190–204.'
mla: 'Henzinger, Thomas A., and Vlad Rusu. “Reachability Verification for Hybrid
Automata.” Proceedings of the 1st International Workshop on Hybrid Systems:
Computation and Control, vol. 1386, Springer, 1998, pp. 190–204, doi:10.1007/3-540-64358-3_40.'
short: 'T.A. Henzinger, V. Rusu, in:, Proceedings of the 1st International Workshop
on Hybrid Systems: Computation and Control, Springer, 1998, pp. 190–204.'
conference:
end_date: 1998-04-15
location: Berkely, CA, United States of America
name: 'HSCC: Hybrid Systems - Computation and Control'
start_date: 1998-04-13
date_created: 2018-12-11T12:08:48Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-24T11:29:14Z
day: '01'
doi: 10.1007/3-540-64358-3_40
extern: '1'
intvolume: ' 1386'
language:
- iso: eng
month: '01'
oa_version: None
page: 190 - 204
publication: 'Proceedings of the 1st International Workshop on Hybrid Systems: Computation
and Control'
publication_identifier:
isbn:
- '9783540643586'
publication_status: published
publisher: Springer
publist_id: '299'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Reachability verification for hybrid automata
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1386
year: '1998'
...
---
_id: '4430'
alternative_title:
- LNCS
article_processing_charge: No
citation:
ama: 'Henzinger TA, ed. HSCC: Hybrid Systems—Computation and Control. Vol
1386. Springer; 1998. doi:10.1007/3-540-64358-3'
apa: 'Henzinger, T. A. (Ed.). (1998). HSCC: Hybrid Systems—Computation and Control
(Vol. 1386). Presented at the HSCC: Hybrid Systems: Computation and Control, Berkeley,
CA, United States of America: Springer. https://doi.org/10.1007/3-540-64358-3'
chicago: 'Henzinger, Thomas A, ed. HSCC: Hybrid Systems—Computation and Control.
Vol. 1386. Springer, 1998. https://doi.org/10.1007/3-540-64358-3.'
ieee: 'T. A. Henzinger, Ed., HSCC: Hybrid Systems—Computation and Control,
vol. 1386. Springer, 1998.'
ista: 'Henzinger TA ed. 1998. HSCC: Hybrid Systems—Computation and Control, Springer,p.'
mla: 'Henzinger, Thomas A., editor. HSCC: Hybrid Systems—Computation and Control.
Vol. 1386, Springer, 1998, doi:10.1007/3-540-64358-3.'
short: 'T.A. Henzinger, ed., HSCC: Hybrid Systems—Computation and Control, Springer,
1998.'
conference:
end_date: 1998-04-15
location: Berkeley, CA, United States of America
name: 'HSCC: Hybrid Systems: Computation and Control'
start_date: 1998-04-13
date_created: 2018-12-11T12:08:49Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-24T11:36:03Z
day: '01'
doi: 10.1007/3-540-64358-3
editor:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
extern: '1'
intvolume: ' 1386'
language:
- iso: eng
month: '01'
oa_version: None
publication_identifier:
isbn:
- 978-3-540-64358-6
publication_status: published
publisher: Springer
publist_id: '300'
status: public
title: 'HSCC: Hybrid Systems—Computation and Control'
type: conference_editor
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1386
year: '1998'
...
---
_id: '4486'
abstract:
- lang: eng
text: 'The simulation preorder on state transition systems is widely accepted as
a useful notion of refinement, both in its own right and as an efficiently checkable
sufficient condition for trace containment. For composite systems, due to the
exponential explosion of the state space, there is a need for decomposing a simulation
check of the form P< s Q into simpler simulation checks on the components of
P and Q. We present an assume-guarantee rule that enables such a decomposition.
To the best of our knowledge, this is the first assume-guarantee rule that applies
to a refinement relation different from trace containment. Our rule is circular,
and its soundness proof requires induction on trace trees. The proof is constructive:
given simulation relations that witness the simulation preorder between corresponding
components of P and Q, we provide a procedure for constructing a witness relation
for P< s Q. We also extend our assume-guarantee rule to account for fairness
assumptions on transition systems'
acknowledgement: This research was supported in part by the Office of Naval Research
Young Investigator award N00014-95-1-0520, by the National Science Foundation CAREER
award CCR-9501708, by the National Science Foundation grant CCR-9504469, by the
Defense Advanced Research Projects Agency grant NAG2-1214, by the Army Research
Office MURI grant DAAH-04-96-1-0341, and by the Semiconductor Research Corporation
contract 97-DC-324.041.
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: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
- first_name: Sriram
full_name: Rajamani, Sriram
last_name: Rajamani
- first_name: Serdar
full_name: Tasiran, Serdar
last_name: Tasiran
citation:
ama: 'Henzinger TA, Qadeer S, Rajamani S, Tasiran S. An assume-guarantee rule for
checking simulation. In: Proceedings of the 2nd International Conference on
Formal Methods in Computer-Aided Design. Vol 1522. Springer; 1998:421-432.
doi:10.1007/3-540-49519-3_27'
apa: 'Henzinger, T. A., Qadeer, S., Rajamani, S., & Tasiran, S. (1998). An assume-guarantee
rule for checking simulation. In Proceedings of the 2nd International Conference
on Formal Methods in Computer-Aided Design (Vol. 1522, pp. 421–432). Palo
Alto, CA, United States of America: Springer. https://doi.org/10.1007/3-540-49519-3_27'
chicago: Henzinger, Thomas A, Shaz Qadeer, Sriram Rajamani, and Serdar Tasiran.
“An Assume-Guarantee Rule for Checking Simulation.” In Proceedings of the 2nd
International Conference on Formal Methods in Computer-Aided Design, 1522:421–32.
Springer, 1998. https://doi.org/10.1007/3-540-49519-3_27.
ieee: T. A. Henzinger, S. Qadeer, S. Rajamani, and S. Tasiran, “An assume-guarantee
rule for checking simulation,” in Proceedings of the 2nd International Conference
on Formal Methods in Computer-Aided Design, Palo Alto, CA, United States of
America, 1998, vol. 1522, pp. 421–432.
ista: 'Henzinger TA, Qadeer S, Rajamani S, Tasiran S. 1998. An assume-guarantee
rule for checking simulation. Proceedings of the 2nd International Conference
on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided
Design, LNCS, vol. 1522, 421–432.'
mla: Henzinger, Thomas A., et al. “An Assume-Guarantee Rule for Checking Simulation.”
Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided
Design, vol. 1522, Springer, 1998, pp. 421–32, doi:10.1007/3-540-49519-3_27.
short: T.A. Henzinger, S. Qadeer, S. Rajamani, S. Tasiran, in:, Proceedings of the
2nd International Conference on Formal Methods in Computer-Aided Design, Springer,
1998, pp. 421–432.
conference:
end_date: 1998-11-06
location: Palo Alto, CA, United States of America
name: 'FMCAD: Formal Methods in Computer-Aided Design'
start_date: 1998-11-04
date_created: 2018-12-11T12:09:06Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-24T10:00:50Z
day: '01'
doi: 10.1007/3-540-49519-3_27
extern: '1'
intvolume: ' 1522'
language:
- iso: eng
month: '01'
oa_version: None
page: 421 - 432
publication: Proceedings of the 2nd International Conference on Formal Methods in
Computer-Aided Design
publication_identifier:
isbn:
- '9783540651918'
publication_status: published
publisher: Springer
publist_id: '242'
quality_controlled: '1'
scopus_import: '1'
status: public
title: An assume-guarantee rule for checking simulation
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1522
year: '1998'
...
---
_id: '4488'
abstract:
- lang: eng
text: Assume-guarantee reasoning has long been advertised as an important method
for decomposing proof obligations in system verification. Refinement mappings
(homomorphisms) have long been advertised as an important method for solving the
language-inclusion problem in practice. When confronted with large verification
problems, we therefore attempted to make use of both techniques. We soon found
that rather than offering instant solutions, the success of assume-guarantee reasoning
depends critically on the construction of suitable abstraction modules, and the
success of refinement checking depends critically on the construction of suitable
witness modules. Moreover, as abstractions need to be witnessed, and witnesses
abstracted, the process must be iterated. We present here the main lessons we
learned from our experiments, in limn of a systematic and structured discipline
for the compositional verification of reactive modules. An infrastructure to support
this discipline, and automate parts of the verification, has been implemented
in the tool Mocha.
acknowledgement: This work is supported in part by ONR YIP award N00014-95-1-0520,
by NSF CAREER award CCR-9501708, by NSF grant CCR-9504469, by ARO MURI grant DAAH-04-96-1-0341,
and by the SRC contract 97-DC-324.041.
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: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
- first_name: Sriram
full_name: Rajamani, Sriram
last_name: Rajamani
citation:
ama: 'Henzinger TA, Qadeer S, Rajamani S. You assume, we guarantee: Methodology
and case studies. In: Proceedings of the 10th International Conference on Computer
Aided Verification. Vol 1427. Springer; 1998:440-451. doi:10.1007/BFb0028765'
apa: 'Henzinger, T. A., Qadeer, S., & Rajamani, S. (1998). You assume, we guarantee:
Methodology and case studies. In Proceedings of the 10th International Conference
on Computer Aided Verification (Vol. 1427, pp. 440–451). Vancouver, Canada:
Springer. https://doi.org/10.1007/BFb0028765'
chicago: 'Henzinger, Thomas A, Shaz Qadeer, and Sriram Rajamani. “You Assume, We
Guarantee: Methodology and Case Studies.” In Proceedings of the 10th International
Conference on Computer Aided Verification, 1427:440–51. Springer, 1998. https://doi.org/10.1007/BFb0028765.'
ieee: 'T. A. Henzinger, S. Qadeer, and S. Rajamani, “You assume, we guarantee: Methodology
and case studies,” in Proceedings of the 10th International Conference on Computer
Aided Verification, Vancouver, Canada, 1998, vol. 1427, pp. 440–451.'
ista: 'Henzinger TA, Qadeer S, Rajamani S. 1998. You assume, we guarantee: Methodology
and case studies. Proceedings of the 10th International Conference on Computer
Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 1427, 440–451.'
mla: 'Henzinger, Thomas A., et al. “You Assume, We Guarantee: Methodology and Case
Studies.” Proceedings of the 10th International Conference on Computer Aided
Verification, vol. 1427, Springer, 1998, pp. 440–51, doi:10.1007/BFb0028765.'
short: T.A. Henzinger, S. Qadeer, S. Rajamani, in:, Proceedings of the 10th International
Conference on Computer Aided Verification, Springer, 1998, pp. 440–451.
conference:
end_date: 1998-07-02
location: Vancouver, Canada
name: 'CAV: Computer Aided Verification'
start_date: 1998-06-28
date_created: 2018-12-11T12:09:06Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-09-05T07:31:52Z
day: '01'
doi: 10.1007/BFb0028765
extern: '1'
intvolume: ' 1427'
language:
- iso: eng
month: '01'
oa_version: None
page: 440 - 451
publication: Proceedings of the 10th International Conference on Computer Aided Verification
publication_identifier:
isbn:
- '9783540646082'
publication_status: published
publisher: Springer
publist_id: '239'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'You assume, we guarantee: Methodology and case studies'
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1427
year: '1998'
...
---
_id: '4489'
abstract:
- lang: eng
text: "Symbolic model checking, which enables the automatic verification of large
systems, proceeds by calculating with expressions that represent state sets. Traditionally,
symbolic model-checking tools arc based on backward state traversal; their basic
operation is the function pre, which given a set of states, returns the set of
all predecessor states. This is because specifiers usally employ formalisms with
future-time modalities. which are naturally evaluated by iterating applications
of pre. It has been recently shown experimentally that symbolic model checking
can perform significantly better if it is based, instead, on forward state traversal;
in this case, the basic operation is the function post, which given a set of states,
returns the set of all successor states. This is because forward state traversal
can ensure that only those parts of the state space are explored which are reachable
from an initial state and relevant for satisfaction or violation of the specification;
that is, errors can be detected as soon as possible.\r\nIn this paper, we investigate
which specifications can be checked by symbolic forward state traversal. We formulate
the problems of symbolic backward and forward model checking by means of two -calculi.
The pre- calculus is based on the pre operation; the post- calculus, on the post
operation. These two -calculi induce query logics, which augment fixpoint expressions
with a boolean emptiness query. Using query logics, we are able to relate and
compare the symbolic backward and forward approaches. In particular, we prove
that all -regular (linear-time) specifications can be expressed as post- queries,
and therefore checked using symbolic forward state traversal. On the other hand,
we show that there are simple branching-time specifications that cannot be checked
in this way."
acknowledgement: This work is supported in part by ONR YIP award N00014-95-1-0520,
by NSF CAREER award CCR-9501708, by NSF grant CCR-9504469, by ARO MURI grant DAAH-04-96-1-0341,
and by the SRC contract 97-DC-324.041.
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: Orna
full_name: Kupferman, Orna
last_name: Kupferman
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
citation:
ama: 'Henzinger TA, Kupferman O, Qadeer S. From pre-historic to post-modern symbolic
model checking. In: Proceedings of the 10th International Conference on Computer
Aided Verification. Vol 1427. Springer; 1998:195-206. doi:10.1007/BFb0028745'
apa: 'Henzinger, T. A., Kupferman, O., & Qadeer, S. (1998). From pre-historic
to post-modern symbolic model checking. In Proceedings of the 10th International
Conference on Computer Aided Verification (Vol. 1427, pp. 195–206). Vancouver,
Canada: Springer. https://doi.org/10.1007/BFb0028745'
chicago: Henzinger, Thomas A, Orna Kupferman, and Shaz Qadeer. “From Pre-Historic
to Post-Modern Symbolic Model Checking.” In Proceedings of the 10th International
Conference on Computer Aided Verification, 1427:195–206. Springer, 1998. https://doi.org/10.1007/BFb0028745.
ieee: T. A. Henzinger, O. Kupferman, and S. Qadeer, “From pre-historic to post-modern
symbolic model checking,” in Proceedings of the 10th International Conference
on Computer Aided Verification, Vancouver, Canada, 1998, vol. 1427, pp. 195–206.
ista: 'Henzinger TA, Kupferman O, Qadeer S. 1998. From pre-historic to post-modern
symbolic model checking. Proceedings of the 10th International Conference on Computer
Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 1427, 195–206.'
mla: Henzinger, Thomas A., et al. “From Pre-Historic to Post-Modern Symbolic Model
Checking.” Proceedings of the 10th International Conference on Computer Aided
Verification, vol. 1427, Springer, 1998, pp. 195–206, doi:10.1007/BFb0028745.
short: T.A. Henzinger, O. Kupferman, S. Qadeer, in:, Proceedings of the 10th International
Conference on Computer Aided Verification, Springer, 1998, pp. 195–206.
conference:
end_date: 1998-07-02
location: Vancouver, Canada
name: 'CAV: Computer Aided Verification'
start_date: 1998-06-28
date_created: 2018-12-11T12:09:07Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-24T09:19:53Z
day: '01'
doi: 10.1007/BFb0028745
extern: '1'
intvolume: ' 1427'
language:
- iso: eng
month: '01'
oa_version: None
page: 195 - 206
publication: Proceedings of the 10th International Conference on Computer Aided Verification
publication_identifier:
isbn:
- '9783540646082'
publication_status: published
publisher: Springer
publist_id: '240'
quality_controlled: '1'
scopus_import: '1'
status: public
title: From pre-historic to post-modern symbolic model checking
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1427
year: '1998'
...
---
_id: '4490'
abstract:
- lang: eng
text: "A specification formalism for reactive systems defines a class of Ω-languages.
We call a specification formalism fully decidable if it is constructively closed
under boolean operations and has a decidable satisfiability (nonemptiness) problem.
There are two important, robust classes of Ω-languages that are definable by fully
decidable formalisms. The Ω -reqular languages are definable by finite automata,
or equivalcntly, by the Sequential Calculus. The counter-free Ω-regular languages
are definable by temporal logic, or equivalcntly, by the first-order fragment
of the Sequential Calculus. The gap between both classes can be closed by finite
counting (using automata connectives), or equivalently, by projection (existential
second-order quantification over letters).\r\nA specification formalism for real-time
systems defines a class of timed Ω-langnages, whose letters have real-numbered
time stamps. Two popular ways of specifying timing constraints rely on the use
of clocks, and on the use of time bounds for temporal operators. However, temporal
logics with clocks or time bounds have undecidable satisfiability problems, and
finite automata with clocks (so-called timed automata) are not closed under complement.
Therefore, two fully decidable restrictions of these formalisms have been proposed.
In the first case, clocks are restricted to event clocks, which measure distances
to immediately preceding or succeeding events only. In the second case, time bounds
are restricted to nonsingular intervals, which cannot specify the exact punctuality
of events. We show that the resulting classes of timed Ω-languages are robust,
and we explain their relationship.\r\nFirst, we show that temporal logic with
event clocks defines the same class of timed Ω-languages as temporal logic with
nonsingular time bounds, and we identify a first-order monadic theory that also
defines this class. Second, we show that if the ability of finite counting is
added to these formalisms, we obtain the class of timed Ω-languages that are definable
by finite automata with event clocks, or equivalently, by a restricted second-order
extension of the monadic theory. Third, we show that if projection is added, we
obtain the class of timed Ω-languages that are definable by timed automata, or
equivalently, by a richer second-order extension of the monadic theory. These
results identify three robust classes of timed Ω-languages, of which the third,
while popular, is not definable by a, fully decidable formalism. By contrast,
the first two classes are definable by fully decidable formalisms from temporal
logic, from automata theory, and from monadic logic. Since the gap between these
two classes can be closed by finite counting, we dub them the timed Ω-regular
languages and the timed counter-free Ω-rcgular languages, respectively."
acknowledgement: This work is supported in part by the ONR YIP award N00014-95-1-0520,
the NSF CAREER award CCR-9501708, the NSF grant CCR-9504469, the ARO MURI grant
DAAH-04-96-1-0341, the SRC contract 97-DC-324.041, the Belgian National Fund for
Scientific Research (FNRS), the European Commission under WGs Aspire and Fireworks,
the Portuguese FCT, and by Belgacom.
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: Jean
full_name: Raskin, Jean
last_name: Raskin
- first_name: Pierre
full_name: Schobbens, Pierre
last_name: Schobbens
citation:
ama: 'Henzinger TA, Raskin J, Schobbens P. The regular real-time languages. In:
Proceedings of the 25th International Colloqium on Automata, Languages and
Programming. Vol 1443. Springer; 1998:580-591. doi:10.1007/BFb0055086'
apa: 'Henzinger, T. A., Raskin, J., & Schobbens, P. (1998). The regular real-time
languages. In Proceedings of the 25th International Colloqium on Automata,
Languages and Programming (Vol. 1443, pp. 580–591). Aalborg, Denmark: Springer.
https://doi.org/10.1007/BFb0055086'
chicago: Henzinger, Thomas A, Jean Raskin, and Pierre Schobbens. “The Regular Real-Time
Languages.” In Proceedings of the 25th International Colloqium on Automata,
Languages and Programming, 1443:580–91. Springer, 1998. https://doi.org/10.1007/BFb0055086.
ieee: T. A. Henzinger, J. Raskin, and P. Schobbens, “The regular real-time languages,”
in Proceedings of the 25th International Colloqium on Automata, Languages and
Programming, Aalborg, Denmark, 1998, vol. 1443, pp. 580–591.
ista: 'Henzinger TA, Raskin J, Schobbens P. 1998. The regular real-time languages.
Proceedings of the 25th International Colloqium on Automata, Languages and Programming.
ICALP: Automata, Languages and Programming, LNCS, vol. 1443, 580–591.'
mla: Henzinger, Thomas A., et al. “The Regular Real-Time Languages.” Proceedings
of the 25th International Colloqium on Automata, Languages and Programming,
vol. 1443, Springer, 1998, pp. 580–91, doi:10.1007/BFb0055086.
short: T.A. Henzinger, J. Raskin, P. Schobbens, in:, Proceedings of the 25th International
Colloqium on Automata, Languages and Programming, Springer, 1998, pp. 580–591.
conference:
end_date: 1998-07-17
location: Aalborg, Denmark
name: 'ICALP: Automata, Languages and Programming'
start_date: 1998-07-13
date_created: 2018-12-11T12:09:07Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-24T09:30:11Z
day: '01'
doi: 10.1007/BFb0055086
extern: '1'
intvolume: ' 1443'
language:
- iso: eng
month: '01'
oa_version: None
page: 580 - 591
publication: Proceedings of the 25th International Colloqium on Automata, Languages
and Programming
publication_identifier:
isbn:
- '9783540647812'
publication_status: published
publisher: Springer
publist_id: '241'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The regular real-time languages
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1443
year: '1998'
...
---
_id: '4491'
abstract:
- lang: eng
text: We present two methods for translating nonlinear hybrid systems into linear
hybrid automata. Properties of the nonlinear systems can then be inferred from
the automatic analysis of the translated linear hybrid automata. The first method,
called clock translation, replaces constraints on nonlinear variables by constraints
on clock variables. The second method, called linear phase-portrait approximation,
conservatively overapproximates the phase portrait of a hybrid automaton using
piecewise-constant polyhedral differential inclusions. Both methods are sound
for safety properties. We illustrate both methods by using HYTECH, a symbolic
model checker for linear hybrid automata, to automatically check properties of
a nonlinear temperature controller and of a predator-prey ecology
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
- first_name: Pei
full_name: Ho, Pei
last_name: Ho
- first_name: Howard
full_name: Wong Toi, Howard
last_name: Wong Toi
citation:
ama: Henzinger TA, Ho P, Wong Toi H. Algorithmic analysis of nonlinear hybrid systems.
IEEE Transactions on Automatic Control. 1998;43(4):540-554. doi:10.1109/9.664156
apa: Henzinger, T. A., Ho, P., & Wong Toi, H. (1998). Algorithmic analysis of
nonlinear hybrid systems. IEEE Transactions on Automatic Control. IEEE.
https://doi.org/10.1109/9.664156
chicago: Henzinger, Thomas A, Pei Ho, and Howard Wong Toi. “Algorithmic Analysis
of Nonlinear Hybrid Systems.” IEEE Transactions on Automatic Control. IEEE,
1998. https://doi.org/10.1109/9.664156
.
ieee: T. A. Henzinger, P. Ho, and H. Wong Toi, “Algorithmic analysis of nonlinear
hybrid systems,” IEEE Transactions on Automatic Control, vol. 43, no. 4.
IEEE, pp. 540–554, 1998.
ista: Henzinger TA, Ho P, Wong Toi H. 1998. Algorithmic analysis of nonlinear hybrid
systems. IEEE Transactions on Automatic Control. 43(4), 540–554.
mla: Henzinger, Thomas A., et al. “Algorithmic Analysis of Nonlinear Hybrid Systems.”
IEEE Transactions on Automatic Control, vol. 43, no. 4, IEEE, 1998, pp.
540–54, doi:10.1109/9.664156 .
short: T.A. Henzinger, P. Ho, H. Wong Toi, IEEE Transactions on Automatic Control
43 (1998) 540–554.
date_created: 2018-12-11T12:09:07Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-23T14:34:35Z
day: '01'
doi: '10.1109/9.664156 '
extern: '1'
intvolume: ' 43'
issue: '4'
language:
- iso: eng
month: '01'
oa_version: None
page: 540 - 554
publication: IEEE Transactions on Automatic Control
publication_identifier:
issn:
- 0018-9162
publication_status: published
publisher: IEEE
publist_id: '238'
quality_controlled: '1'
status: public
title: Algorithmic analysis of nonlinear hybrid systems
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 43
year: '1998'
...
---
_id: '4492'
abstract:
- lang: eng
text: Hybrid automata model systems with both digital and analog components, such
as embedded control programs. Many verification tasks for such programs can be
expressed as reachability problems for hybrid automata. By improving on previous
decidability and undecidability results, we identify a boundary between decidability
and undecidability for the reachability problem of hybrid automata. On the positive
side, we give an (optimal) PSPACE reachability algorithm for the case of initialized
rectangular automata, where all analog variables follow independent trajectories
within piecewise-linear envelopes and are reinitialized whenever the envelope
changes. Our algorithm is based on the construction of a timed automaton that
contains all reachability information about a given initialized rectangular automaton.
The translation has practical significance for verification, because it guarantees
the termination of symbolic procedures for the reachability analysis of initialized
rectangular automata. The translation also preserves theω-languages of initialized
rectangular automata with bounded nondeterminism. On the negative side, we show
that several slight generalizations of initialized rectangular automata lead to
an undecidable reachability problem. In particular, we prove that the reachability
problem is undecidable for timed automata augmented with a single stopwatch.
acknowledgement: This research was supported in part by the Office of Naval Research
Young Investigator Award N00014-95-1-0520, by the National Science Foundation CAREER
award CCR-9501708, by the National Science Foundation Grant CCR-9504469, by the
Air Force Office of Scientific Research Contract F49620-93-1-0056, by the Army Research
Office MURI Grant DAAH-04-96-1-0341, by the Army Research Office Contract DAAH-04-94-G-0026,
by the Defense Advanced Research Projects Agency Grant NAG2-892, and by the California
PATH program.
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
- first_name: Peter
full_name: Kopke, Peter
last_name: Kopke
- first_name: Anuj
full_name: Puri, Anuj
last_name: Puri
- first_name: P.
full_name: Varaiya, P.
last_name: Varaiya
citation:
ama: Henzinger TA, Kopke P, Puri A, Varaiya P. What’s decidable about hybrid automata?
Journal of Computer and System Sciences. 1998;57(1):94-124. doi:10.1006/jcss.1998.1581
apa: Henzinger, T. A., Kopke, P., Puri, A., & Varaiya, P. (1998). What’s decidable
about hybrid automata? Journal of Computer and System Sciences. Elsevier.
https://doi.org/10.1006/jcss.1998.1581
chicago: Henzinger, Thomas A, Peter Kopke, Anuj Puri, and P. Varaiya. “What’s Decidable
about Hybrid Automata?” Journal of Computer and System Sciences. Elsevier,
1998. https://doi.org/10.1006/jcss.1998.1581.
ieee: T. A. Henzinger, P. Kopke, A. Puri, and P. Varaiya, “What’s decidable about
hybrid automata?,” Journal of Computer and System Sciences, vol. 57, no.
1. Elsevier, pp. 94–124, 1998.
ista: Henzinger TA, Kopke P, Puri A, Varaiya P. 1998. What’s decidable about hybrid
automata? Journal of Computer and System Sciences. 57(1), 94–124.
mla: Henzinger, Thomas A., et al. “What’s Decidable about Hybrid Automata?” Journal
of Computer and System Sciences, vol. 57, no. 1, Elsevier, 1998, pp. 94–124,
doi:10.1006/jcss.1998.1581.
short: T.A. Henzinger, P. Kopke, A. Puri, P. Varaiya, Journal of Computer and System
Sciences 57 (1998) 94–124.
date_created: 2018-12-11T12:09:08Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-23T14:29:15Z
day: '01'
doi: 10.1006/jcss.1998.1581
extern: '1'
intvolume: ' 57'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/S0022000098915811
month: '01'
oa: 1
oa_version: Published Version
page: 94 - 124
publication: Journal of Computer and System Sciences
publication_identifier:
isbn:
- 0022-0000
publication_status: published
publisher: Elsevier
publist_id: '237'
quality_controlled: '1'
status: public
title: What's decidable about hybrid automata?
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 57
year: '1998'
...
---
_id: '4515'
abstract:
- lang: eng
text: We summarize and reorganize some of the last decade's research on real-time
extensions of temporal logic. Our main focus is on tableau constructions for model
checking linear temporal formulas with timing constraints. In particular, we find
that a great deal of real-time verification can be performed in polynomial space,
but also that considerable care must be exercised in order to keep the real-time
verification problem in polynomial space, or even decidable.
acknowledgement: This research was supported in part by the Office of Naval Research
Young Investigator award N00014-95-1-0520, by the National Science Foundation CAREER
award CCR-9501708, by the National Science Foundation grant CCR-9504469, by the
Defense Advanced Research Projects Agency grant NAG2-1214, by the Army Research
Office MURI grant DAAH-04-96-1-0341, and by the Semiconductor Research Corporation
contract 97-DC-324.041.
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
citation:
ama: 'Henzinger TA. It’s about time: Real-time logics reviewed. In: Proceedings
of the 9th Interantional Conference on Concurrency Theory. Vol 1466. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 1998:439-454. doi:10.1007/BFb0055640'
apa: 'Henzinger, T. A. (1998). It’s about time: Real-time logics reviewed. In Proceedings
of the 9th Interantional Conference on Concurrency Theory (Vol. 1466, pp.
439–454). Nice, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/BFb0055640'
chicago: 'Henzinger, Thomas A. “It’s about Time: Real-Time Logics Reviewed.” In
Proceedings of the 9th Interantional Conference on Concurrency Theory,
1466:439–54. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998. https://doi.org/10.1007/BFb0055640.'
ieee: 'T. A. Henzinger, “It’s about time: Real-time logics reviewed,” in Proceedings
of the 9th Interantional Conference on Concurrency Theory, Nice, France, 1998,
vol. 1466, pp. 439–454.'
ista: 'Henzinger TA. 1998. It’s about time: Real-time logics reviewed. Proceedings
of the 9th Interantional Conference on Concurrency Theory. CONCUR: Concurrency
Theory, LNCS, vol. 1466, 439–454.'
mla: 'Henzinger, Thomas A. “It’s about Time: Real-Time Logics Reviewed.” Proceedings
of the 9th Interantional Conference on Concurrency Theory, vol. 1466, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 439–54, doi:10.1007/BFb0055640.'
short: T.A. Henzinger, in:, Proceedings of the 9th Interantional Conference on Concurrency
Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 439–454.
conference:
end_date: 1998-09-11
location: Nice, France
name: 'CONCUR: Concurrency Theory'
start_date: 1998-09-08
date_created: 2018-12-11T12:09:15Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-23T14:24:08Z
day: '01'
doi: 10.1007/BFb0055640
extern: '1'
intvolume: ' 1466'
language:
- iso: eng
month: '01'
oa_version: None
page: 439 - 454
publication: Proceedings of the 9th Interantional Conference on Concurrency Theory
publication_identifier:
isbn:
- 978-3-540-64896-3
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '214'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'It''s about time: Real-time logics reviewed'
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1466
year: '1998'
...