---
OA_place: publisher
OA_type: free access
_id: '2996'
abstract:
- lang: eng
text: "Plants, compared to animals, exhibit an amazing adaptability and plasticity
in their development. This is largely dependent on the ability of plants to form
new organs, such as lateral roots, leaves, and flowers during postembryonic development.
Organ primordia develop from founder cell populations into organs by coordinated
cell division and differentiation. Here, we show that organ formation in Arabidopsis
involves dynamic gradients of the signaling molecule auxin with maxima at the
primordia tips. These gradients are mediated by cellular efflux requiring asymmetrically
localized PIN proteins, which represent a functionally redundant network for auxin
distribution in both aerial and underground organs. PIN1 polar localization undergoes
a dynamic rearrangement, which correlates with establishment of auxin gradients
and primordium development. Our results suggest that PIN-dependent, local auxin
gradients represent a common module for formation of all plant organs, regardless
of their mature morphology or developmental origin.\r\n"
article_processing_charge: No
article_type: original
author:
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: Marta
full_name: Michniewicz, Marta
last_name: Michniewicz
- first_name: Michael
full_name: Sauer, Michael
last_name: Sauer
- first_name: Thomas
full_name: Teichmann, Thomas
last_name: Teichmann
- first_name: Daniela
full_name: Seifertová, Daniela
last_name: Seifertová
- first_name: Gerd
full_name: Jürgens, Gerd
last_name: Jürgens
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Benková E, Michniewicz M, Sauer M, et al. Local, efflux-dependent auxin gradients
as a common module for plant organ formation. Cell. 2003;115(5):591-602.
doi:10.1016/S0092-8674(03)00924-3
apa: Benková, E., Michniewicz, M., Sauer, M., Teichmann, T., Seifertová, D., Jürgens,
G., & Friml, J. (2003). Local, efflux-dependent auxin gradients as a common
module for plant organ formation. Cell. Cell Press. https://doi.org/10.1016/S0092-8674(03)00924-3
chicago: Benková, Eva, Marta Michniewicz, Michael Sauer, Thomas Teichmann, Daniela
Seifertová, Gerd Jürgens, and Jiří Friml. “Local, Efflux-Dependent Auxin Gradients
as a Common Module for Plant Organ Formation.” Cell. Cell Press, 2003.
https://doi.org/10.1016/S0092-8674(03)00924-3.
ieee: E. Benková et al., “Local, efflux-dependent auxin gradients as a common
module for plant organ formation,” Cell, vol. 115, no. 5. Cell Press, pp.
591–602, 2003.
ista: Benková E, Michniewicz M, Sauer M, Teichmann T, Seifertová D, Jürgens G, Friml
J. 2003. Local, efflux-dependent auxin gradients as a common module for plant
organ formation. Cell. 115(5), 591–602.
mla: Benková, Eva, et al. “Local, Efflux-Dependent Auxin Gradients as a Common Module
for Plant Organ Formation.” Cell, vol. 115, no. 5, Cell Press, 2003, pp.
591–602, doi:10.1016/S0092-8674(03)00924-3.
short: E. Benková, M. Michniewicz, M. Sauer, T. Teichmann, D. Seifertová, G. Jürgens,
J. Friml, Cell 115 (2003) 591–602.
date_created: 2018-12-11T12:00:46Z
date_published: 2003-11-26T00:00:00Z
date_updated: 2026-05-22T08:47:43Z
day: '26'
doi: 10.1016/S0092-8674(03)00924-3
extern: '1'
external_id:
pmid:
- '14651850'
fulldoi: https://doi.org/10.1016/S0092-8674(03)00924-3
intvolume: ' 115'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/S0092-8674(03)00924-3
month: '11'
oa: 1
oa_version: Published Version
page: 591 - 602
pmid: 1
publication: Cell
publication_identifier:
eissn:
- 1097-4172
issn:
- 0092-8674
publication_status: published
publisher: Cell Press
publist_id: '3706'
quality_controlled: '1'
status: public
title: Local, efflux-dependent auxin gradients as a common module for plant organ
formation
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 115
year: '2003'
...
---
_id: '13436'
abstract:
- lang: eng
text: Cross-metathesis reactions of α,β-unsaturated sulfones and sulfoxides in the
presence of molybdenum and ruthenium pre-catalysts were tested. A selective metahesis
reaction was achieved between functionalized terminal olefins and vinyl sulfones
by using the ‘second generation’ ruthenium catalysts 1c–h while the highly active
Schrock catalyst 1b was found to be functional group incompatible with vinyl sulfones.
The cross-metathesis products were isolated in good yields with an excellent (E)-selectivity.
Both the molybdenum and ruthenium-based complexes were, however, incompatible
with α,β- and β,γ-unsaturated sulfoxides.
article_processing_charge: No
article_type: original
author:
- first_name: Anna
full_name: Michrowska, Anna
last_name: Michrowska
- first_name: Michał
full_name: Bieniek, Michał
last_name: Bieniek
- first_name: Mikhail
full_name: Kim, Mikhail
last_name: Kim
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
- first_name: Karol
full_name: Grela, Karol
last_name: Grela
citation:
ama: Michrowska A, Bieniek M, Kim M, Klajn R, Grela K. Cross-metathesis reaction
of vinyl sulfones and sulfoxides. Tetrahedron. 2003;59(25):4525-4531. doi:10.1016/s0040-4020(03)00682-3
apa: Michrowska, A., Bieniek, M., Kim, M., Klajn, R., & Grela, K. (2003). Cross-metathesis
reaction of vinyl sulfones and sulfoxides. Tetrahedron. Elsevier. https://doi.org/10.1016/s0040-4020(03)00682-3
chicago: Michrowska, Anna, Michał Bieniek, Mikhail Kim, Rafal Klajn, and Karol Grela.
“Cross-Metathesis Reaction of Vinyl Sulfones and Sulfoxides.” Tetrahedron.
Elsevier, 2003. https://doi.org/10.1016/s0040-4020(03)00682-3.
ieee: A. Michrowska, M. Bieniek, M. Kim, R. Klajn, and K. Grela, “Cross-metathesis
reaction of vinyl sulfones and sulfoxides,” Tetrahedron, vol. 59, no. 25.
Elsevier, pp. 4525–4531, 2003.
ista: Michrowska A, Bieniek M, Kim M, Klajn R, Grela K. 2003. Cross-metathesis reaction
of vinyl sulfones and sulfoxides. Tetrahedron. 59(25), 4525–4531.
mla: Michrowska, Anna, et al. “Cross-Metathesis Reaction of Vinyl Sulfones and Sulfoxides.”
Tetrahedron, vol. 59, no. 25, Elsevier, 2003, pp. 4525–31, doi:10.1016/s0040-4020(03)00682-3.
short: A. Michrowska, M. Bieniek, M. Kim, R. Klajn, K. Grela, Tetrahedron 59 (2003)
4525–4531.
date_created: 2023-08-01T10:39:34Z
date_published: 2003-06-16T00:00:00Z
date_updated: 2023-08-08T12:44:17Z
day: '16'
doi: 10.1016/s0040-4020(03)00682-3
extern: '1'
fulldoi: https://doi.org/10.1016/s0040-4020(03)00682-3
intvolume: ' 59'
issue: '25'
keyword:
- Organic Chemistry
- Drug Discovery
- Biochemistry
language:
- iso: eng
month: '06'
oa_version: None
page: 4525-4531
publication: Tetrahedron
publication_identifier:
eissn:
- 1464-5416
issn:
- 0040-4020
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cross-metathesis reaction of vinyl sulfones and sulfoxides
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 59
year: '2003'
...
---
OA_place: repository
OA_type: green
_id: '1457'
abstract:
- lang: eng
text: 'Among the major mathematical approaches to mirror symmetry are those of Batyrev-Borisov
and Stromdnger-Yau-Zaslow (SYZ). The first is explicit and amenable to computation
but is not clearly related to the physical motivation; the second is the opposite.
Furthermore, it is far from obvious that mirror partners in one sense will also
be mirror partners in the other. This paper concerns a class of examples that
can be shown to satisfy the requirements of SYZ, but whose Hodge numbers are also
equal. This provides significant evidence in support of SYZ. Moreover, the examples
are of great interest in their own right: they are spaces of flat SLr-connections
on a smooth curve. The mirror is the corresponding space for the Langlands dual
group PGLr. These examples therefore throw a bridge from mirror symmetry to the
duality theory of Lie groups and, more broadly, to the geometric Langlands program.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Tamas
full_name: Hausel, Tamas
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
orcid: 0000-0002-9582-2634
- first_name: Michael
full_name: Thaddeus, Michael
last_name: Thaddeus
citation:
ama: Hausel T, Thaddeus M. Mirror symmetry, langlands duality, and the Hitchin system.
Inventiones Mathematicae. 2003;153:197-229. doi:10.1007/s00222-003-0286-7
apa: Hausel, T., & Thaddeus, M. (2003). Mirror symmetry, langlands duality,
and the Hitchin system. Inventiones Mathematicae. Springer Nature. https://doi.org/10.1007/s00222-003-0286-7
chicago: Hausel, Tamás, and Michael Thaddeus. “Mirror Symmetry, Langlands Duality,
and the Hitchin System.” Inventiones Mathematicae. Springer Nature, 2003.
https://doi.org/10.1007/s00222-003-0286-7.
ieee: T. Hausel and M. Thaddeus, “Mirror symmetry, langlands duality, and the Hitchin
system,” Inventiones Mathematicae, vol. 153. Springer Nature, pp. 197–229,
2003.
ista: Hausel T, Thaddeus M. 2003. Mirror symmetry, langlands duality, and the Hitchin
system. Inventiones Mathematicae. 153, 197–229.
mla: Hausel, Tamás, and Michael Thaddeus. “Mirror Symmetry, Langlands Duality, and
the Hitchin System.” Inventiones Mathematicae, vol. 153, Springer Nature,
2003, pp. 197–229, doi:10.1007/s00222-003-0286-7.
short: T. Hausel, M. Thaddeus, Inventiones Mathematicae 153 (2003) 197–229.
date_created: 2018-12-11T11:52:08Z
date_published: 2003-07-01T00:00:00Z
date_updated: 2026-05-28T11:54:13Z
day: '01'
doi: 10.1007/s00222-003-0286-7
extern: '1'
external_id:
arxiv:
- '0205236'
fulldoi: https://doi.org/10.1007/s00222-003-0286-7
intvolume: ' 153'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.math/0205236'
month: '07'
oa: 1
oa_version: Preprint
page: 197 - 229
publication: Inventiones Mathematicae
publication_identifier:
eissn:
- 1432-1297
issn:
- 0020-9910
publication_status: published
publisher: Springer Nature
publist_id: '5738'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mirror symmetry, langlands duality, and the Hitchin system
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 153
year: '2003'
...
---
OA_place: repository
OA_type: green
_id: '1459'
abstract:
- lang: eng
text: 'In this paper we explicitly calculate the analogue of the ''t Hooft SU (2)
Yang-Mills instantons on Gibbons-Hawking multi-centered gravitational instantons,
which come in two parallel families: the multi-Eguchi-Hanson, or Ak ALE gravitational
instantons and the multi-Taub-NUT spaces, or Ak ALF gravitational instantons.
We calculate their energy and find the reducible ones. Following Kronheimer we
also exploit the U(1) invariance of our solutions and study the corresponding
explicit singular SU (2) magnetic monopole solutions of the Bogomolny equations
on flat ℝ3.'
acknowledgement: We would like to acknowledge the financial support by Prof. P. Major
(R ́ enyi Institute, Hungary) from his OTKA grant No. T26176 and of the Miller Institute
for Basic Research in Science at UC Berkeley.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Gábor
full_name: Etesi, Gábor
last_name: Etesi
- first_name: Tamas
full_name: Hausel, Tamas
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
orcid: 0000-0002-9582-2634
citation:
ama: Etesi G, Hausel T. On Yang-Mills instantons over multi-centered gravitational
instantons. Communications in Mathematical Physics. 2003;235:275-288. doi:10.1007/s00220-003-0806-8
apa: Etesi, G., & Hausel, T. (2003). On Yang-Mills instantons over multi-centered
gravitational instantons. Communications in Mathematical Physics. Springer
Nature. https://doi.org/10.1007/s00220-003-0806-8
chicago: Etesi, Gábor, and Tamás Hausel. “On Yang-Mills Instantons over Multi-Centered
Gravitational Instantons.” Communications in Mathematical Physics. Springer
Nature, 2003. https://doi.org/10.1007/s00220-003-0806-8.
ieee: G. Etesi and T. Hausel, “On Yang-Mills instantons over multi-centered gravitational
instantons,” Communications in Mathematical Physics, vol. 235. Springer
Nature, pp. 275–288, 2003.
ista: Etesi G, Hausel T. 2003. On Yang-Mills instantons over multi-centered gravitational
instantons. Communications in Mathematical Physics. 235, 275–288.
mla: Etesi, Gábor, and Tamás Hausel. “On Yang-Mills Instantons over Multi-Centered
Gravitational Instantons.” Communications in Mathematical Physics, vol.
235, Springer Nature, 2003, pp. 275–88, doi:10.1007/s00220-003-0806-8.
short: G. Etesi, T. Hausel, Communications in Mathematical Physics 235 (2003) 275–288.
date_created: 2018-12-11T11:52:09Z
date_published: 2003-04-01T00:00:00Z
date_updated: 2026-05-28T12:12:13Z
day: '01'
doi: 10.1007/s00220-003-0806-8
extern: '1'
external_id:
arxiv:
- '0207196'
fulldoi: https://doi.org/10.1007/s00220-003-0806-8
intvolume: ' 235'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.hep-th/0207196'
month: '04'
oa: 1
oa_version: Preprint
page: 275 - 288
publication: Communications in Mathematical Physics
publication_identifier:
eissn:
- 1432-0916
issn:
- 0010-3616
publication_status: published
publisher: Springer Nature
publist_id: '5740'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On Yang-Mills instantons over multi-centered gravitational instantons
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 235
year: '2003'
...
---
_id: '166'
abstract:
- lang: eng
text: For any number field k, upper bounds are established for the number of k-rational
points of bounded height on non-singular del Pezzo surfaces defined over k, which
are equipped with suitable conic bundle structures over k.
alternative_title:
- Bonner mathematische Schriften
arxiv: 1
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: M
full_name: Swarbick Jones, M
last_name: Swarbick Jones
citation:
ama: Browning TD, Swarbick Jones M. Counting rational points on del Pezzo surfaces
of degree 5. Proceedings of the Bonn session in analytic number theory and
diophantine equations. 2003;360.
apa: Browning, T. D., & Swarbick Jones, M. (2003). Counting rational points
on del Pezzo surfaces of degree 5. Proceedings of the Bonn Session in Analytic
Number Theory and Diophantine Equations. Mathematisches Institut der Universität
Bonn.
chicago: Browning, Timothy D, and M Swarbick Jones. “Counting Rational Points on
Del Pezzo Surfaces of Degree 5.” Proceedings of the Bonn Session in Analytic
Number Theory and Diophantine Equations. Mathematisches Institut der Universität
Bonn, 2003.
ieee: T. D. Browning and M. Swarbick Jones, “Counting rational points on del Pezzo
surfaces of degree 5,” Proceedings of the Bonn session in analytic number theory
and diophantine equations, vol. 360. Mathematisches Institut der Universität
Bonn, 2003.
ista: Browning TD, Swarbick Jones M. 2003. Counting rational points on del Pezzo
surfaces of degree 5. Proceedings of the Bonn session in analytic number theory
and diophantine equations. 360.
mla: Browning, Timothy D., and M. Swarbick Jones. “Counting Rational Points on Del
Pezzo Surfaces of Degree 5.” Proceedings of the Bonn Session in Analytic Number
Theory and Diophantine Equations, vol. 360, Mathematisches Institut der Universität
Bonn, 2003.
short: T.D. Browning, M. Swarbick Jones, Proceedings of the Bonn Session in Analytic
Number Theory and Diophantine Equations 360 (2003).
date_created: 2018-12-11T11:44:58Z
date_published: 2003-01-01T00:00:00Z
date_updated: 2021-01-12T06:52:20Z
day: '01'
extern: '1'
external_id:
arxiv:
- '1311.1665'
intvolume: ' 360'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1311.1665
month: '01'
oa: 1
oa_version: None
publication: Proceedings of the Bonn session in analytic number theory and diophantine
equations
publication_status: published
publisher: Mathematisches Institut der Universität Bonn
publist_id: '7755'
status: public
title: Counting rational points on del Pezzo surfaces of degree 5
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 360
year: '2003'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '1959'
abstract:
- lang: eng
text: 'The molecular organization of bacterial NADH: ubiquinone oxidoreductase (complex
I or NDH-1) is not established, apart from a rough separation into dehydrogenase,
connecting and membrane domains. In this work, complex I was purified from Escherichia
coli and fragmented by replacing dodecylmaltoside with other detergents. Exchange
into decyl maltoside led to the removal of the hydrophobic subunit NuoL from the
otherwise intact complex. Diheptanoyl phosphocholine led to the loss of NuoL and
NuoM subunits, whereas other subunits remained in the complex. The presence of
N,N-dimethyldodecylamine N-oxide or Triton X-100 led to further disruption of
the membrane domain into fragments containing NuoL/M/N, NuoA/K/N, and NuoH/J subunits.
Among the hydrophilic subunits, NuoCD was most readily dissociated from the complex,
whereas NuoB was partially dissociated from the peripheral arm assembly in N,N-dimethyldodecylamine
N-oxide. A model of subunit arrangement in bacterial complex I based on these
data is proposed. Subunits NuoL and NuoM, which are homologous to antiporters
and are implicated in proton pumping, are located at the distal end of the membrane
arm, spatially separated from the redox centers of the peripheral arm. This is
consistent with proposals that the mechanism of proton pumping by complex I is
likely to involve long range conformational changes.'
acknowledgement: his work was supported by the Medical Research Council.
article_processing_charge: No
article_type: original
author:
- first_name: Peter
full_name: Holt, Peter
last_name: Holt
- first_name: David
full_name: Morgan, David
last_name: Morgan
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: 'Holt P, Morgan D, Sazanov LA. The location of NuoL and NuoM subunits in the
membrane domain of the Escherichia coli Complex I: implications for the mechanism
of proton pumping. Journal of Biological Chemistry. 2003;278(44):43114-43120.
doi:10.1074/jbc.M308247200'
apa: 'Holt, P., Morgan, D., & Sazanov, L. A. (2003). The location of NuoL and
NuoM subunits in the membrane domain of the Escherichia coli Complex I: implications
for the mechanism of proton pumping. Journal of Biological Chemistry. American
Society for Biochemistry and Molecular Biology. https://doi.org/10.1074/jbc.M308247200'
chicago: 'Holt, Peter, David Morgan, and Leonid A Sazanov. “The Location of NuoL
and NuoM Subunits in the Membrane Domain of the Escherichia Coli Complex I: Implications
for the Mechanism of Proton Pumping.” Journal of Biological Chemistry.
American Society for Biochemistry and Molecular Biology, 2003. https://doi.org/10.1074/jbc.M308247200.'
ieee: 'P. Holt, D. Morgan, and L. A. Sazanov, “The location of NuoL and NuoM subunits
in the membrane domain of the Escherichia coli Complex I: implications for the
mechanism of proton pumping,” Journal of Biological Chemistry, vol. 278,
no. 44. American Society for Biochemistry and Molecular Biology, pp. 43114–43120,
2003.'
ista: 'Holt P, Morgan D, Sazanov LA. 2003. The location of NuoL and NuoM subunits
in the membrane domain of the Escherichia coli Complex I: implications for the
mechanism of proton pumping. Journal of Biological Chemistry. 278(44), 43114–43120.'
mla: 'Holt, Peter, et al. “The Location of NuoL and NuoM Subunits in the Membrane
Domain of the Escherichia Coli Complex I: Implications for the Mechanism of Proton
Pumping.” Journal of Biological Chemistry, vol. 278, no. 44, American Society
for Biochemistry and Molecular Biology, 2003, pp. 43114–20, doi:10.1074/jbc.M308247200.'
short: P. Holt, D. Morgan, L.A. Sazanov, Journal of Biological Chemistry 278 (2003)
43114–43120.
date_created: 2018-12-11T11:54:55Z
date_published: 2003-10-31T00:00:00Z
date_updated: 2026-05-28T11:41:17Z
day: '31'
doi: 10.1074/jbc.M308247200
extern: '1'
external_id:
pmid:
- '12923180'
fulldoi: https://doi.org/10.1074/jbc.M308247200
intvolume: ' 278'
issue: '44'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
main_file_link:
- open_access: '1'
url: https://doi.org/10.1074/jbc.M308247200
month: '10'
oa: 1
oa_version: Published Version
page: 43114 - 43120
pmid: 1
publication: Journal of Biological Chemistry
publication_identifier:
eissn:
- 1083-351X
issn:
- 0021-9258
publication_status: published
publisher: American Society for Biochemistry and Molecular Biology
publist_id: '5124'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The location of NuoL and NuoM subunits in the membrane domain of the Escherichia
coli Complex I: implications for the mechanism of proton pumping'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 278
year: '2003'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '1960'
abstract:
- lang: eng
text: NADH-ubiquinone oxidoreductase (complex I or NDH-1) was purified from the
BL21 strain of Escherichia coli using an improved procedure. The complex was effectively
stabilized by addition of divalent cations and lipids, making the preparation
suitable for structural studies. The ubiquinone reductase activity of the enzyme
was fully restored by addition of native E. coli lipids. Two different two-dimensional
crystal forms, with p2 and p3 symmetry, were obtained using lipids containing
native E. coli extracts. Analysis of the crystals showed that they are formed
by fully intact complex I in an L-shaped conformation. Activity assays and single
particle analysis indicated that complex I maintains this structure in detergent
solution and does not adopt a different conformation in the active state. Thus,
we provide the first experimental evidence that complex I from E. coli has an
L-shape in a lipid bilayer and confirm that this is also the case for the active
enzyme in solution. This suggests strongly that bacterial complex I exists in
an L-shaped conformation in vivo. Our results also indicate that native lipids
play an important role in the activation, stabilization and, as a consequence,
crystallization of purified complex I from E. coli.
article_processing_charge: No
article_type: original
author:
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
- first_name: Joe
full_name: Carroll, Joe
last_name: Carroll
- first_name: Peter
full_name: Holt, Peter
last_name: Holt
- first_name: Laurence
full_name: Toime, Laurence
last_name: Toime
- first_name: Ian
full_name: Fearnley, Ian
last_name: Fearnley
citation:
ama: Sazanov LA, Carroll J, Holt P, Toime L, Fearnley I. A role for native lipids
in the stabilization and two dimensional crystallization of the Escherichia coli
NADH ubiquinone oxidoreductase (complex I). Journal of Biological Chemistry.
2003;278(21):19483-19491. doi:10.1074/jbc.M208959200
apa: Sazanov, L. A., Carroll, J., Holt, P., Toime, L., & Fearnley, I. (2003).
A role for native lipids in the stabilization and two dimensional crystallization
of the Escherichia coli NADH ubiquinone oxidoreductase (complex I). Journal
of Biological Chemistry. American Society for Biochemistry and Molecular Biology.
https://doi.org/10.1074/jbc.M208959200
chicago: Sazanov, Leonid A, Joe Carroll, Peter Holt, Laurence Toime, and Ian Fearnley.
“A Role for Native Lipids in the Stabilization and Two Dimensional Crystallization
of the Escherichia Coli NADH Ubiquinone Oxidoreductase (Complex I).” Journal
of Biological Chemistry. American Society for Biochemistry and Molecular Biology,
2003. https://doi.org/10.1074/jbc.M208959200.
ieee: L. A. Sazanov, J. Carroll, P. Holt, L. Toime, and I. Fearnley, “A role for
native lipids in the stabilization and two dimensional crystallization of the
Escherichia coli NADH ubiquinone oxidoreductase (complex I),” Journal of Biological
Chemistry, vol. 278, no. 21. American Society for Biochemistry and Molecular
Biology, pp. 19483–19491, 2003.
ista: Sazanov LA, Carroll J, Holt P, Toime L, Fearnley I. 2003. A role for native
lipids in the stabilization and two dimensional crystallization of the Escherichia
coli NADH ubiquinone oxidoreductase (complex I). Journal of Biological Chemistry.
278(21), 19483–19491.
mla: Sazanov, Leonid A., et al. “A Role for Native Lipids in the Stabilization and
Two Dimensional Crystallization of the Escherichia Coli NADH Ubiquinone Oxidoreductase
(Complex I).” Journal of Biological Chemistry, vol. 278, no. 21, American
Society for Biochemistry and Molecular Biology, 2003, pp. 19483–91, doi:10.1074/jbc.M208959200.
short: L.A. Sazanov, J. Carroll, P. Holt, L. Toime, I. Fearnley, Journal of Biological
Chemistry 278 (2003) 19483–19491.
date_created: 2018-12-11T11:54:55Z
date_published: 2003-05-23T00:00:00Z
date_updated: 2026-05-28T11:49:06Z
day: '23'
doi: 10.1074/jbc.M208959200
extern: '1'
external_id:
pmid:
- '12637579'
fulldoi: https://doi.org/10.1074/jbc.M208959200
intvolume: ' 278'
issue: '21'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1074/jbc.M208959200
month: '05'
oa: 1
oa_version: Published Version
page: 19483 - 19491
pmid: 1
publication: Journal of Biological Chemistry
publication_identifier:
eissn:
- 1083-351X
issn:
- 0021-9258
publication_status: published
publisher: American Society for Biochemistry and Molecular Biology
publist_id: '5125'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A role for native lipids in the stabilization and two dimensional crystallization
of the Escherichia coli NADH ubiquinone oxidoreductase (complex I)
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 278
year: '2003'
...
---
_id: '4348'
abstract:
- lang: eng
text: Many questions in evolutionary biology are best addressed by comparing traits
in different species. Often such studies involve mapping characters on phylogenetic
trees. Mapping characters on trees allows the nature, number, and timing of the
transformations to be identified. The parsimony method is the only method available
for mapping morphological characters on phylogenies. Although the parsimony method
often makes reasonable reconstructions of the history of a character, it has a
number of limitations. These limitations include the inability to consider more
than a single change along a branch on a tree and the uncoupling of evolutionary
time from amount of character change. We extended a method described by Nielsen
(2002, Syst. Biol. 51:729-739) to the mapping of morphological characters under
continuous-time Markov models and demonstrate here the utility of the method for
mapping characters on trees and for identifying character correlation.
acknowledgement: "We thank J. Kohn, D. Stern, and M. Hart for sending the alignments\r\nused
in this study. J.P.H. was supported by NSF grants DEB-0075406\r\nand MCB-0075404.
R.N. was supported by NSF grant DEB-0089487."
article_processing_charge: No
article_type: original
author:
- first_name: John
full_name: Huelsenbeck, John
last_name: Huelsenbeck
- first_name: Rasmus
full_name: Nielsen, Rasmus
last_name: Nielsen
- first_name: Jonathan P
full_name: Bollback, Jonathan P
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
citation:
ama: Huelsenbeck J, Nielsen R, Bollback JP. Stochastic mapping of morphological
characters. Systematic Biology. 2003;52(2):131-158. doi:10.1080/10635150390192780
apa: Huelsenbeck, J., Nielsen, R., & Bollback, J. P. (2003). Stochastic mapping
of morphological characters. Systematic Biology. Oxford University Press.
https://doi.org/10.1080/10635150390192780
chicago: Huelsenbeck, John, Rasmus Nielsen, and Jonathan P Bollback. “Stochastic
Mapping of Morphological Characters.” Systematic Biology. Oxford University
Press, 2003. https://doi.org/10.1080/10635150390192780.
ieee: J. Huelsenbeck, R. Nielsen, and J. P. Bollback, “Stochastic mapping of morphological
characters,” Systematic Biology, vol. 52, no. 2. Oxford University Press,
pp. 131–158, 2003.
ista: Huelsenbeck J, Nielsen R, Bollback JP. 2003. Stochastic mapping of morphological
characters. Systematic Biology. 52(2), 131–158.
mla: Huelsenbeck, John, et al. “Stochastic Mapping of Morphological Characters.”
Systematic Biology, vol. 52, no. 2, Oxford University Press, 2003, pp.
131–58, doi:10.1080/10635150390192780.
short: J. Huelsenbeck, R. Nielsen, J.P. Bollback, Systematic Biology 52 (2003) 131–158.
date_created: 2018-12-11T12:08:24Z
date_published: 2003-04-01T00:00:00Z
date_updated: 2024-01-23T09:10:59Z
day: '01'
doi: 10.1080/10635150390192780
extern: '1'
external_id:
pmid:
- '12746144 '
fulldoi: https://doi.org/10.1080/10635150390192780
intvolume: ' 52'
issue: '2'
language:
- iso: eng
month: '04'
oa_version: None
page: 131 - 158
pmid: 1
publication: Systematic Biology
publication_identifier:
issn:
- '0039-7989 '
publication_status: published
publisher: Oxford University Press
publist_id: '1111'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Stochastic mapping of morphological characters
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 52
year: '2003'
...
---
_id: '4350'
abstract:
- lang: eng
text: 'The phylogeny of Crocodylia offers an unusual twist on the usual molecules
versus morphology story. The true gharial (Gavialis gangeticus) and the false
gharial (Tomistoma schlegelii), as their common names imply, have appeared in
all cladistic morphological analyses as distantly related species, convergent
upon a similar morphology. In contrast, all previous molecular studies have shown
them to be sister taxa. We present the first phylogenetic study of Crocodylia
using a nuclear gene. We cloned and sequenced the c-myc proto-oncogene from Alligator
mississippiensis to facilitate primer design and then sequenced an 1,100-base
pair fragment that includes both coding and noncoding regions and informative
indels for one species in each extant crocodylian genus and six avian outgroups.
Phylogenetic analyses using parsimony, maximum likelihood, and Bayesian inference
all strongly agreed on the same tree, which is identical to the tree found in
previous molecular analyses: Gavialis and Tomistoma are sister taxa and together
are the sister group of Crocodylidae. Kishino-Hasegawa tests rejected the morphological
tree in favor of the molecular tree. We excluded long-branch attraction and variation
in base composition among taxa as explanations for this topology. To explore the
causes of discrepancy between molecular and morphological estimates of crocodylian
phylogeny, we examined puzzling features of the morphological data using a priori
partitions of the data based on anatomical regions and investigated the effects
of different coding schemes for two obvious morphological similarities of the
two gharials.'
acknowledgement: "We thank Lou Densmore and Herb Dessauer for crocodylian tissue\r\nsamples.
Dave Swofford, Jim Wilgenbusch, and Kevin de Queiroz gave\r\nus much helpful advice.
Dave also allowed us to use an experimental\r\nversion of PAUP∗ with partitioned
likelihood, and Jim also provided\r\nprograms to make possible partitioned model
KH tests. Chris Brochu\r\nand Lou Densmore sent us preprints of their papers in
press, and Chris\r\nprovided an unpublished version of his morphological data set.
Allan\r\nBaker, Lou Densmore, and an anonymous reviewer provided useful\r\ncomments
on the manuscript. We especially wish to acknowledge Chris\r\nBrochu’s help; although
we remain in disagreement on many points,\r\nhis comments on several previous drafts
have greatly improved this\r\npaper."
article_processing_charge: No
article_type: original
author:
- first_name: John
full_name: Harshman, John
last_name: Harshman
- first_name: Christopher
full_name: Huddleston, Christopher
last_name: Huddleston
- first_name: Jonathan P
full_name: Bollback, Jonathan P
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
- first_name: Thomas
full_name: Parsons, Thomas
last_name: Parsons
- first_name: Michael
full_name: Braun, Michael
last_name: Braun
citation:
ama: 'Harshman J, Huddleston C, Bollback JP, Parsons T, Braun M. True and false
gharials: A nuclear gene phylogeny of crocodylia. Systematic Biology. 2003;52(3):386-402.
doi:10.1080/10635150390197028'
apa: 'Harshman, J., Huddleston, C., Bollback, J. P., Parsons, T., & Braun, M.
(2003). True and false gharials: A nuclear gene phylogeny of crocodylia. Systematic
Biology. Oxford University Press. https://doi.org/10.1080/10635150390197028'
chicago: 'Harshman, John, Christopher Huddleston, Jonathan P Bollback, Thomas Parsons,
and Michael Braun. “True and False Gharials: A Nuclear Gene Phylogeny of Crocodylia.”
Systematic Biology. Oxford University Press, 2003. https://doi.org/10.1080/10635150390197028.'
ieee: 'J. Harshman, C. Huddleston, J. P. Bollback, T. Parsons, and M. Braun, “True
and false gharials: A nuclear gene phylogeny of crocodylia,” Systematic Biology,
vol. 52, no. 3. Oxford University Press, pp. 386–402, 2003.'
ista: 'Harshman J, Huddleston C, Bollback JP, Parsons T, Braun M. 2003. True and
false gharials: A nuclear gene phylogeny of crocodylia. Systematic Biology. 52(3),
386–402.'
mla: 'Harshman, John, et al. “True and False Gharials: A Nuclear Gene Phylogeny
of Crocodylia.” Systematic Biology, vol. 52, no. 3, Oxford University Press,
2003, pp. 386–402, doi:10.1080/10635150390197028.'
short: J. Harshman, C. Huddleston, J.P. Bollback, T. Parsons, M. Braun, Systematic
Biology 52 (2003) 386–402.
date_created: 2018-12-11T12:08:24Z
date_published: 2003-06-01T00:00:00Z
date_updated: 2024-01-23T08:53:58Z
day: '01'
doi: 10.1080/10635150390197028
extern: '1'
external_id:
pmid:
- ' 12775527'
fulldoi: https://doi.org/10.1080/10635150390197028
intvolume: ' 52'
issue: '3'
language:
- iso: eng
month: '06'
oa_version: None
page: 386 - 402
pmid: 1
publication: Systematic Biology
publication_identifier:
issn:
- '0039-7989 '
publication_status: published
publisher: Oxford University Press
publist_id: '1110'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'True and false gharials: A nuclear gene phylogeny of crocodylia'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 52
year: '2003'
...
---
_id: '4416'
abstract:
- lang: eng
text: "Methods for the formal specification and verification of systems are indispensible
for the development of complex yet correct systems. In formal verification, the
designer describes the system in a modeling language with a well-defined semantics,
and this system description is analyzed against a set of correctness requirements.
Model checking is an algorithmic technique to check that a system description
indeed satisfies correctness requirements given as logical specifications. While
successful in hardware verification, the potential for model checking for software
and embedded systems has not yet been realized. This is because traditional model
checking focuses on systems modeled as finite state-transition graphs. While a
natural model for hardware (especially synchronous hardware), state-transition
graphs often do not capture software and embedded systems at an appropriate level
of granularity. This dissertation considers two orthogonal extensions to finite
state-transition graphs making model checking techniques applicable to both a
wider class of systems and a wider class of properties.\r\n\r\nThe first direction
is an extension to infinite-state structures finitely represented using constraints
and operations on constraints. Infinite state arises when we wish to model variables
with unbounded range (e.g., integers), or data structures, or real time. We provide
a uniform framework of symbolic region algebras to study model checking of infinite-state
systems. We also provide sufficient language-independent termination conditions
for symbolic model checking algorithms on infinite state systems.\r\n\r\nThe second
direction supplements verification with game theoretic reasoning. Games are natural
models for interactions between components. We study game theoretic behavior with
winning conditions given by temporal logic objectives both in the deterministic
and in the probabilistic context. For deterministic games, we provide an extremal
model characterization of fixpoint algorithms that link solutions of verification
problems to solutions for games. For probabilistic games we study fixpoint characterization
of winning probabilities for games with omega-regular winning objectives, and
construct (epsilon-)optimal winning strategies."
article_processing_charge: No
author:
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: Majumdar R. Symbolic algorithms for verification and control. 2003:1-201.
apa: Majumdar, R. (2003). Symbolic algorithms for verification and control.
University of California, Berkeley.
chicago: Majumdar, Ritankar. “Symbolic Algorithms for Verification and Control.”
University of California, Berkeley, 2003.
ieee: R. Majumdar, “Symbolic algorithms for verification and control,” University
of California, Berkeley, 2003.
ista: Majumdar R. 2003. Symbolic algorithms for verification and control. University
of California, Berkeley.
mla: Majumdar, Ritankar. Symbolic Algorithms for Verification and Control.
University of California, Berkeley, 2003, pp. 1–201.
short: R. Majumdar, Symbolic Algorithms for Verification and Control, University
of California, Berkeley, 2003.
date_created: 2018-12-11T12:08:44Z
date_published: 2003-12-01T00:00:00Z
date_updated: 2021-01-12T07:56:49Z
day: '01'
extern: '1'
language:
- iso: eng
month: '12'
oa_version: None
page: 1 - 201
publication_status: published
publisher: University of California, Berkeley
publist_id: '313'
status: public
supervisor:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
title: Symbolic algorithms for verification and control
type: dissertation
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2003'
...
---
_id: '4425'
abstract:
- lang: eng
text: "Giotto provides a time-triggered programmer’s model for the implementation
of embedded control systems with hard real-time constraints. Giotto’s precise
semantics and predictabil- ity make it suitable for safety-critical applications.\r\nGiotto
is based around the idea that time-triggered task invocation together with time-triggered
mode switching can form a useful programming model for real-time systems. To substantiate
this claim, we describe the use of Giotto to refactor the software of a small,
autonomous helicopter. The ease with which Giotto expresses the existing software
provides evidence that Giotto is an appropriate programming language for control
systems.\r\nSince Giotto is a real-time programming language, ensuring that Giotto
programs meet their deadlines is crucial. To study precedence-constrained Giotto
scheduling, we first examine single-mode, single-processor scheduling. We extend
to an infinite, periodic setting the classical problem of meeting deadlines for
a set of tasks with release times, deadlines, precedence constraints, and preemption.
We then develop an algorithm for scheduling Giotto programs on a single processor
by representing Giotto programs as instances of the extended scheduling problem.\r\nNext,
we study multi-mode, single-processor Giotto scheduling. This problem is different
from classical scheduling problems, since in our precedence-constrained approach,
the deadlines of tasks may vary depending on the mode switching behavior of the
program. We present conditional scheduling models which capture this varying-deadline
behavior. We develop polynomial-time algorithms for some conditional scheduling
models, and prove oth- ers to be computationally hard. We show how to represent
multi-mode Giotto programs as instances of the model, resulting in an algorithm
for scheduling multi-mode Giotto programs on a single processor.\r\nFinally, we
show that the problem of scheduling Giotto programs for multiple net- worked processors
is strongly NP-hard."
article_processing_charge: No
author:
- first_name: Benjamin
full_name: Horowitz, Benjamin
last_name: Horowitz
citation:
ama: 'Horowitz B. Giotto: A time-triggered language for embedded programming. 2003:1-237.'
apa: 'Horowitz, B. (2003). Giotto: A time-triggered language for embedded programming.
University of California, Berkeley.'
chicago: 'Horowitz, Benjamin. “Giotto: A Time-Triggered Language for Embedded Programming.”
University of California, Berkeley, 2003.'
ieee: 'B. Horowitz, “Giotto: A time-triggered language for embedded programming,”
University of California, Berkeley, 2003.'
ista: 'Horowitz B. 2003. Giotto: A time-triggered language for embedded programming.
University of California, Berkeley.'
mla: 'Horowitz, Benjamin. Giotto: A Time-Triggered Language for Embedded Programming.
University of California, Berkeley, 2003, pp. 1–237.'
short: 'B. Horowitz, Giotto: A Time-Triggered Language for Embedded Programming,
University of California, Berkeley, 2003.'
date_created: 2018-12-11T12:08:47Z
date_published: 2003-10-01T00:00:00Z
date_updated: 2021-01-12T07:56:53Z
day: '01'
extern: '1'
language:
- iso: eng
month: '10'
oa_version: None
page: 1 - 237
publication_status: published
publisher: University of California, Berkeley
publist_id: '305'
status: public
supervisor:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
title: 'Giotto: A time-triggered language for embedded programming'
type: dissertation
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2003'
...
---
_id: '4460'
abstract:
- lang: eng
text: "Symbolic model checking, which enables the automatic verification of large
systems, proceeds by calculating expressions that represent state sets. Traditionally,
symbolic model-checking tools are based on back- ward 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 usually employ formalisms with
future-time modalities, which are naturally evaluated by iterating applications
of pre. It has been 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 parts of the state space that are reachable from an initial
state and relevant for the satisfaction or violation of the specification are
explored; 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, and the post-μ
calculus is based 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 research was supported in part by the SRC contract 99-TJ-683.003
and the NSF grant CCR-9988172.
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: 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. Formal Methods in System Design. 2003;23(3):303-327. doi:10.1023/A:1026228213080
apa: Henzinger, T. A., Kupferman, O., & Qadeer, S. (2003). From pre-historic
to post-modern symbolic model checking. Formal Methods in System Design.
Springer. https://doi.org/10.1023/A:1026228213080
chicago: Henzinger, Thomas A, Orna Kupferman, and Shaz Qadeer. “From Pre-Historic
to Post-Modern Symbolic Model Checking.” Formal Methods in System Design.
Springer, 2003. https://doi.org/10.1023/A:1026228213080.
ieee: T. A. Henzinger, O. Kupferman, and S. Qadeer, “From pre-historic to post-modern
symbolic model checking,” Formal Methods in System Design, vol. 23, no.
3. Springer, pp. 303–327, 2003.
ista: Henzinger TA, Kupferman O, Qadeer S. 2003. From pre-historic to post-modern
symbolic model checking. Formal Methods in System Design. 23(3), 303–327.
mla: Henzinger, Thomas A., et al. “From Pre-Historic to Post-Modern Symbolic Model
Checking.” Formal Methods in System Design, vol. 23, no. 3, Springer, 2003,
pp. 303–27, doi:10.1023/A:1026228213080.
short: T.A. Henzinger, O. Kupferman, S. Qadeer, Formal Methods in System Design
23 (2003) 303–327.
date_created: 2018-12-11T12:08:58Z
date_published: 2003-06-20T00:00:00Z
date_updated: 2024-01-10T11:50:31Z
day: '20'
doi: 10.1023/A:1026228213080
extern: '1'
fulldoi: https://doi.org/10.1023/A:1026228213080
intvolume: ' 23'
issue: '3'
language:
- iso: eng
month: '06'
oa_version: None
page: 303 - 327
publication: Formal Methods in System Design
publication_identifier:
issn:
- 0925-9856
publication_status: published
publisher: Springer
publist_id: '268'
quality_controlled: '1'
scopus_import: '1'
status: public
title: From pre-historic to post-modern symbolic model checking
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 23
year: '2003'
...
---
_id: '4462'
abstract:
- lang: eng
text: 'A major hurdle in the algorithmic verification and control of systems is
the need to find suitable abstract models, which omit enough details to overcome
the state-explosion problem, but retain enough details to exhibit satisfaction
or controllability with respect to the specification. The paradigm of counterexample-guided
abstraction refinement suggests a fully automatic way of finding suitable abstract
models: one starts with a coarse abstraction, attempts to verify or control the
abstract model, and if this attempt fails and the abstract counterexample does
not correspond to a concrete counterexample, then one uses the spurious counterexample
to guide the refinement of the abstract model. We present a counterexample-guided
refinement algorithm for solving ω-regular control objectives. The main difficulty
is that in control, unlike in verification, counterexamples are strategies in
a game between system and controller. In the case that the controller has no choices,
our scheme subsumes known counterexample-guided refinement algorithms for the
verification of ω-regular specifications. Our algorithm is useful in all situations
where ω-regular games need to be solved, such as supervisory control, sequential
and program synthesis, and modular verification. The algorithm is fully symbolic,
and therefore applicable also to infinite-state systems.'
acknowledgement: This research was supported in part by the DARPA SEC grant F33615-C-98-3614,
the ONR grant N00014-02-1-0671, and the NSF grants CCR-9988172, CCR-0085949, and
CCR-0225610.
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: Ranjit
full_name: Jhala, Ranjit
last_name: Jhala
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: 'Henzinger TA, Jhala R, Majumdar R. Counterexample-guided control. In: Proceedings
of the 30th International Colloquium on Automata, Languages and Programming.
Vol 2719. Springer; 2003:886-902. doi:10.1007/3-540-45061-0_69'
apa: 'Henzinger, T. A., Jhala, R., & Majumdar, R. (2003). Counterexample-guided
control. In Proceedings of the 30th International Colloquium on Automata, Languages
and Programming (Vol. 2719, pp. 886–902). Eindhoven, The Netherlands: Springer.
https://doi.org/10.1007/3-540-45061-0_69'
chicago: Henzinger, Thomas A, Ranjit Jhala, and Ritankar Majumdar. “Counterexample-Guided
Control.” In Proceedings of the 30th International Colloquium on Automata,
Languages and Programming, 2719:886–902. Springer, 2003. https://doi.org/10.1007/3-540-45061-0_69.
ieee: T. A. Henzinger, R. Jhala, and R. Majumdar, “Counterexample-guided control,”
in Proceedings of the 30th International Colloquium on Automata, Languages
and Programming, Eindhoven, The Netherlands, 2003, vol. 2719, pp. 886–902.
ista: 'Henzinger TA, Jhala R, Majumdar R. 2003. Counterexample-guided control. Proceedings
of the 30th International Colloquium on Automata, Languages and Programming. ICALP:
Automata, Languages and Programming, LNCS, vol. 2719, 886–902.'
mla: Henzinger, Thomas A., et al. “Counterexample-Guided Control.” Proceedings
of the 30th International Colloquium on Automata, Languages and Programming,
vol. 2719, Springer, 2003, pp. 886–902, doi:10.1007/3-540-45061-0_69.
short: T.A. Henzinger, R. Jhala, R. Majumdar, in:, Proceedings of the 30th International
Colloquium on Automata, Languages and Programming, Springer, 2003, pp. 886–902.
conference:
end_date: 2003-07-04
location: Eindhoven, The Netherlands
name: 'ICALP: Automata, Languages and Programming'
start_date: 2003-06-30
date_created: 2018-12-11T12:08:58Z
date_published: 2003-06-25T00:00:00Z
date_updated: 2024-01-10T11:19:41Z
day: '25'
doi: 10.1007/3-540-45061-0_69
extern: '1'
fulldoi: https://doi.org/10.1007/3-540-45061-0_69
intvolume: ' 2719'
language:
- iso: eng
month: '06'
oa_version: None
page: 886 - 902
publication: Proceedings of the 30th International Colloquium on Automata, Languages
and Programming
publication_identifier:
isbn:
- '9783540404934'
publication_status: published
publisher: Springer
publist_id: '265'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Counterexample-guided control
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2719
year: '2003'
...
---
_id: '4463'
abstract:
- lang: eng
text: We present an algorithm called TAR (“Thread-modular Abstraction Refinement”)
for model checking safety properties of concurrent software. The TAR algorithm
uses thread-modular assume-guarantee reasoning to overcome the exponential complexity
in the control state of multithreaded programs. Thread modularity means that TAR
explores the state space of one thread at a time, making assumptions about how
the environment can interfere. The TAR algorithm uses counterexample-guided predicate-abstraction
refinement to overcome the usually infinite complexity in the data state of C
programs. A successive approximation scheme automatically infers the necessary
precision on data variables as well as suitable environment assumptions. The scheme
is novel in that transition relations are approximated from above, while at the
same time environment assumptions are approximated from below. In our software
verification tool BLAST we have implemented a fully automatic race checker for
multithreaded C programs which is based on the TAR algorithm. This tool has verified
a wide variety of commonly used locking idioms, including locking schemes that
are not amenable to existing dynamic and static race checkers such as ERASER or
WARLOCK.
acknowledgement: This work was supported in part by the NSF grants CCR-0085949 and
CCR-0234690, the DARPA grant F33615-00-C-1693, and the MARCO grant 98-DT-660.
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: Ranjit
full_name: Jhala, Ranjit
last_name: Jhala
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
citation:
ama: 'Henzinger TA, Jhala R, Majumdar R, Qadeer S. Thread-modular abstraction refinement.
In: Proceedings of the 15th International Conference on Computer Aided Verification.
Vol 2725. Springer; 2003:262-274. doi:10.1007/978-3-540-45069-6_27'
apa: 'Henzinger, T. A., Jhala, R., Majumdar, R., & Qadeer, S. (2003). Thread-modular
abstraction refinement. In Proceedings of the 15th International Conference
on Computer Aided Verification (Vol. 2725, pp. 262–274). Boulder, CO, USA:
Springer. https://doi.org/10.1007/978-3-540-45069-6_27'
chicago: Henzinger, Thomas A, Ranjit Jhala, Ritankar Majumdar, and Shaz Qadeer.
“Thread-Modular Abstraction Refinement.” In Proceedings of the 15th International
Conference on Computer Aided Verification, 2725:262–74. Springer, 2003. https://doi.org/10.1007/978-3-540-45069-6_27.
ieee: T. A. Henzinger, R. Jhala, R. Majumdar, and S. Qadeer, “Thread-modular abstraction
refinement,” in Proceedings of the 15th International Conference on Computer
Aided Verification, Boulder, CO, USA, 2003, vol. 2725, pp. 262–274.
ista: 'Henzinger TA, Jhala R, Majumdar R, Qadeer S. 2003. Thread-modular abstraction
refinement. Proceedings of the 15th International Conference on Computer Aided
Verification. CAV: Computer Aided Verification, LNCS, vol. 2725, 262–274.'
mla: Henzinger, Thomas A., et al. “Thread-Modular Abstraction Refinement.” Proceedings
of the 15th International Conference on Computer Aided Verification, vol.
2725, Springer, 2003, pp. 262–74, doi:10.1007/978-3-540-45069-6_27.
short: T.A. Henzinger, R. Jhala, R. Majumdar, S. Qadeer, in:, Proceedings of the
15th International Conference on Computer Aided Verification, Springer, 2003,
pp. 262–274.
conference:
end_date: 2003-07-12
location: Boulder, CO, USA
name: 'CAV: Computer Aided Verification'
start_date: 2003-07-08
date_created: 2018-12-11T12:08:59Z
date_published: 2003-06-27T00:00:00Z
date_updated: 2024-01-10T11:05:53Z
day: '27'
doi: 10.1007/978-3-540-45069-6_27
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-45069-6_27
intvolume: ' 2725'
language:
- iso: eng
month: '06'
oa_version: None
page: 262 - 274
publication: Proceedings of the 15th International Conference on Computer Aided Verification
publication_identifier:
isbn:
- '9783540405245'
publication_status: published
publisher: Springer
publist_id: '266'
quality_controlled: '1'
status: public
title: Thread-modular abstraction refinement
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2725
year: '2003'
...
---
_id: '4464'
abstract:
- lang: eng
text: We introduce the paradigm of schedule-carrying code (SCC). A hard real-time
program can be executed on a given platform only if there exists a feasible schedule
for the real-time tasks of the program. Traditionally, a scheduler determines
the existence of a feasible schedule according to some scheduling strategy. With
SCC, a compiler proves the existence of a feasible schedule by generating executable
code that is attached to the program and represents its schedule. An SCC executable
is a real-time program that carries its schedule as code, which is produced once
and can be revalidated and executed with each use. We evaluate SCC both in theory
and practice. In theory, we give two scenarios, of nonpreemptive and distributed
scheduling for Giotto programs, where the generation of a feasible schedule is
hard, while the validation of scheduling instructions that are attached to the
programs is easy. In practice, we implement SCC and show that explicit scheduling
instructions can reduce the scheduling overhead up to 35% and can provide an efficient,
flexible, and verifiable means for compiling Giotto programs on complex architectures,
such as the TTA.
acknowledgement: This work was supported by the AFOSR MURI grant F49620-00-1-0327,
the California MICRO grant 01-037, the DARPA grant F33615-C-98-3614, the MARCO grant
98-DT-660, and the NSF grants CCR-0208875, CCR-0085949, and CCR-0225610.
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: Christoph
full_name: Kirsch, Christoph
last_name: Kirsch
- first_name: Slobodan
full_name: Matic, Slobodan
last_name: Matic
citation:
ama: 'Henzinger TA, Kirsch C, Matic S. Schedule-carrying code. In: Proceedings
of the 3rd International Conference on Embedded Software. Vol 2855. ACM; 2003:241-256.
doi:10.1007/978-3-540-45212-6_16'
apa: 'Henzinger, T. A., Kirsch, C., & Matic, S. (2003). Schedule-carrying code.
In Proceedings of the 3rd International Conference on Embedded Software
(Vol. 2855, pp. 241–256). Philadelphia, PA, USA: ACM. https://doi.org/10.1007/978-3-540-45212-6_16'
chicago: Henzinger, Thomas A, Christoph Kirsch, and Slobodan Matic. “Schedule-Carrying
Code.” In Proceedings of the 3rd International Conference on Embedded Software,
2855:241–56. ACM, 2003. https://doi.org/10.1007/978-3-540-45212-6_16.
ieee: T. A. Henzinger, C. Kirsch, and S. Matic, “Schedule-carrying code,” in Proceedings
of the 3rd International Conference on Embedded Software, Philadelphia, PA,
USA, 2003, vol. 2855, pp. 241–256.
ista: 'Henzinger TA, Kirsch C, Matic S. 2003. Schedule-carrying code. Proceedings
of the 3rd International Conference on Embedded Software. EMSOFT: Embedded Software
, LNCS, vol. 2855, 241–256.'
mla: Henzinger, Thomas A., et al. “Schedule-Carrying Code.” Proceedings of the
3rd International Conference on Embedded Software, vol. 2855, ACM, 2003, pp.
241–56, doi:10.1007/978-3-540-45212-6_16.
short: T.A. Henzinger, C. Kirsch, S. Matic, in:, Proceedings of the 3rd International
Conference on Embedded Software, ACM, 2003, pp. 241–256.
conference:
end_date: 2003-10-15
location: Philadelphia, PA, USA
name: 'EMSOFT: Embedded Software '
start_date: 2003-10-13
date_created: 2018-12-11T12:08:59Z
date_published: 2003-09-29T00:00:00Z
date_updated: 2024-01-10T11:33:57Z
day: '29'
doi: 10.1007/978-3-540-45212-6_16
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-45212-6_16
intvolume: ' 2855'
language:
- iso: eng
month: '09'
oa_version: None
page: 241 - 256
publication: Proceedings of the 3rd International Conference on Embedded Software
publication_identifier:
isbn:
- '9783540202233'
publication_status: published
publisher: ACM
publist_id: '267'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Schedule-carrying code
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2855
year: '2003'
...
---
_id: '4465'
abstract:
- lang: eng
text: Giotto is a principled, tool-supported design methodology for implementing
embedded control systems on platforms of possibly distributed sensors, actuators,
CPUs, and networks. Giotto is based on the principle that time-triggered task
invocations plus time-triggered mode switches can form the abstract essence of
programming real-time control systems. Giotto consists of a programming language
with a formal semantics, and a retargetable compiler and runtime library. Giotto
supports the automation of control system design by strictly separating platform-independent
functionality and timing concerns from platform-dependent scheduling and communication
issues. The time-triggered predictability of Giotto makes it particularly suitable
for safety-critical applications with hard real-time constraints. We illustrate
the platform independence and time-triggered execution of Giotto by coordinating
a heterogeneous flock of Intel x86 robots and Lego Mindstorms robots.
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: Benjamin
full_name: Horowitz, Benjamin
last_name: Horowitz
- first_name: Christoph
full_name: Kirsch, Christoph
last_name: Kirsch
citation:
ama: 'Henzinger TA, Horowitz B, Kirsch C. Embedded control systems development with
Giotto. In: Software-Enabled Control: Information Technology for Dynamical
Systems. Wiley-Blackwell; 2003:123-146. doi:10.1002/047172288X.ch8'
apa: 'Henzinger, T. A., Horowitz, B., & Kirsch, C. (2003). Embedded control
systems development with Giotto. In Software-Enabled Control: Information Technology
for Dynamical Systems (pp. 123–146). Wiley-Blackwell. https://doi.org/10.1002/047172288X.ch8'
chicago: 'Henzinger, Thomas A, Benjamin Horowitz, and Christoph Kirsch. “Embedded
Control Systems Development with Giotto.” In Software-Enabled Control: Information
Technology for Dynamical Systems, 123–46. Wiley-Blackwell, 2003. https://doi.org/10.1002/047172288X.ch8.'
ieee: 'T. A. Henzinger, B. Horowitz, and C. Kirsch, “Embedded control systems development
with Giotto,” in Software-Enabled Control: Information Technology for Dynamical
Systems, Wiley-Blackwell, 2003, pp. 123–146.'
ista: 'Henzinger TA, Horowitz B, Kirsch C. 2003.Embedded control systems development
with Giotto. In: Software-Enabled Control: Information Technology for Dynamical
Systems. , 123–146.'
mla: 'Henzinger, Thomas A., et al. “Embedded Control Systems Development with Giotto.”
Software-Enabled Control: Information Technology for Dynamical Systems,
Wiley-Blackwell, 2003, pp. 123–46, doi:10.1002/047172288X.ch8.'
short: 'T.A. Henzinger, B. Horowitz, C. Kirsch, in:, Software-Enabled Control: Information
Technology for Dynamical Systems, Wiley-Blackwell, 2003, pp. 123–146.'
date_created: 2018-12-11T12:08:59Z
date_published: 2003-05-20T00:00:00Z
date_updated: 2024-01-08T12:24:01Z
day: '20'
doi: 10.1002/047172288X.ch8
extern: '1'
fulldoi: https://doi.org/10.1002/047172288X.ch8
language:
- iso: eng
month: '05'
oa_version: None
page: 123 - 146
publication: 'Software-Enabled Control: Information Technology for Dynamical Systems'
publication_identifier:
isbn:
- '9780471234364 '
publication_status: published
publisher: Wiley-Blackwell
publist_id: '262'
quality_controlled: '1'
status: public
title: Embedded control systems development with Giotto
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '2003'
...
---
_id: '4466'
abstract:
- lang: eng
text: One source of complexity in the μ-calculus is its ability to specify an unbounded
number of switches between universal (AX) and existential (EX) branching modes.
We therefore study the problems of satisfiability, validity, model checking, and
implication for the universal and existential fragments of the μ-calculus, in
which only one branching mode is allowed. The universal fragment is rich enough
to express most specifications of interest, and therefore improved algorithms
are of practical importance. We show that while the satisfiability and validity
problems become indeed simpler for the existential and universal fragments, this
is, unfortunately, not the case for model checking and implication. We also show
the corresponding results for the alternationfree fragment of the μ-calculus,
where no alternations between least and greatest fixed points are allowed. Our
results imply that efforts to find a polynomial-time model-checking algorithm
for the μ-calculus can be replaced by efforts to find such an algorithm for the
universal or existential fragment.
acknowledgement: This work was supported in part by NSF grant CCR-9988172, the AFOSR
MURI grant F49620-00-1-0327, and a Microsoft Research Fellowship.
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: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: 'Henzinger TA, Kupferman O, Majumdar R. On the universal and existential fragments
of the mu-calculus. In: Proceedings of the 9th International Conference on
Tools and Algorithms for the Construction and Analysis of Systems . Vol 2619.
Springer; 2003:49-64. doi:10.1007/3-540-36577-X_5'
apa: 'Henzinger, T. A., Kupferman, O., & Majumdar, R. (2003). On the universal
and existential fragments of the mu-calculus. In Proceedings of the 9th International
Conference on Tools and Algorithms for the Construction and Analysis of Systems
(Vol. 2619, pp. 49–64). Warsaw, Poland: Springer. https://doi.org/10.1007/3-540-36577-X_5'
chicago: Henzinger, Thomas A, Orna Kupferman, and Ritankar Majumdar. “On the Universal
and Existential Fragments of the Mu-Calculus.” In Proceedings of the 9th International
Conference on Tools and Algorithms for the Construction and Analysis of Systems
, 2619:49–64. Springer, 2003. https://doi.org/10.1007/3-540-36577-X_5.
ieee: T. A. Henzinger, O. Kupferman, and R. Majumdar, “On the universal and existential
fragments of the mu-calculus,” in Proceedings of the 9th International Conference
on Tools and Algorithms for the Construction and Analysis of Systems , Warsaw,
Poland, 2003, vol. 2619, pp. 49–64.
ista: 'Henzinger TA, Kupferman O, Majumdar R. 2003. On the universal and existential
fragments of the mu-calculus. Proceedings of the 9th International Conference
on Tools and Algorithms for the Construction and Analysis of Systems . TACAS:
Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol.
2619, 49–64.'
mla: Henzinger, Thomas A., et al. “On the Universal and Existential Fragments of
the Mu-Calculus.” Proceedings of the 9th International Conference on Tools
and Algorithms for the Construction and Analysis of Systems , vol. 2619, Springer,
2003, pp. 49–64, doi:10.1007/3-540-36577-X_5.
short: T.A. Henzinger, O. Kupferman, R. Majumdar, in:, Proceedings of the 9th International
Conference on Tools and Algorithms for the Construction and Analysis of Systems
, Springer, 2003, pp. 49–64.
conference:
end_date: 2003-04-11
location: Warsaw, Poland
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2003-04-07
date_created: 2018-12-11T12:08:59Z
date_published: 2003-03-14T00:00:00Z
date_updated: 2024-01-08T13:17:35Z
day: '14'
doi: 10.1007/3-540-36577-X_5
extern: '1'
fulldoi: https://doi.org/10.1007/3-540-36577-X_5
intvolume: ' 2619'
language:
- iso: eng
month: '03'
oa_version: None
page: 49 - 64
publication: 'Proceedings of the 9th International Conference on Tools and Algorithms
for the Construction and Analysis of Systems '
publication_identifier:
isbn:
- '9783540008989'
publication_status: published
publisher: Springer
publist_id: '263'
quality_controlled: '1'
status: public
title: On the universal and existential fragments of the mu-calculus
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2619
year: '2003'
...
---
_id: '4467'
abstract:
- lang: eng
text: 'BLAST (the Berkeley Lazy Abstraction Software verification Tool) is a verification
system for checking safety properties of C programs using automatic property-driven
construction and model checking of software abstractions. Blast implements an
abstract-model check-refine loop to check for reachability of a specified label
in the program. The abstract model is built on the fly using predicate abstraction.
This model is then checked for reachability. If there is no (abstract) path to
the specified error label, Blast reports that the system is safe and produces
a succinct proof. Otherwise, it checks if the path is feasible using symbolic
execution of the program. If the path is feasible, Blast outputs the path as an
error trace, otherwise, it uses the infeasibility of the path to refine the abstract
model. Blast short-circuits the loop from abstraction to verification to refinement,
integrating the three steps tightly through “lazy abstraction” [5]. This integration
can offer significant advantages in performance by avoiding the repetition of
work from one iteration of the loop to the next. '
acknowledgement: This work was supported in part by the NSF grants CCR-0085949 and
CCR-9988172, the DARPA PCES grant F33615-00-C-1693, the MARCO GSRC grant 98-DT-660,
and a Microsoft Research Fellowship.
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: Ranjit
full_name: Jhala, Ranjit
last_name: Jhala
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
- first_name: Grégoire
full_name: Sutre, Grégoire
last_name: Sutre
citation:
ama: 'Henzinger TA, Jhala R, Majumdar R, Sutre G. Software verification with BLAST.
In: Proceedings of the 10th International SPIN Workshop . Vol 2648. Springer;
2003:235-239. doi:10.1007/3-540-44829-2_17'
apa: 'Henzinger, T. A., Jhala, R., Majumdar, R., & Sutre, G. (2003). Software
verification with BLAST. In Proceedings of the 10th International SPIN Workshop
(Vol. 2648, pp. 235–239). Portland, OR, USA: Springer. https://doi.org/10.1007/3-540-44829-2_17'
chicago: Henzinger, Thomas A, Ranjit Jhala, Ritankar Majumdar, and Grégoire Sutre.
“Software Verification with BLAST.” In Proceedings of the 10th International
SPIN Workshop , 2648:235–39. Springer, 2003. https://doi.org/10.1007/3-540-44829-2_17.
ieee: T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre, “Software verification
with BLAST,” in Proceedings of the 10th International SPIN Workshop , Portland,
OR, USA, 2003, vol. 2648, pp. 235–239.
ista: 'Henzinger TA, Jhala R, Majumdar R, Sutre G. 2003. Software verification with
BLAST. Proceedings of the 10th International SPIN Workshop . SPIN: Model Checking
Software, LNCS, vol. 2648, 235–239.'
mla: Henzinger, Thomas A., et al. “Software Verification with BLAST.” Proceedings
of the 10th International SPIN Workshop , vol. 2648, Springer, 2003, pp. 235–39,
doi:10.1007/3-540-44829-2_17.
short: T.A. Henzinger, R. Jhala, R. Majumdar, G. Sutre, in:, Proceedings of the
10th International SPIN Workshop , Springer, 2003, pp. 235–239.
conference:
end_date: 2003-05-10
location: Portland, OR, USA
name: 'SPIN: Model Checking Software'
start_date: 2003-05-09
date_created: 2018-12-11T12:09:00Z
date_published: 2003-04-28T00:00:00Z
date_updated: 2024-01-08T14:05:29Z
day: '28'
doi: 10.1007/3-540-44829-2_17
extern: '1'
fulldoi: https://doi.org/10.1007/3-540-44829-2_17
intvolume: ' 2648'
language:
- iso: eng
month: '04'
oa_version: None
page: 235 - 239
publication: 'Proceedings of the 10th International SPIN Workshop '
publication_identifier:
isbn:
- '9783540401179'
publication_status: published
publisher: Springer
publist_id: '264'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Software verification with BLAST
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2648
year: '2003'
...
---
_id: '4468'
abstract:
- lang: eng
text: Giotto is a high-level programming language for time-triggered control applications.
The authors begin with a conceptual overview of its methodology, discuss the Giotto
helicopter project, and summarize available Giotto implementations.
acknowledgement: We thank Niklaus Wirth and Walter Schaufelberger for their advice
and support of the reengineering effort of the ETH Zurich helicopter control system
using Giotto. This research was supported in part by DARPA SEC grant F33615-C-98–3614,
MARCO GSRC grant 98-DT-660, and AFOSR MURI grant F49620–00-1–0327. A preliminary
version of this article appeared as [1].
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: Christoph
full_name: Kirsch, Christoph
last_name: Kirsch
- first_name: Marco
full_name: Sanvido, Marco
last_name: Sanvido
- first_name: Wolfgang
full_name: Pree, Wolfgang
last_name: Pree
citation:
ama: Henzinger TA, Kirsch C, Sanvido M, Pree W. From control models to real-time
code using Giotto. IEEE Control Systems Magazine. 2003;23(1):50-64. doi:10.1109/MCS.2003.1172829
apa: Henzinger, T. A., Kirsch, C., Sanvido, M., & Pree, W. (2003). From control
models to real-time code using Giotto. IEEE Control Systems Magazine. IEEE.
https://doi.org/10.1109/MCS.2003.1172829
chicago: Henzinger, Thomas A, Christoph Kirsch, Marco Sanvido, and Wolfgang Pree.
“From Control Models to Real-Time Code Using Giotto.” IEEE Control Systems
Magazine. IEEE, 2003. https://doi.org/10.1109/MCS.2003.1172829.
ieee: T. A. Henzinger, C. Kirsch, M. Sanvido, and W. Pree, “From control models
to real-time code using Giotto,” IEEE Control Systems Magazine, vol. 23,
no. 1. IEEE, pp. 50–64, 2003.
ista: Henzinger TA, Kirsch C, Sanvido M, Pree W. 2003. From control models to real-time
code using Giotto. IEEE Control Systems Magazine. 23(1), 50–64.
mla: Henzinger, Thomas A., et al. “From Control Models to Real-Time Code Using Giotto.”
IEEE Control Systems Magazine, vol. 23, no. 1, IEEE, 2003, pp. 50–64, doi:10.1109/MCS.2003.1172829.
short: T.A. Henzinger, C. Kirsch, M. Sanvido, W. Pree, IEEE Control Systems Magazine
23 (2003) 50–64.
date_created: 2018-12-11T12:09:00Z
date_published: 2003-01-29T00:00:00Z
date_updated: 2024-01-08T10:54:53Z
day: '29'
doi: 10.1109/MCS.2003.1172829
extern: '1'
fulldoi: https://doi.org/10.1109/MCS.2003.1172829
intvolume: ' 23'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 50 - 64
publication: IEEE Control Systems Magazine
publication_identifier:
issn:
- '1066-033X '
publication_status: published
publisher: IEEE
publist_id: '260'
quality_controlled: '1'
scopus_import: '1'
status: public
title: From control models to real-time code using Giotto
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 23
year: '2003'
...
---
_id: '4469'
abstract:
- lang: eng
text: Giotto provides an abstract programmer's model for the implementation of embedded
control systems with hard real-time constraints. A typical control application
consists of periodic software tasks together with a mode-switching logic for enabling
and disabling tasks. Giotto specifies time-triggered sensor readings, task invocations,
actuator updates, and mode switches independent of any implementation platform.
Giotto can be annotated with platform constraints such as task-to-host mappings,
and task and communication schedules. The annotations are directives for the Giotto
compiler, but they do not alter the functionality and timing of a Giotto program.
By separating the platform-independent from the platform-dependent concerns, Giotto
enables a great deal of flexibility in choosing control platforms as well as a
great deal of automation in the validation and synthesis of control software.
The time-triggered nature of Giotto achieves timing predictability, which makes
Giotto particularly suitable for safety-critical applications.
acknowledgement: The authors would like to thank R. Majumdar for implementing a prototype
Giotto compiler for Lego Mindstorms robots. They would like to thank D. Derevyanko
and W. Williams for building the Intel x86 robots; and E. Lee and X. Liu for help
with implementing Giotto as a “model of computation” in Ptolemy II [26]. Finally,
they would also like to thank M. Sanvido for his suggestions on the design of the
Giotto drivers; and P. Griffiths for implementing the functionality code of the
electronic throttle controller.
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: Benjamin
full_name: Horowitz, Benjamin
last_name: Horowitz
- first_name: Christoph
full_name: Kirsch, Christoph
last_name: Kirsch
citation:
ama: 'Henzinger TA, Horowitz B, Kirsch C. Giotto: A time-triggered language for
embedded programming. Proceedings of the IEEE. 2003;91(1):84-99. doi:10.1109/JPROC.2002.805825'
apa: 'Henzinger, T. A., Horowitz, B., & Kirsch, C. (2003). Giotto: A time-triggered
language for embedded programming. Proceedings of the IEEE. IEEE. https://doi.org/10.1109/JPROC.2002.805825'
chicago: 'Henzinger, Thomas A, Benjamin Horowitz, and Christoph Kirsch. “Giotto:
A Time-Triggered Language for Embedded Programming.” Proceedings of the IEEE.
IEEE, 2003. https://doi.org/10.1109/JPROC.2002.805825.'
ieee: 'T. A. Henzinger, B. Horowitz, and C. Kirsch, “Giotto: A time-triggered language
for embedded programming,” Proceedings of the IEEE, vol. 91, no. 1. IEEE,
pp. 84–99, 2003.'
ista: 'Henzinger TA, Horowitz B, Kirsch C. 2003. Giotto: A time-triggered language
for embedded programming. Proceedings of the IEEE. 91(1), 84–99.'
mla: 'Henzinger, Thomas A., et al. “Giotto: A Time-Triggered Language for Embedded
Programming.” Proceedings of the IEEE, vol. 91, no. 1, IEEE, 2003, pp.
84–99, doi:10.1109/JPROC.2002.805825.'
short: T.A. Henzinger, B. Horowitz, C. Kirsch, Proceedings of the IEEE 91 (2003)
84–99.
date_created: 2018-12-11T12:09:00Z
date_published: 2003-01-29T00:00:00Z
date_updated: 2024-01-10T11:55:18Z
day: '29'
doi: 10.1109/JPROC.2002.805825
extern: '1'
fulldoi: https://doi.org/10.1109/JPROC.2002.805825
intvolume: ' 91'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 84 - 99
publication: Proceedings of the IEEE
publication_identifier:
issn:
- '0018-9219 '
publication_status: published
publisher: IEEE
publist_id: '261'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Giotto: A time-triggered language for embedded programming'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 91
year: '2003'
...