---
_id: '4263'
abstract:
- lang: eng
text: 'We introduce a general recursion for the probability of identity in state
of two individuals sampled from a population subject to mutation, migration, and
random drift in a two-dimensional continuum. The recursion allows for the interactions
induced by density-dependent regulation of the population, which are inevitable
in a continuous population. We give explicit series expansions for large neighbourhood
size and for low mutation rates respectively and investigate the accuracy of the
classical Malécot formula for these general models. When neighbourhood size is
small, this formula does not give the identity even over large scales. However,
for large neighbourhood size, it is an accurate approximation which summarises
the local population structure in terms of three quantities: the effective dispersal
rate, σe; the effective population density, ρe; and a local scale, κ, at which
local interactions become significant. The results are illustrated by simulations.'
acknowledgement: This work was supported by grants from the EPSRC (GR/L10048 and an
advanced fellowship for A.M.E.) and NERC (GR3/11635) and by the Darwin Trust of
Edinburgh. We thank Anja Sturm for her assistance with the project and anonymous
reviewers for helpful comments. This paper is dedicated to Charlotte, A.M.E.’s daughter
born during the gestation of the manuscript.
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: Frantz
full_name: Depaulis, Frantz
last_name: Depaulis
- first_name: Alison
full_name: Etheridge, Alison
last_name: Etheridge
citation:
ama: Barton NH, Depaulis F, Etheridge A. Neutral evolution in spatially continuous
populations. Theoretical Population Biology. 2002;61(1):31-48. doi:10.1006/tpbi.2001.1557
apa: Barton, N. H., Depaulis, F., & Etheridge, A. (2002). Neutral evolution
in spatially continuous populations. Theoretical Population Biology. Academic
Press. https://doi.org/10.1006/tpbi.2001.1557
chicago: Barton, Nicholas H, Frantz Depaulis, and Alison Etheridge. “Neutral Evolution
in Spatially Continuous Populations.” Theoretical Population Biology. Academic
Press, 2002. https://doi.org/10.1006/tpbi.2001.1557.
ieee: N. H. Barton, F. Depaulis, and A. Etheridge, “Neutral evolution in spatially
continuous populations,” Theoretical Population Biology, vol. 61, no. 1.
Academic Press, pp. 31–48, 2002.
ista: Barton NH, Depaulis F, Etheridge A. 2002. Neutral evolution in spatially continuous
populations. Theoretical Population Biology. 61(1), 31–48.
mla: Barton, Nicholas H., et al. “Neutral Evolution in Spatially Continuous Populations.”
Theoretical Population Biology, vol. 61, no. 1, Academic Press, 2002, pp.
31–48, doi:10.1006/tpbi.2001.1557.
short: N.H. Barton, F. Depaulis, A. Etheridge, Theoretical Population Biology 61
(2002) 31–48.
date_created: 2018-12-11T12:07:55Z
date_published: 2002-02-01T00:00:00Z
date_updated: 2023-06-06T09:57:49Z
day: '01'
doi: 10.1006/tpbi.2001.1557
extern: '1'
external_id:
pmid:
- '11895381'
intvolume: ' 61'
issue: '1'
language:
- iso: eng
month: '02'
oa_version: None
page: 31 - 48
pmid: 1
publication: Theoretical Population Biology
publication_identifier:
issn:
- 0040-5809
publication_status: published
publisher: Academic Press
publist_id: '1830'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Neutral evolution in spatially continuous populations
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 61
year: '2002'
...
---
_id: '4347'
abstract:
- lang: eng
text: 'Phylogenetic trees can be rooted by a number of criteria. Here, we introduce
a Bayesian method for inferring the root of a phylogenetic tree by using one of
several criteria: the outgroup, molecular clock, and nonreversible model of DNA
substitution. We perform simulation analyses to examine the relative ability of
these three criteria to correctly identify the root of the tree. The outgroup
and molecular clock criteria were best able to identify the root of the tree,
whereas the nonreversible model was able to identify the root only when the substitution
process was highly nonreversible. We also examined the performance of the criteria
for a tree of four species for which the topology and root position are well supported.
Results of the analyses of these data are consistent with the simulation results.'
article_processing_charge: No
article_type: original
author:
- first_name: John
full_name: Huelsenbeck, John
last_name: Huelsenbeck
- 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: Amy
full_name: Levine, Amy
last_name: Levine
citation:
ama: Huelsenbeck J, Bollback JP, Levine A. Inferring the root of a phylogenetic
tree. Systematic Biology. 2002;51(1):32-43. doi:10.1080/106351502753475862
apa: Huelsenbeck, J., Bollback, J. P., & Levine, A. (2002). Inferring the root
of a phylogenetic tree. Systematic Biology. Oxford University Press. https://doi.org/10.1080/106351502753475862
chicago: Huelsenbeck, John, Jonathan P Bollback, and Amy Levine. “Inferring the
Root of a Phylogenetic Tree.” Systematic Biology. Oxford University Press,
2002. https://doi.org/10.1080/106351502753475862.
ieee: J. Huelsenbeck, J. P. Bollback, and A. Levine, “Inferring the root of a phylogenetic
tree,” Systematic Biology, vol. 51, no. 1. Oxford University Press, pp.
32–43, 2002.
ista: Huelsenbeck J, Bollback JP, Levine A. 2002. Inferring the root of a phylogenetic
tree. Systematic Biology. 51(1), 32–43.
mla: Huelsenbeck, John, et al. “Inferring the Root of a Phylogenetic Tree.” Systematic
Biology, vol. 51, no. 1, Oxford University Press, 2002, pp. 32–43, doi:10.1080/106351502753475862.
short: J. Huelsenbeck, J.P. Bollback, A. Levine, Systematic Biology 51 (2002) 32–43.
date_created: 2018-12-11T12:08:23Z
date_published: 2002-02-01T00:00:00Z
date_updated: 2023-06-06T09:53:27Z
day: '01'
doi: 10.1080/106351502753475862
extern: '1'
external_id:
pmid:
- '11943091'
intvolume: ' 51'
issue: '1'
language:
- iso: eng
month: '02'
oa_version: None
page: 32 - 43
pmid: 1
publication: Systematic Biology
publication_identifier:
issn:
- 0039-7989
publication_status: published
publisher: Oxford University Press
publist_id: '1113'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Inferring the root of a phylogenetic tree
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 51
year: '2002'
...
---
_id: '4349'
abstract:
- lang: eng
text: 'Bayesian inference is becoming a common statistical approach to phylogenetic
estimation because, among other reasons, it allows for rapid analysis of large
data sets with complex evolutionary models. Conveniently, Bayesian phylogenetic
methods use currently available stochastic models of sequence evolution. However,
as with other model-based approaches, the results of Bayesian inference are conditional
on the assumed model of evolution: inadequate models (models that poorly fit the
data) may result in erroneous inferences. In this article, I present a Bayesian
phylogenetic method that evaluates the adequacy of evolutionary models using posterior
predictive distributions. By evaluating a model''s posterior predictive performance,
an adequate model can be selected for a Bayesian phylogenetic study. Although
I present a single test statistic that assesses the overall (global) performance
of a phylogenetic model, a variety of test statistics can be tailored to evaluate
specific features (local performance) of evolutionary models to identify sources
failure. The method presented here, unlike the likelihood-ratio test and parametric
bootstrap, accounts for uncertainty in the phylogeny and model parameters.'
acknowledgement: "This work was supported by grants from the NSF to John Huelsenbeck
(MCB-0075404 and DEB0075406), to whom I am grateful for his support throughout this
project. Also, I would like to express my deep thanks to Andrea Betancourt, John
Huelsenbeck, Kelly Dyer, Rasmus Nielsen, and Frederick Ronquist for taking the time
to read early versions of the\r\nmanuscript. Each and every one of them provided
invaluable comments, that ultimately made the manuscript better. John Huelsenbeck,
Bret Larget, Rasmus Nielsen, Ken Karol, and Andrea Betancourt patiently listened
to me drone on about this project, and offered insightful comments that benefited
this work, and for this they have my deepest gratitude. And finally, I would like
to thank two anonymous reviewers who gave critical attention to the manuscript and
provided valuable comments."
article_processing_charge: No
article_type: original
author:
- 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: Bollback JP. Bayesian model adequacy and choice in phylogenetics. Molecular
Biology and Evolution. 2002;19(7):1171-1180. doi:10.1093/oxfordjournals.molbev.a004175
apa: Bollback, J. P. (2002). Bayesian model adequacy and choice in phylogenetics.
Molecular Biology and Evolution. Oxford University Press. https://doi.org/10.1093/oxfordjournals.molbev.a004175
chicago: Bollback, Jonathan P. “Bayesian Model Adequacy and Choice in Phylogenetics.”
Molecular Biology and Evolution. Oxford University Press, 2002. https://doi.org/10.1093/oxfordjournals.molbev.a004175.
ieee: J. P. Bollback, “Bayesian model adequacy and choice in phylogenetics,” Molecular
Biology and Evolution, vol. 19, no. 7. Oxford University Press, pp. 1171–80,
2002.
ista: Bollback JP. 2002. Bayesian model adequacy and choice in phylogenetics. Molecular
Biology and Evolution. 19(7), 1171–80.
mla: Bollback, Jonathan P. “Bayesian Model Adequacy and Choice in Phylogenetics.”
Molecular Biology and Evolution, vol. 19, no. 7, Oxford University Press,
2002, pp. 1171–80, doi:10.1093/oxfordjournals.molbev.a004175.
short: J.P. Bollback, Molecular Biology and Evolution 19 (2002) 1171–80.
date_created: 2018-12-11T12:08:24Z
date_published: 2002-03-25T00:00:00Z
date_updated: 2023-06-06T09:18:18Z
day: '25'
doi: 10.1093/oxfordjournals.molbev.a004175
extern: '1'
external_id:
pmid:
- '12082136 '
intvolume: ' 19'
issue: '7'
language:
- iso: eng
month: '03'
oa_version: None
page: 1171 - 80
pmid: 1
publication: Molecular Biology and Evolution
publication_identifier:
issn:
- 0737-4038
publication_status: published
publisher: Oxford University Press
publist_id: '1112'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bayesian model adequacy and choice in phylogenetics
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 19
year: '2002'
...
---
_id: '4407'
abstract:
- lang: eng
text: 'This paper presents a complete axiomatization of two decidable propositional
real-time linear temporal logics: Event Clock Logic (EventClockTL) and Metric
Interval Temporal Logic with past (MetricIntervalTL). The completeness proof consists
of an effective proof building procedure for EventClockTL. From this result we
obtain a complete axiomatization of MetricIntervalTL by providing axioms translating
MetricIntervalTL formulae into EventClockTL formulae, the two logics being equally
expressive. Our proof is structured to yield axiomatizations also for interesting
fragments of these logics, such as the linear temporal logic of the real numbers
(TLR).'
article_processing_charge: No
article_type: original
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. Theoretical
Computer Science. 2002;274(1-2):151-182. doi:10.1016/S0304-3975(00)00308-X
apa: Raskin, J., Schobbens, P., & Henzinger, T. A. (2002). Axioms for real-time
logics. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/S0304-3975(00)00308-X
chicago: Raskin, Jean, Pierre Schobbens, and Thomas A Henzinger. “Axioms for Real-Time
Logics.” Theoretical Computer Science. Elsevier, 2002. https://doi.org/10.1016/S0304-3975(00)00308-X.
ieee: J. Raskin, P. Schobbens, and T. A. Henzinger, “Axioms for real-time logics,”
Theoretical Computer Science, vol. 274, no. 1–2. Elsevier, pp. 151–182,
2002.
ista: Raskin J, Schobbens P, Henzinger TA. 2002. Axioms for real-time logics. Theoretical
Computer Science. 274(1–2), 151–182.
mla: Raskin, Jean, et al. “Axioms for Real-Time Logics.” Theoretical Computer
Science, vol. 274, no. 1–2, Elsevier, 2002, pp. 151–82, doi:10.1016/S0304-3975(00)00308-X.
short: J. Raskin, P. Schobbens, T.A. Henzinger, Theoretical Computer Science 274
(2002) 151–182.
date_created: 2018-12-11T12:08:42Z
date_published: 2002-03-01T00:00:00Z
date_updated: 2023-06-06T09:10:56Z
day: '01'
doi: 10.1016/S0304-3975(00)00308-X
extern: '1'
intvolume: ' 274'
issue: 1-2
language:
- iso: eng
month: '03'
oa_version: None
page: 151 - 182
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
publist_id: '324'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Axioms for real-time logics
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 274
year: '2002'
...
---
_id: '4413'
abstract:
- lang: eng
text: 'An essential problem in component-based design is how to compose components
designed in isolation. Several approaches have been proposed for specifying component
interfaces that capture behavioral aspects such as interaction protocols, and
for verifying interface compatibility. Likewise, several approaches have been
developed for synthesizing converters between incompatible protocols. In this
paper, we introduce the notion of adaptability as the property that two interfaces
have when they can be made compatible by communicating through a converter that
meets specified requirements. We show that verifying adaptability and synthesizing
an appropriate converter are two faces of the same coin: adaptability can be formalized
and solved using a game-theoretic framework, and then the converter can be synthesized
as a strategy that always wins the game. Finally we show that this framework can
be related to the rectification problem in trace theory.'
acknowledgement: "The authors would like to thank Jerry Burch of the Cadence Berkeley
Labs for many insightful discussions and suggestions.\r\n"
article_processing_charge: No
author:
- first_name: Roberto
full_name: Passerone, Roberto
last_name: Passerone
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- 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: Alberto
full_name: Sangiovanni Vincentelli, Alberto
last_name: Sangiovanni Vincentelli
citation:
ama: 'Passerone R, De Alfaro L, Henzinger TA, Sangiovanni Vincentelli A. Convertibility
verification and converter synthesis: Two faces of the same coin. In: Proceedings
of the 11th IEEE/ACM International Conference on Computer-Aided Design. IEEE;
2002:132-139. doi:10.1145/774572.774592'
apa: 'Passerone, R., De Alfaro, L., Henzinger, T. A., & Sangiovanni Vincentelli,
A. (2002). Convertibility verification and converter synthesis: Two faces of the
same coin. In Proceedings of the 11th IEEE/ACM international conference on
Computer-aided design (pp. 132–139). San Jose, CA, USA: IEEE. https://doi.org/10.1145/774572.774592'
chicago: 'Passerone, Roberto, Luca De Alfaro, Thomas A Henzinger, and Alberto Sangiovanni
Vincentelli. “Convertibility Verification and Converter Synthesis: Two Faces of
the Same Coin.” In Proceedings of the 11th IEEE/ACM International Conference
on Computer-Aided Design, 132–39. IEEE, 2002. https://doi.org/10.1145/774572.774592.'
ieee: 'R. Passerone, L. De Alfaro, T. A. Henzinger, and A. Sangiovanni Vincentelli,
“Convertibility verification and converter synthesis: Two faces of the same coin,”
in Proceedings of the 11th IEEE/ACM international conference on Computer-aided
design, San Jose, CA, USA, 2002, pp. 132–139.'
ista: 'Passerone R, De Alfaro L, Henzinger TA, Sangiovanni Vincentelli A. 2002.
Convertibility verification and converter synthesis: Two faces of the same coin.
Proceedings of the 11th IEEE/ACM international conference on Computer-aided design.
ICCAD: Computer-Aided Design, 132–139.'
mla: 'Passerone, Roberto, et al. “Convertibility Verification and Converter Synthesis:
Two Faces of the Same Coin.” Proceedings of the 11th IEEE/ACM International
Conference on Computer-Aided Design, IEEE, 2002, pp. 132–39, doi:10.1145/774572.774592.'
short: R. Passerone, L. De Alfaro, T.A. Henzinger, A. Sangiovanni Vincentelli, in:,
Proceedings of the 11th IEEE/ACM International Conference on Computer-Aided Design,
IEEE, 2002, pp. 132–139.
conference:
end_date: 2002-11-14
location: San Jose, CA, USA
name: 'ICCAD: Computer-Aided Design'
start_date: 2002-11-10
date_created: 2018-12-11T12:08:44Z
date_published: 2002-11-01T00:00:00Z
date_updated: 2023-06-05T14:21:46Z
day: '01'
doi: 10.1145/774572.774592
extern: '1'
language:
- iso: eng
month: '11'
oa_version: None
page: 132 - 139
publication: Proceedings of the 11th IEEE/ACM international conference on Computer-aided
design
publication_identifier:
isbn:
- '9780780376076'
publication_status: published
publisher: IEEE
publist_id: '318'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Convertibility verification and converter synthesis: Two faces of the same
coin'
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '2002'
...
---
_id: '4414'
abstract:
- lang: eng
text: "This dissertation investigates game-theoretic approaches to the algorithmic
analysis of concurrent, reactive systems. A concurrent system comprises a number
of components working concurrently; a reactive system maintains an ongoing interaction
with its environment. Traditional approaches to the formal analysis of concurrent
reactive systems usually view the system as an unstructured state-transition graphs;
instead, we view them as collections of interacting components, where each one
is an open system which accepts inputs from the other components. The interactions
among the components are naturally modeled as games.\r\n\r\nAdopting this game-theoretic
view, we study three related problems pertaining to the verification and synthesis
of systems. Firstly, we propose two novel game-theoretic techniques for the model-checking
of concurrent reactive systems, and improve the performance of model-checking.
The first technique discovers an error as soon as it cannot be prevented, which
can be long before it actually occurs. This technique is based on the key observation
that "unpreventability" is a local property to a module: an error is
unpreventable in a module state if no environment can prevent it. The second technique
attempts to decompose a model-checking proof into smaller proof obligations by
constructing abstract modules automatically, using reachability and "unpreventability"
information about the concrete modules. Three increasingly powerful proof decomposition
rules are proposed and we show that in practice, the resulting abstract modules
are often significantly smaller than the concrete modules and can drastically
reduce the space and time requirements for verification. Both techniques fall
into the category of compositional reasoning.\r\n\r\nSecondly, we investigate
the composition and control of synchronous systems. An essential property of synchronous
systems for compositional reasoning is non-blocking. In the composition of synchronous
systems, however, due to circular causal dependency of input and output signals,
non-blocking is not always guaranteed. Blocking compositions of systems can be
ruled out semantically, by insisting on the existence of certain fixed points,
or syntactically, by equipping systems with types, which make the dependencies
between input and output signals transparent. We characterize various typing mechanisms
in game-theoretic terms, and study their effects on the controller synthesis problem.
We show that our typing systems are general enough to capture interesting real-life
synchronous systems such as all delay-insensitive digital circuits. We then study
their corresponding single-step control problems --a restricted form of controller
synthesis problem whose solutions can be iterated in appropriate manners to solve
all LTL controller synthesis problems. We also consider versions of the controller
synthesis problem in which the type of the controller is given. We show that the
solution of these fixed-type control problems requires the evaluation of partially
ordered (Henkin) quantifiers on boolean formulas, and is therefore harder (nondeterministic
exponential time) than more traditional control questions.\r\n\r\nThirdly, we
study the synthesis of a class of open systems, namely, uninitialized state machines.
The sequential synthesis problem, which is closely related to Church's solvability
problem, asks, given a specification in the form of a binary relation between
input and output streams, for the construction of a finite-state stream transducer
that converts inputs to appropriate outputs. For efficiency reasons, practical
sequential hardware is often designed to operate without prior initialization.
Such hardware designs can be modeled by uninitialized state machines, which are
required to satisfy their specification if started from any state. We solve the
sequential synthesis problem for uninitialized systems, that is, we construct
uninitialized finite-state stream transducers. We consider specifications given
by LTL formulas, deterministic, nondeterministic, universal, and alternating Buechi
automata. We solve this uninitialized synthesis problem by reducing it to the
well-understood initialized synthesis problem. While our solution is straightforward,
it leads, for some specification formalisms, to upper bounds that are exponentially
worse than the complexity of the corresponding initialized problems. However,
we prove lower bounds to show that our simple solutions are optimal for all considered
specification formalisms. The lower bound proofs require nontrivial generic reductions."
article_processing_charge: No
author:
- first_name: Freddy
full_name: Mang, Freddy
last_name: Mang
citation:
ama: Mang F. Games in open systems verification and synthesis. 2002:1-116.
apa: Mang, F. (2002). Games in open systems verification and synthesis. University
of California, Berkeley.
chicago: Mang, Freddy. “Games in Open Systems Verification and Synthesis.” University
of California, Berkeley, 2002.
ieee: F. Mang, “Games in open systems verification and synthesis,” University of
California, Berkeley, 2002.
ista: Mang F. 2002. Games in open systems verification and synthesis. University
of California, Berkeley.
mla: Mang, Freddy. Games in Open Systems Verification and Synthesis. University
of California, Berkeley, 2002, pp. 1–116.
short: F. Mang, Games in Open Systems Verification and Synthesis, University of
California, Berkeley, 2002.
date_created: 2018-12-11T12:08:44Z
date_published: 2002-05-01T00:00:00Z
date_updated: 2021-01-12T07:56:48Z
day: '01'
extern: '1'
language:
- iso: eng
month: '05'
oa_version: None
page: 1 - 116
publication_status: published
publisher: University of California, Berkeley
publist_id: '315'
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: Games in open systems verification and synthesis
type: dissertation
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2002'
...
---
_id: '4421'
abstract:
- lang: eng
text: We demonstrate the feasibility and benefits of Giotto-based control software
development by reimplementing the autopilot system of an autonomously flying model
helicopter. Giotto offers a clean separation between the platform-independent
concerns of software functionality and I/O timing, and the platform-dependent
concerns of software scheduling and execution. Functionality code such as code
computing control laws can be generated automatically from Simulink models or,
as in the case of this project, inherited from a legacy system. I/O timing code
is generated automatically from Giotto models that specify real-time requirements
such as task frequencies and actuator update rates. We extend Simulink to support
the design of Giotto models, and from these models, the automatic generation of
Giotto code that supervises the interaction of the functionality code with the
physical environment. The Giotto compiler performs a schedulability analysis on
the Giotto code, and generates timing code for the helicopter platform. The Giotto
methodology guarantees the stringent hard real-time requirements of the autopilot
system, and at the same time supports the automation of the software development
process in a way that produces a transparent software architecture with predictable
behavior and reusable components.
acknowledgement: This research was supported in part by the DARPA SEC grant F33615-C-98-3614,
the MARCO GSRC grant 98-DT-660, and the AFOSR MURI grant F49620-00-1-0327.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Christoph
full_name: Kirsch, Christoph
last_name: Kirsch
- first_name: Marco
full_name: Sanvido, Marco
last_name: Sanvido
- 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: Wolfgang
full_name: Pree, Wolfgang
last_name: Pree
citation:
ama: 'Kirsch C, Sanvido M, Henzinger TA, Pree W. A Giotto-based helicopter control
system. In: Proceedings of the 2nd International Conference on Embedded Software.
Vol 2491. ACM; 2002:46-60. doi:10.1007/3-540-45828-X_5'
apa: 'Kirsch, C., Sanvido, M., Henzinger, T. A., & Pree, W. (2002). A Giotto-based
helicopter control system. In Proceedings of the 2nd International Conference
on Embedded Software (Vol. 2491, pp. 46–60). Grenoble, France: ACM. https://doi.org/10.1007/3-540-45828-X_5'
chicago: Kirsch, Christoph, Marco Sanvido, Thomas A Henzinger, and Wolfgang Pree.
“A Giotto-Based Helicopter Control System.” In Proceedings of the 2nd International
Conference on Embedded Software, 2491:46–60. ACM, 2002. https://doi.org/10.1007/3-540-45828-X_5.
ieee: C. Kirsch, M. Sanvido, T. A. Henzinger, and W. Pree, “A Giotto-based helicopter
control system,” in Proceedings of the 2nd International Conference on Embedded
Software, Grenoble, France, 2002, vol. 2491, pp. 46–60.
ista: 'Kirsch C, Sanvido M, Henzinger TA, Pree W. 2002. A Giotto-based helicopter
control system. Proceedings of the 2nd International Conference on Embedded Software.
EMSOFT: Embedded Software , LNCS, vol. 2491, 46–60.'
mla: Kirsch, Christoph, et al. “A Giotto-Based Helicopter Control System.” Proceedings
of the 2nd International Conference on Embedded Software, vol. 2491, ACM,
2002, pp. 46–60, doi:10.1007/3-540-45828-X_5.
short: C. Kirsch, M. Sanvido, T.A. Henzinger, W. Pree, in:, Proceedings of the 2nd
International Conference on Embedded Software, ACM, 2002, pp. 46–60.
conference:
end_date: 2002-10-09
location: Grenoble, France
name: 'EMSOFT: Embedded Software '
start_date: 2002-10-07
date_created: 2018-12-11T12:08:46Z
date_published: 2002-09-25T00:00:00Z
date_updated: 2023-06-05T13:07:20Z
day: '25'
doi: 10.1007/3-540-45828-X_5
extern: '1'
intvolume: ' 2491'
language:
- iso: eng
month: '09'
oa_version: None
page: 46 - 60
publication: Proceedings of the 2nd International Conference on Embedded Software
publication_identifier:
isbn:
- '9783540443070'
publication_status: published
publisher: ACM
publist_id: '310'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A Giotto-based helicopter control system
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2491
year: '2002'
...
---
_id: '4422'
abstract:
- lang: eng
text: "Behavioral properties of open systems can be formalized as objectives in
two-player games. Turn-based games model asynchronous interaction between the
players (the system and its environment) by interleaving their moves. Concurrent
games model synchronous interaction: the players always move simultaneously. Infinitary
winning criteria are considered: Büchi, co-Büchi, and more general parity conditions.
A generalization of determinacy for parity games to concurrent parity games demands
probabilistic (mixed) strategies: either player 1 has a mixed strategy to win
with probability 1 (almost-sure winning), or player 2 has a mixed strategy to
win with positive probability.\r\nThis work provides efficient reductions of concurrent
probabilistic Büchi and co-Büchi games to turn-based games with Büchi condition
and parity winning condition with three priorities, respectively. From a theoretical
point of view, the latter reduction shows that one can trade the probabilistic
nature of almost-sure winning for a more general parity (fairness) condition.
The reductions improve understanding of concurrent games and provide an alternative
simple proof of determinacy of concurrent Büchi and co-Büchi games. From a practical
point of view, the reductions turn solvers of turn-based games into solvers of
concurrent probabilistic games. Thus improvements in the well-studied algorithms
for the former carry over immediately to the latter. In particular, a recent improvement
in the complexity of solving turn-based parity games yields an improvement in
time complexity of solving concurrent probabilistic co-Büchi games from cubic
to quadratic."
acknowledgement: This research was supported in part by the Polish KBN grant 7-T11C-027-20,
the AFOSR MURI grant F49620-00-1-0327, and the NSF Theory grant CCR-9988172.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Marcin
full_name: Jurdziński, Marcin
last_name: Jurdziński
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
- 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: 'Jurdziński M, Kupferman O, Henzinger TA. Trading probability for fairness.
In: Proceedings of the 16th International Workshop on Computer Science Logic.
Vol 2471. Springer; 2002:292-305. doi:10.1007/3-540-45793-3_20'
apa: 'Jurdziński, M., Kupferman, O., & Henzinger, T. A. (2002). Trading probability
for fairness. In Proceedings of the 16th International Workshop on Computer
Science Logic (Vol. 2471, pp. 292–305). Edinburgh, Scotland: Springer. https://doi.org/10.1007/3-540-45793-3_20'
chicago: Jurdziński, Marcin, Orna Kupferman, and Thomas A Henzinger. “Trading Probability
for Fairness.” In Proceedings of the 16th International Workshop on Computer
Science Logic, 2471:292–305. Springer, 2002. https://doi.org/10.1007/3-540-45793-3_20.
ieee: M. Jurdziński, O. Kupferman, and T. A. Henzinger, “Trading probability for
fairness,” in Proceedings of the 16th International Workshop on Computer Science
Logic, Edinburgh, Scotland, 2002, vol. 2471, pp. 292–305.
ista: 'Jurdziński M, Kupferman O, Henzinger TA. 2002. Trading probability for fairness.
Proceedings of the 16th International Workshop on Computer Science Logic. CSL:
Computer Science Logic, LNCS, vol. 2471, 292–305.'
mla: Jurdziński, Marcin, et al. “Trading Probability for Fairness.” Proceedings
of the 16th International Workshop on Computer Science Logic, vol. 2471, Springer,
2002, pp. 292–305, doi:10.1007/3-540-45793-3_20.
short: M. Jurdziński, O. Kupferman, T.A. Henzinger, in:, Proceedings of the 16th
International Workshop on Computer Science Logic, Springer, 2002, pp. 292–305.
conference:
location: Edinburgh, Scotland
name: 'CSL: Computer Science Logic'
date_created: 2018-12-11T12:08:46Z
date_published: 2002-09-09T00:00:00Z
date_updated: 2023-06-05T10:02:54Z
day: '09'
doi: 10.1007/3-540-45793-3_20
extern: '1'
intvolume: ' 2471'
language:
- iso: eng
month: '09'
oa_version: None
page: 292 - 305
publication: Proceedings of the 16th International Workshop on Computer Science Logic
publication_identifier:
isbn:
- '9783540442400'
publication_status: published
publisher: Springer
publist_id: '308'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Trading probability for fairness
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2471
year: '2002'
...
---
_id: '4423'
abstract:
- lang: eng
text: Automation control systems typically incorporate legacy code and components
that were originally designed to operate independently. Furthermore, they operate
under stringent safety and timing constraints. Current design strategies deal
with these requirements and characteristics with ad hoc approaches. In particular,
when designing control laws, implementation constraints are often ignored or cursorily
estimated. Indeed, costly redesigns are needed after a prototype of the control
system is built due to missed timing constraints and subtle transient errors.
In this paper, we use the concepts of platform-based design, and the Giotto programming
language, to develop a methodology for the design of automation control systems
that builds in modularity and correct-by-construction procedures. We illustrate
our strategy by describing the (successful) application of the methodology to
the design of a time-based control system for a rotorcraft Uninhabited Aerial
Vehicle (UAV).
acknowledgement: "Research supported in part by DARPA under contract no.F33615-98-C-3614,
Software Enabled Control, administered by\r\nAFRL, Dayton OH."
article_processing_charge: No
author:
- first_name: Benjamin
full_name: Horowitz, Benjamin
last_name: Horowitz
- first_name: Judith
full_name: Liebman, Judith
last_name: Liebman
- first_name: Cedric
full_name: Ma, Cedric
last_name: Ma
- first_name: T John
full_name: Koo, T John
last_name: Koo
- 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: Alberto
full_name: Sangiovanni Vincentelli, Alberto
last_name: Sangiovanni Vincentelli
- first_name: Shankar
full_name: Sastry, Shankar
last_name: Sastry
citation:
ama: 'Horowitz B, Liebman J, Ma C, et al. Embedded software design and system integration
for rotorcraft UAV using platforms. In: Proceedings of the 15th Triennial World
Congress of the International Federation of Automatic Control. Vol 15. Elsevier;
2002. doi:10.3182/20020721-6-ES-1901.01628'
apa: 'Horowitz, B., Liebman, J., Ma, C., Koo, T. J., Henzinger, T. A., Sangiovanni
Vincentelli, A., & Sastry, S. (2002). Embedded software design and system
integration for rotorcraft UAV using platforms. In Proceedings of the 15th
Triennial World Congress of the International Federation of Automatic Control
(Vol. 15). Barcelona, Spain: Elsevier. https://doi.org/10.3182/20020721-6-ES-1901.01628'
chicago: Horowitz, Benjamin, Judith Liebman, Cedric Ma, T John Koo, Thomas A Henzinger,
Alberto Sangiovanni Vincentelli, and Shankar Sastry. “Embedded Software Design
and System Integration for Rotorcraft UAV Using Platforms.” In Proceedings
of the 15th Triennial World Congress of the International Federation of Automatic
Control, Vol. 15. Elsevier, 2002. https://doi.org/10.3182/20020721-6-ES-1901.01628.
ieee: B. Horowitz et al., “Embedded software design and system integration
for rotorcraft UAV using platforms,” in Proceedings of the 15th Triennial World
Congress of the International Federation of Automatic Control, Barcelona,
Spain, 2002, vol. 15, no. 1.
ista: 'Horowitz B, Liebman J, Ma C, Koo TJ, Henzinger TA, Sangiovanni Vincentelli
A, Sastry S. 2002. Embedded software design and system integration for rotorcraft
UAV using platforms. Proceedings of the 15th Triennial World Congress of the International
Federation of Automatic Control. IFAC: World Congress on Automatic Control vol.
15.'
mla: Horowitz, Benjamin, et al. “Embedded Software Design and System Integration
for Rotorcraft UAV Using Platforms.” Proceedings of the 15th Triennial World
Congress of the International Federation of Automatic Control, vol. 15, no.
1, Elsevier, 2002, doi:10.3182/20020721-6-ES-1901.01628.
short: B. Horowitz, J. Liebman, C. Ma, T.J. Koo, T.A. Henzinger, A. Sangiovanni
Vincentelli, S. Sastry, in:, Proceedings of the 15th Triennial World Congress
of the International Federation of Automatic Control, Elsevier, 2002.
conference:
end_date: 2002-07-26
location: Barcelona, Spain
name: 'IFAC: World Congress on Automatic Control'
start_date: 2002-07-21
date_created: 2018-12-11T12:08:47Z
date_published: 2002-07-01T00:00:00Z
date_updated: 2023-06-05T09:55:10Z
day: '01'
doi: 10.3182/20020721-6-ES-1901.01628
extern: '1'
intvolume: ' 15'
issue: '1'
language:
- iso: eng
month: '07'
oa_version: None
publication: Proceedings of the 15th Triennial World Congress of the International
Federation of Automatic Control
publication_identifier:
issn:
- 1474-6670
publication_status: published
publisher: Elsevier
publist_id: '306'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Embedded software design and system integration for rotorcraft UAV using platforms
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 15
year: '2002'
...
---
_id: '4444'
abstract:
- lang: eng
text: The Embedded Machine is a virtual machine that mediates in real time the interaction
between software processes and physical processes. It separates the compilation
of embedded programs into two phases. The first, platform-independent compiler
phase generates E code (code executed by the Embedded Machine), which supervises
the timing ---not the scheduling--- of application tasks relative to external
events, such as clock ticks and sensor interrupts. E~code is portable and exhibits,
given an input behavior, predictable (i.e., deterministic) timing and output behavior.
The second, platform-dependent compiler phase checks the time safety of the E
code, that is, whether platform performance (determined by the hardware) and platform
utilization (determined by the scheduler of the operating system) enable its timely
execution. We have used the Embedded Machine to compile and execute high-performance
control applications written in Giotto, such as the flight control system of an
autonomous model helicopter.
acknowledgement: This research was supported in part by the DARPA SEC grant F33615-C-98-3614,
the MARCO GSRC grant 98-DT- 660, the AFOSR MURI grant F49620-00-1-0327, and the
NSF ITR grant CCR-0085949.
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
citation:
ama: 'Henzinger TA, Kirsch C. The embedded machine: predictable, portable real-time
code. In: Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language
Design and Implementation. ACM; 2002:315-326. doi:10.1145/512529.512567'
apa: 'Henzinger, T. A., & Kirsch, C. (2002). The embedded machine: predictable,
portable real-time code. In Proceedings of the ACM SIGPLAN 2002 conference
on Programming language design and implementation (pp. 315–326). Berlin, Germany:
ACM. https://doi.org/10.1145/512529.512567'
chicago: 'Henzinger, Thomas A, and Christoph Kirsch. “The Embedded Machine: Predictable,
Portable Real-Time Code.” In Proceedings of the ACM SIGPLAN 2002 Conference
on Programming Language Design and Implementation, 315–26. ACM, 2002. https://doi.org/10.1145/512529.512567.'
ieee: 'T. A. Henzinger and C. Kirsch, “The embedded machine: predictable, portable
real-time code,” in Proceedings of the ACM SIGPLAN 2002 conference on Programming
language design and implementation, Berlin, Germany, 2002, pp. 315–326.'
ista: 'Henzinger TA, Kirsch C. 2002. The embedded machine: predictable, portable
real-time code. Proceedings of the ACM SIGPLAN 2002 conference on Programming
language design and implementation. PLDI: Programming Languages Design and Implementation,
315–326.'
mla: 'Henzinger, Thomas A., and Christoph Kirsch. “The Embedded Machine: Predictable,
Portable Real-Time Code.” Proceedings of the ACM SIGPLAN 2002 Conference on
Programming Language Design and Implementation, ACM, 2002, pp. 315–26, doi:10.1145/512529.512567.'
short: T.A. Henzinger, C. Kirsch, in:, Proceedings of the ACM SIGPLAN 2002 Conference
on Programming Language Design and Implementation, ACM, 2002, pp. 315–326.
conference:
end_date: 2002-06-19
location: Berlin, Germany
name: 'PLDI: Programming Languages Design and Implementation'
start_date: 2002-06-17
date_created: 2018-12-11T12:08:53Z
date_published: 2002-06-01T00:00:00Z
date_updated: 2023-06-05T09:02:23Z
day: '01'
doi: 10.1145/512529.512567
extern: '1'
language:
- iso: eng
month: '06'
oa_version: None
page: 315 - 326
publication: Proceedings of the ACM SIGPLAN 2002 conference on Programming language
design and implementation
publication_identifier:
isbn:
- '9781581134636'
publication_status: published
publisher: ACM
publist_id: '284'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The embedded machine: predictable, portable real-time code'
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '2002'
...
---
_id: '4470'
abstract:
- lang: eng
text: Giotto is a platform-independent language for specifying software for high-performance
control applications. In this paper we present a new approach to the compilation
of Giotto. Following this approach, the Giotto compiler generates code for a virtual
machine, called the E machine, which can be ported to different platforms. The
Giotto compiler also checks if the generated E code is time safe for a given platform,
that is, if the platform offers sufficient performance to ensure that the E code
is executed in a timely fashion that conforms with the Giotto semantics. Time-safety
checking requires a schedulability analysis. We show that while for arbitrary
E code, the analysis is exponential, for E code generated from typical Giotto
programs, the analysis is polynomial. This supports our claim that Giotto identifies
a useful fragment of embedded programs.
acknowledgement: Supported in part by the DARPA SEC grant F33615-C-98-3614, MARCO
GSRC grant 98-DT-660, AFOSR MURI grant F49620-00-1-0327, NSF grant CCR-9988172,
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: Christoph
full_name: Kirsch, Christoph
last_name: Kirsch
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
- first_name: Slobodan
full_name: Matic, Slobodan
last_name: Matic
citation:
ama: 'Henzinger TA, Kirsch C, Majumdar R, Matic S. Time-safety checking for embedded
programs. In: Proceedings of the 2nd International Conference on Embedded Software.
Vol 2491. ACM; 2002:76-92. doi:10.1007/3-540-45828-X_7'
apa: 'Henzinger, T. A., Kirsch, C., Majumdar, R., & Matic, S. (2002). Time-safety
checking for embedded programs. In Proceedings of the 2nd International Conference
on Embedded Software (Vol. 2491, pp. 76–92). Grenoble, France: ACM. https://doi.org/10.1007/3-540-45828-X_7'
chicago: Henzinger, Thomas A, Christoph Kirsch, Ritankar Majumdar, and Slobodan
Matic. “Time-Safety Checking for Embedded Programs.” In Proceedings of the
2nd International Conference on Embedded Software, 2491:76–92. ACM, 2002.
https://doi.org/10.1007/3-540-45828-X_7.
ieee: T. A. Henzinger, C. Kirsch, R. Majumdar, and S. Matic, “Time-safety checking
for embedded programs,” in Proceedings of the 2nd International Conference
on Embedded Software, Grenoble, France, 2002, vol. 2491, pp. 76–92.
ista: 'Henzinger TA, Kirsch C, Majumdar R, Matic S. 2002. Time-safety checking for
embedded programs. Proceedings of the 2nd International Conference on Embedded
Software. EMSOFT: Embedded Software , LNCS, vol. 2491, 76–92.'
mla: Henzinger, Thomas A., et al. “Time-Safety Checking for Embedded Programs.”
Proceedings of the 2nd International Conference on Embedded Software, vol.
2491, ACM, 2002, pp. 76–92, doi:10.1007/3-540-45828-X_7.
short: T.A. Henzinger, C. Kirsch, R. Majumdar, S. Matic, in:, Proceedings of the
2nd International Conference on Embedded Software, ACM, 2002, pp. 76–92.
conference:
end_date: 2002-10-09
location: Grenoble, France
name: 'EMSOFT: Embedded Software '
start_date: 2002-10-07
date_created: 2018-12-11T12:09:01Z
date_published: 2002-09-25T00:00:00Z
date_updated: 2023-06-05T08:50:59Z
day: '25'
doi: 10.1007/3-540-45828-X_7
extern: '1'
intvolume: ' 2491'
language:
- iso: eng
month: '09'
oa_version: None
page: 76 - 92
publication: Proceedings of the 2nd International Conference on Embedded Software
publication_identifier:
isbn:
- '9783540443070'
publication_status: published
publisher: ACM
publist_id: '259'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Time-safety checking for embedded programs
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2491
year: '2002'
...
---
_id: '4471'
abstract:
- lang: eng
text: The sequential synthesis problem, which is closely related to Church’s solvability
problem, asks, given a specification in the form of a binary relation between
input and output streams, for the construction of a finite-state stream transducer
that converts inputs to appropriate outputs. For efficiency reasons, practical
sequential hardware is often designed to operate without prior initialization.
Such hardware designs can be modeled by uninitialized state machines, which are
required to satisfy their specification if started from any state. In this paper
we solve the sequential synthesis problem for uninitialized systems, that is,
we construct uninitialized finite-state stream transducers. We consider specifications
given by LTL formulas, deterministic, nondeterministic, universal, and alternating
Büchi automata. We solve this uninitialized synthesis problem by reducing it to
the well-understood initialized synthesis problem. While our solution is straightforward,
it leads, for some specification formalisms, to upper bounds that are exponentially
worse than the complexity of the corresponding initialized problems. However,
we prove lower bounds to show that our simple solutions are optimal for all considered
specification formalisms. We also study the problem of deciding whether a given
specification is uninitialized, that is, if its uninitialized and initialized
synthesis problems coincide. We show that this problem has, for each specification
formalism, the same complexity as the equivalence problem.
acknowledgement: This research was supported in part by the SRC contract 99-TJ-683.003,
the DARPA contract NAG2-1214, and the NSF grant CCR-9988172.
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: Sriram
full_name: Krishnan, Sriram
last_name: Krishnan
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
- first_name: Freddy
full_name: Mang, Freddy
last_name: Mang
citation:
ama: 'Henzinger TA, Krishnan S, Kupferman O, Mang F. Synthesis of uninitialized
systems. In: Proceedings of the 29th International Colloquium on Automata,
Languages and Programming. Vol 2380. Springer; 2002:644-656. doi:10.1007/3-540-45465-9_55'
apa: 'Henzinger, T. A., Krishnan, S., Kupferman, O., & Mang, F. (2002). Synthesis
of uninitialized systems. In Proceedings of the 29th International Colloquium
on Automata, Languages and Programming (Vol. 2380, pp. 644–656). Malaga, Spain:
Springer. https://doi.org/10.1007/3-540-45465-9_55'
chicago: Henzinger, Thomas A, Sriram Krishnan, Orna Kupferman, and Freddy Mang.
“Synthesis of Uninitialized Systems.” In Proceedings of the 29th International
Colloquium on Automata, Languages and Programming, 2380:644–56. Springer,
2002. https://doi.org/10.1007/3-540-45465-9_55.
ieee: T. A. Henzinger, S. Krishnan, O. Kupferman, and F. Mang, “Synthesis of uninitialized
systems,” in Proceedings of the 29th International Colloquium on Automata,
Languages and Programming, Malaga, Spain, 2002, vol. 2380, pp. 644–656.
ista: 'Henzinger TA, Krishnan S, Kupferman O, Mang F. 2002. Synthesis of uninitialized
systems. Proceedings of the 29th International Colloquium on Automata, Languages
and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 2380,
644–656.'
mla: Henzinger, Thomas A., et al. “Synthesis of Uninitialized Systems.” Proceedings
of the 29th International Colloquium on Automata, Languages and Programming,
vol. 2380, Springer, 2002, pp. 644–56, doi:10.1007/3-540-45465-9_55.
short: T.A. Henzinger, S. Krishnan, O. Kupferman, F. Mang, in:, Proceedings of the
29th International Colloquium on Automata, Languages and Programming, Springer,
2002, pp. 644–656.
conference:
end_date: 2002-07-13
location: Malaga, Spain
name: 'ICALP: Automata, Languages and Programming'
start_date: 2002-07-08
date_created: 2018-12-11T12:09:01Z
date_published: 2002-06-26T00:00:00Z
date_updated: 2023-06-05T08:05:13Z
day: '26'
doi: 10.1007/3-540-45465-9_55
extern: '1'
intvolume: ' 2380'
language:
- iso: eng
month: '06'
oa_version: None
page: 644 - 656
publication: Proceedings of the 29th International Colloquium on Automata, Languages
and Programming
publication_identifier:
isbn:
- '9783540438649'
publication_status: published
publisher: Springer
publist_id: '257'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Synthesis of uninitialized systems
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2380
year: '2002'
...
---
_id: '4472'
abstract:
- lang: eng
text: 'We present a methodology and tool for verifying and certifying systems code.
The verification is based on the lazy-abstraction paradigm for intertwining the
following three logical steps: construct a predicate abstraction from the code,
model check the abstraction, and automatically refine the abstraction based on
counterexample analysis. The certification is based on the proof-carrying code
paradigm. Lazy abstraction enables the automatic construction of small proof certificates.
The methodology is implemented in Blast, the Berkeley Lazy Abstraction Software
verification Tool. We describe our experience applying Blast to Linux and Windows
device drivers. Given the C code for a driver and for a temporal-safety monitor,
Blast automatically generates an easily checkable correctness certificate if the
driver satisfies the specification, and an error trace otherwise.'
acknowledgement: This work was supported in part by the NSF ITR grants CCR-0085949,
CCR-0081588, the NSF Career grant CCR-9875171, the DARPA PCES grant F33615-00-C-1693,
the MARCO GSRC grant 98-DT-660, the SRC contract 99-TJ-683, a Microsoft fellowship,
and gifts from AT&T Research and Microsoft Research.
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: George
full_name: Necula, George
last_name: Necula
- first_name: Ranjit
full_name: Jhala, Ranjit
last_name: Jhala
- first_name: Grégoire
full_name: Sutre, Grégoire
last_name: Sutre
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
- first_name: Westley
full_name: Weimer, Westley
last_name: Weimer
citation:
ama: 'Henzinger TA, Necula G, Jhala R, Sutre G, Majumdar R, Weimer W. Temporal safety
proofs for systems code. In: Proceedings of the 14th International Conference
on Computer Aided Verification. Vol 2404. Springer; 2002:526-538. doi:10.1007/3-540-45657-0_45'
apa: 'Henzinger, T. A., Necula, G., Jhala, R., Sutre, G., Majumdar, R., & Weimer,
W. (2002). Temporal safety proofs for systems code. In Proceedings of the 14th
International Conference on Computer Aided Verification (Vol. 2404, pp. 526–538).
Copenhagen, Denmark: Springer. https://doi.org/10.1007/3-540-45657-0_45'
chicago: Henzinger, Thomas A, George Necula, Ranjit Jhala, Grégoire Sutre, Ritankar
Majumdar, and Westley Weimer. “Temporal Safety Proofs for Systems Code.” In Proceedings
of the 14th International Conference on Computer Aided Verification, 2404:526–38.
Springer, 2002. https://doi.org/10.1007/3-540-45657-0_45.
ieee: T. A. Henzinger, G. Necula, R. Jhala, G. Sutre, R. Majumdar, and W. Weimer,
“Temporal safety proofs for systems code,” in Proceedings of the 14th International
Conference on Computer Aided Verification, Copenhagen, Denmark, 2002, vol.
2404, pp. 526–538.
ista: 'Henzinger TA, Necula G, Jhala R, Sutre G, Majumdar R, Weimer W. 2002. Temporal
safety proofs for systems code. Proceedings of the 14th International Conference
on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 2404,
526–538.'
mla: Henzinger, Thomas A., et al. “Temporal Safety Proofs for Systems Code.” Proceedings
of the 14th International Conference on Computer Aided Verification, vol.
2404, Springer, 2002, pp. 526–38, doi:10.1007/3-540-45657-0_45.
short: T.A. Henzinger, G. Necula, R. Jhala, G. Sutre, R. Majumdar, W. Weimer, in:,
Proceedings of the 14th International Conference on Computer Aided Verification,
Springer, 2002, pp. 526–538.
conference:
end_date: 2002-07-31
location: Copenhagen, Denmark
name: 'CAV: Computer Aided Verification'
start_date: 2002-07-27
date_created: 2018-12-11T12:09:01Z
date_published: 2002-06-19T00:00:00Z
date_updated: 2023-06-05T08:11:32Z
day: '19'
doi: 10.1007/3-540-45657-0_45
extern: '1'
intvolume: ' 2404'
language:
- iso: eng
month: '06'
oa_version: None
page: 526 - 538
publication: Proceedings of the 14th International Conference on Computer Aided Verification
publication_identifier:
isbn:
- '9783540439974'
publication_status: published
publisher: Springer
publist_id: '258'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Temporal safety proofs for systems code
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2404
year: '2002'
...
---
_id: '4473'
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, denoting "P is simulated by 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 constraints on transition
systems.'
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: 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. ACM Transactions on Programming Languages and Systems
(TOPLAS). 2002;24(1):51-64. doi:10.1145/509705.509707
apa: Henzinger, T. A., Qadeer, S., Rajamani, S., & Tasiran, S. (2002). An assume-guarantee
rule for checking simulation. ACM Transactions on Programming Languages and
Systems (TOPLAS). ACM. https://doi.org/10.1145/509705.509707
chicago: Henzinger, Thomas A, Shaz Qadeer, Sriram Rajamani, and Serdar Tasiran.
“An Assume-Guarantee Rule for Checking Simulation.” ACM Transactions on Programming
Languages and Systems (TOPLAS). ACM, 2002. https://doi.org/10.1145/509705.509707.
ieee: T. A. Henzinger, S. Qadeer, S. Rajamani, and S. Tasiran, “An assume-guarantee
rule for checking simulation,” ACM Transactions on Programming Languages and
Systems (TOPLAS), vol. 24, no. 1. ACM, pp. 51–64, 2002.
ista: Henzinger TA, Qadeer S, Rajamani S, Tasiran S. 2002. An assume-guarantee rule
for checking simulation. ACM Transactions on Programming Languages and Systems
(TOPLAS). 24(1), 51–64.
mla: Henzinger, Thomas A., et al. “An Assume-Guarantee Rule for Checking Simulation.”
ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 24,
no. 1, ACM, 2002, pp. 51–64, doi:10.1145/509705.509707.
short: T.A. Henzinger, S. Qadeer, S. Rajamani, S. Tasiran, ACM Transactions on Programming
Languages and Systems (TOPLAS) 24 (2002) 51–64.
date_created: 2018-12-11T12:09:02Z
date_published: 2002-01-01T00:00:00Z
date_updated: 2023-06-05T07:59:47Z
day: '01'
doi: 10.1145/509705.509707
extern: '1'
intvolume: ' 24'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 51 - 64
publication: ACM Transactions on Programming Languages and Systems (TOPLAS)
publication_identifier:
issn:
- 0164-0925
publication_status: published
publisher: ACM
publist_id: '256'
quality_controlled: '1'
scopus_import: '1'
status: public
title: An assume-guarantee rule for checking simulation
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 24
year: '2002'
...
---
_id: '4474'
abstract:
- lang: eng
text: 'The simulation preorder for labeled transition systems is defined locally,
and operationally, as a game that relates states with their immediate successor
states. Simulation enjoys many appealing properties. First, simulation has a denotational
characterization: system S simulates system I iff every computation tree embedded
in the unrolling of I can be embedded also in the unrolling of S. Second, simulation
has a logical characterization: S simulates I iff every universal branching-time
formula satisfied by S is satisfied also by I. It follows that simulation is a
suitable notion of implementation, and it is the coarsest abstraction of a system
that preserves universal branching-time properties. Third, based on its local
definition, simulation between finite-state systems can be checked in polynomial
time. Finally, simulation implies trace containment, which cannot be defined locally
and requires polynomial space for verification. Hence simulation is widely used
both in manual and in automatic verification. Liveness assumptions about transition
systems are typically modeled using fairness constraints. Existing notions of
simulation for fair transition systems, however, are not local, and as a result,
many appealing properties of the simulation preorder are lost. We propose a new
view of fair simulation by extending the local definition of simulation to account
for fairness: system View the MathML sourcefairly simulates system View the MathML
source iff in the simulation game, there is a strategy that matches with each
fair computation of View the MathML source a fair computation of View the MathML
source. Our definition enjoys a denotational characterization and has a logical
characterization: View the MathML source fairly simulates View the MathML source
iff every fair computation tree (whose infinite paths are fair) embedded in the
unrolling of View the MathML source can be embedded also in the unrolling of View
the MathML source or, equivalently, iff every Fair-∀AFMC formula satisfied by
View the MathML source is satisfied also by View the MathML source (∀AFMC is the
universal fragment of the alternation-free μ-calculus). The locality of the definition
leads us to a polynomial-time algorithm for checking fair simulation for finite-state
systems with weak and strong fairness constraints. Finally, fair simulation implies
fair trace containment and is therefore useful as an efficiently computable local
criterion for proving linear-time abstraction hierarchies of fair systems.'
acknowledgement: We thank Ramin Hojati, Doron Bustan, and the anonymous reviewers
for their comments on this paper.
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: Sriram
full_name: Rajamani, Sriram
last_name: Rajamani
citation:
ama: Henzinger TA, Kupferman O, Rajamani S. Fair simulation. Information and
Computation. 2002;173(1):64-81. doi:10.1006/inco.2001.3085
apa: Henzinger, T. A., Kupferman, O., & Rajamani, S. (2002). Fair simulation.
Information and Computation. Elsevier. https://doi.org/10.1006/inco.2001.3085
chicago: Henzinger, Thomas A, Orna Kupferman, and Sriram Rajamani. “Fair Simulation.”
Information and Computation. Elsevier, 2002. https://doi.org/10.1006/inco.2001.3085.
ieee: T. A. Henzinger, O. Kupferman, and S. Rajamani, “Fair simulation,” Information
and Computation, vol. 173, no. 1. Elsevier, pp. 64–81, 2002.
ista: Henzinger TA, Kupferman O, Rajamani S. 2002. Fair simulation. Information
and Computation. 173(1), 64–81.
mla: Henzinger, Thomas A., et al. “Fair Simulation.” Information and Computation,
vol. 173, no. 1, Elsevier, 2002, pp. 64–81, doi:10.1006/inco.2001.3085.
short: T.A. Henzinger, O. Kupferman, S. Rajamani, Information and Computation 173
(2002) 64–81.
date_created: 2018-12-11T12:09:02Z
date_published: 2002-02-25T00:00:00Z
date_updated: 2023-06-05T07:53:27Z
day: '25'
doi: 10.1006/inco.2001.3085
extern: '1'
intvolume: ' 173'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/S0890540101930858?via%3Dihub
month: '02'
oa: 1
oa_version: Published Version
page: 64 - 81
publication: Information and Computation
publication_identifier:
issn:
- 0890-5401
publication_status: published
publisher: Elsevier
publist_id: '255'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fair simulation
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 173
year: '2002'
...
---
_id: '4476'
abstract:
- lang: eng
text: 'One approach to model checking software is based on the abstract-check-refine
paradigm: build an abstract model, then check the desired property, and if the
check fails, refine the model and start over. We introduce the concept of lazy
abstraction to integrate and optimize the three phases of the abstract-check-refine
loop. Lazy abstraction continuously builds and refines a single abstract model
on demand, driven by the model checker, so that different parts of the model may
exhibit different degrees of precision, namely just enough to verify the desired
property. We present an algorithm for model checking safety properties using lazy
abstraction and describe an implementation of the algorithm applied to C programs.
We also provide sufficient conditions for the termination of the method.'
acknowledgement: "We thank Wes Weimer and Jeff Foster for many useful discussions.
\r\n"
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. Lazy abstraction. In: Proceedings
of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages.
ACM; 2002:58-70. doi:10.1145/503272.503279'
apa: 'Henzinger, T. A., Jhala, R., Majumdar, R., & Sutre, G. (2002). Lazy abstraction.
In Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming
languages (pp. 58–70). Portland, OR, USA: ACM. https://doi.org/10.1145/503272.503279'
chicago: Henzinger, Thomas A, Ranjit Jhala, Ritankar Majumdar, and Grégoire Sutre.
“Lazy Abstraction.” In Proceedings of the 29th ACM SIGPLAN-SIGACT Symposium
on Principles of Programming Languages, 58–70. ACM, 2002. https://doi.org/10.1145/503272.503279.
ieee: T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre, “Lazy abstraction,”
in Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming
languages, Portland, OR, USA, 2002, pp. 58–70.
ista: 'Henzinger TA, Jhala R, Majumdar R, Sutre G. 2002. Lazy abstraction. Proceedings
of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages.
POPL: Principles of Programming Languages, 58–70.'
mla: Henzinger, Thomas A., et al. “Lazy Abstraction.” Proceedings of the 29th
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM,
2002, pp. 58–70, doi:10.1145/503272.503279.
short: T.A. Henzinger, R. Jhala, R. Majumdar, G. Sutre, in:, Proceedings of the
29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM,
2002, pp. 58–70.
conference:
end_date: 2002-01-18
location: Portland, OR, USA
name: 'POPL: Principles of Programming Languages'
start_date: 2002-01-16
date_created: 2018-12-11T12:09:03Z
date_published: 2002-01-01T00:00:00Z
date_updated: 2023-06-05T07:45:53Z
day: '01'
doi: 10.1145/503272.503279
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 58 - 70
publication: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of
programming languages
publication_identifier:
isbn:
- '9781581134506'
publication_status: published
publisher: ACM
publist_id: '254'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Lazy abstraction
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '2002'
...
---
_id: '2604'
abstract:
- lang: eng
text: Cutaneous antidromic vasodilatation and plasma extravasation, two phenomena
that occur in neurogenic inflammation, are partially blocked by substance P (SP)
receptor antagonists and are known to be mediated in part by mast cell-released
substances, such as histamine, serotonin, and nitric oxide. In an attempt to provide
a morphological substrate for the above phenomena, we applied light and electron
microscopic immunocytochemistry to investigate the pattern of SP innervation of
blood vessels and its relationship to mast cells in the skin of the rat lower
lip. Furthermore, we examined the distribution of SP (neurokinin-1) receptors
and their relationship to SP-immunoreactive (IR) fibers. Our results confirmed
that SP-IR fibers are found in cutaneous nerves and that terminal branches are
observed around blood vessels and penetrating the epidermis. SP-IR fibers also
innervated hair follicles and sebaceous glands. At the ultrastructural level,
SP-IR varicosities were observed adjacent to arterioles, capillaries, venules,
and mast cells. The varicosities possessed both dense core vesicles and agranular
synaptic vesicles. We quantified the distance between SP-IR varicosities and blood
vessel endothelial cells. SP-IR terminals were located within 0.23-5.99 μm from
the endothelial cell layer in 82.7% of arterioles, in 90.2% of capillaries, and
in 86.9% of venules. Although there was a trend for SP-IR fibers to be located
closer to the endothelium of venules, this difference was not significant. Neurokinin-1
receptor (NK-1r) immunoreactivity was most abundant in the upper dermis and was
associated with the wall of blood vessels. NK-1r were located in equal amounts
on the walls of arterioles, capillaries, and venules that were innervated by SP-IR
fibers. The present results favor the concept of a participation of SP in cutaneous
neurogenic vasodilatation and plasma extravasation both by an action on blood
vessels after binding to the NK-1r and by causing the release of substances from
mast cells after diffusion through the connective tissue.
acknowledgement: This work was sponsored by grant MT-12170 from the Canadian Medical
Research Council. The authors thank Marie Ballak for electron microscopy assistance,
Alan Forster for photographic expertise, and Sid Parkinson for editorial
assistance.
article_processing_charge: No
article_type: original
author:
- first_name: Isabella
full_name: Ruocco, Isabella
last_name: Ruocco
- first_name: Augusto
full_name: Cuello, Augusto
last_name: Cuello
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Alfredo
full_name: Ribeiro Da Silva, Alfredo
last_name: Ribeiro Da Silva
citation:
ama: Ruocco I, Cuello A, Shigemoto R, Ribeiro Da Silva A. Light and electron microscopic
study of the distribution of substance P-immunoreactive fibers and neurokinin-1
receptors in the skin of the rat lower lip. Journal of Comparative Neurology.
2001;432(4):466-480. doi:10.1002/cne.1114
apa: Ruocco, I., Cuello, A., Shigemoto, R., & Ribeiro Da Silva, A. (2001). Light
and electron microscopic study of the distribution of substance P-immunoreactive
fibers and neurokinin-1 receptors in the skin of the rat lower lip. Journal
of Comparative Neurology. Wiley-Blackwell. https://doi.org/10.1002/cne.1114
chicago: Ruocco, Isabella, Augusto Cuello, Ryuichi Shigemoto, and Alfredo Ribeiro
Da Silva. “Light and Electron Microscopic Study of the Distribution of Substance
P-Immunoreactive Fibers and Neurokinin-1 Receptors in the Skin of the Rat Lower
Lip.” Journal of Comparative Neurology. Wiley-Blackwell, 2001. https://doi.org/10.1002/cne.1114.
ieee: I. Ruocco, A. Cuello, R. Shigemoto, and A. Ribeiro Da Silva, “Light and electron
microscopic study of the distribution of substance P-immunoreactive fibers and
neurokinin-1 receptors in the skin of the rat lower lip,” Journal of Comparative
Neurology, vol. 432, no. 4. Wiley-Blackwell, pp. 466–480, 2001.
ista: Ruocco I, Cuello A, Shigemoto R, Ribeiro Da Silva A. 2001. Light and electron
microscopic study of the distribution of substance P-immunoreactive fibers and
neurokinin-1 receptors in the skin of the rat lower lip. Journal of Comparative
Neurology. 432(4), 466–480.
mla: Ruocco, Isabella, et al. “Light and Electron Microscopic Study of the Distribution
of Substance P-Immunoreactive Fibers and Neurokinin-1 Receptors in the Skin of
the Rat Lower Lip.” Journal of Comparative Neurology, vol. 432, no. 4,
Wiley-Blackwell, 2001, pp. 466–80, doi:10.1002/cne.1114.
short: I. Ruocco, A. Cuello, R. Shigemoto, A. Ribeiro Da Silva, Journal of Comparative
Neurology 432 (2001) 466–480.
date_created: 2018-12-11T11:58:37Z
date_published: 2001-04-16T00:00:00Z
date_updated: 2023-05-24T13:03:51Z
day: '16'
doi: 10.1002/cne.1114
extern: '1'
external_id:
pmid:
- '11268009'
intvolume: ' 432'
issue: '4'
language:
- iso: eng
month: '04'
oa_version: None
page: 466 - 480
pmid: 1
publication: Journal of Comparative Neurology
publication_identifier:
issn:
- 0021-9967
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4294'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Light and electron microscopic study of the distribution of substance P-immunoreactive
fibers and neurokinin-1 receptors in the skin of the rat lower lip
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 432
year: '2001'
...
---
_id: '2605'
abstract:
- lang: eng
text: 'The granular layer of the cerebellar cortex consists of densely packed neuronal
cells, classified into granule cells and large interneurons. In this study, we
provide a comparative survey of large granular layer interneurons in the adult
rat cerebellum based on both morphological and neurochemical criteria. To this
end, double immunofluorescence histochemistry was performed by combining antibodies
against the cytoplasmic antigen Rat-303, calretinin, the metabotropic glutamate
receptor mGluR2 and somatostatin. Based on Rat-303/calretinin double immunohistochemistry,
three distinct populations of large granular layer interneurons could be discerned:
cells immunopositive for Rat-303, calretinin or both. Rat-303 or calretinin single-labeled
cells represented Golgi cells and unipolar brush cells, respectively. Rat-303/calretinin
double-labeled cells located just underneath the Purkinje cell layer represented
Lugaro cells. Morphometrical analysis distinguished two populations of Rat-303-positive
Golgi cells according to their location: vermis versus hemisphere. Immunostaining
for the metabotropic glutamate receptor mGluR2 combined with Rat-303 or calretinin
revealed that the majority of Golgi cells (about 90%) appeared to be mGluR2 positive.
Lugaro cells were mGluR2 negative. In addition, a limited population of large
polymorphous interneurons in the depth of the granular layer with morphological
features resembling Golgi cells also displayed Rat-303/calretinin immunoreactivity
and were mGluR2 negative. Double immunohistochemistry for Rat-303 and somatostatin
revealed three populations of labeled cells in the depth of the granular layer.
Besides double-labeled Golgi cells, Rat-303 or somatostatin single-labeled cells
were present. Based on mGluR2/somatostatin and calretinin/somatostatin double
immunostainings, Rat-303 single-labeled cells were found to correspond to Rat-303/calretinin-positive,
mGluR2-negative Golgi-like cells, while the identity of somatostatin single-labeled
cells remained unclear. The data presented in this article elaborate previous
reports on the morphological and neurochemical differentiation of large interneurons
in the rat cerebellar granular layer. In addition, they indicate that the current
classification of these cells into Golgi cells, Lugaro cells and unipolar brush
cells does not describe the observed neurochemical heterogeneity.'
article_processing_charge: No
article_type: original
author:
- first_name: Frederik
full_name: Geurts, Frederik
last_name: Geurts
- first_name: Jean
full_name: Timmermans, Jean
last_name: Timmermans
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Erik
full_name: De Schutter, Erik
last_name: De Schutter
citation:
ama: Geurts F, Timmermans J, Shigemoto R, De Schutter E. Morphological and neurochemical
differentiation of large granular layer interneurons in the adult rat cerebellum.
Neuroscience. 2001;104(2):499-512. doi:10.1016/S0306-4522(01)00058-6
apa: Geurts, F., Timmermans, J., Shigemoto, R., & De Schutter, E. (2001). Morphological
and neurochemical differentiation of large granular layer interneurons in the
adult rat cerebellum. Neuroscience. Elsevier. https://doi.org/10.1016/S0306-4522(01)00058-6
chicago: Geurts, Frederik, Jean Timmermans, Ryuichi Shigemoto, and Erik De Schutter.
“Morphological and Neurochemical Differentiation of Large Granular Layer Interneurons
in the Adult Rat Cerebellum.” Neuroscience. Elsevier, 2001. https://doi.org/10.1016/S0306-4522(01)00058-6.
ieee: F. Geurts, J. Timmermans, R. Shigemoto, and E. De Schutter, “Morphological
and neurochemical differentiation of large granular layer interneurons in the
adult rat cerebellum,” Neuroscience, vol. 104, no. 2. Elsevier, pp. 499–512,
2001.
ista: Geurts F, Timmermans J, Shigemoto R, De Schutter E. 2001. Morphological and
neurochemical differentiation of large granular layer interneurons in the adult
rat cerebellum. Neuroscience. 104(2), 499–512.
mla: Geurts, Frederik, et al. “Morphological and Neurochemical Differentiation of
Large Granular Layer Interneurons in the Adult Rat Cerebellum.” Neuroscience,
vol. 104, no. 2, Elsevier, 2001, pp. 499–512, doi:10.1016/S0306-4522(01)00058-6.
short: F. Geurts, J. Timmermans, R. Shigemoto, E. De Schutter, Neuroscience 104
(2001) 499–512.
date_created: 2018-12-11T11:58:38Z
date_published: 2001-05-10T00:00:00Z
date_updated: 2023-05-24T12:45:30Z
day: '10'
doi: 10.1016/S0306-4522(01)00058-6
extern: '1'
external_id:
pmid:
- '11377850'
intvolume: ' 104'
issue: '2'
language:
- iso: eng
month: '05'
oa_version: None
page: 499 - 512
pmid: 1
publication: Neuroscience
publication_identifier:
issn:
- 0306-4522
publication_status: published
publisher: Elsevier
publist_id: '4292'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Morphological and neurochemical differentiation of large granular layer interneurons
in the adult rat cerebellum
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 104
year: '2001'
...
---
_id: '2606'
abstract:
- lang: eng
text: Glutamate receptors have been linked to the regulation of several developmental
events in the CNS. By using cortical slices of early postnatal mice, we show that
in layer I cells, glutamate produces intracellular calcium ([Ca2+]i) elevations
mediated by ionotropic and metabotropic glutamate receptors (mGluRs). The contribution
of mGluRs to these responses was demonstrated by application of tACPD, an agonist
to groups I and II mGluRs, which evoked [Ca2+]i increases that could be reversibly
blocked by MCPG, an antagonist to groups I and II mGluRs. In the absence of extracellular
Ca2+, repetitive applications of tACPD or quisqualate, an agonist to group I mGluRs,
elicited decreasing [Ca2+]i responses that were restored by refilling a thapsigargin-sensitive
Ca2+ store. The use of specific group I mGluR agonists CHPG and DHPG indicated
that the functional mGluR in layer I was of the mGluR1 subtype. Subtype specific
antibodies confirmed the presence of mGlur1α, but not mGluR5, in Cajal-Retzius
(Reelin-immunoreactive) neurons.
acknowledgement: MV and AF are senior coauthors of this work, which was supported by
Ministerio de Educacion y Cultura, grants SAF97/0195 and SAF 2000-0152-C02-02 to
M.V; PB94-0219-CO2-01 and PB97-0582-CO2-01 to A.F., Accio Especial de R+D AE98-18 from Generalitat Valenciana, and a Fellowship
from Bancaixa-C.S.I.C. to J.R.M.-G. We wish to thank Andre M. Goffinet for his G10 antireelin antibody and Roberto Gallego, Juan M. Luque and Felix
Viana for their constructive criticisms on previous versions of the manuscript.
article_processing_charge: No
article_type: original
author:
- first_name: Galán
full_name: Martínez, Galán
last_name: Martínez
- first_name: Guillermina
full_name: López Bendito, Guillermina
last_name: López Bendito
- first_name: Rafael
full_name: Luján, Rafael
last_name: Luján
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Alfonso
full_name: Fairén, Alfonso
last_name: Fairén
- first_name: Miguel
full_name: Valdeolmillos, Miguel
last_name: Valdeolmillos
citation:
ama: Martínez G, López Bendito G, Luján R, Shigemoto R, Fairén A, Valdeolmillos
M. Cajal-Retzius cells in early postnatal mouse cortex selectively express functional
metabotropic glutamate receptors. European Journal of Neuroscience. 2001;13(6):1147-1154.
doi:10.1046/j.0953-816X.2001.01494.x
apa: Martínez, G., López Bendito, G., Luján, R., Shigemoto, R., Fairén, A., &
Valdeolmillos, M. (2001). Cajal-Retzius cells in early postnatal mouse cortex
selectively express functional metabotropic glutamate receptors. European Journal
of Neuroscience. Wiley-Blackwell. https://doi.org/10.1046/j.0953-816X.2001.01494.x
chicago: Martínez, Galán, Guillermina López Bendito, Rafael Luján, Ryuichi Shigemoto,
Alfonso Fairén, and Miguel Valdeolmillos. “Cajal-Retzius Cells in Early Postnatal
Mouse Cortex Selectively Express Functional Metabotropic Glutamate Receptors.”
European Journal of Neuroscience. Wiley-Blackwell, 2001. https://doi.org/10.1046/j.0953-816X.2001.01494.x.
ieee: G. Martínez, G. López Bendito, R. Luján, R. Shigemoto, A. Fairén, and M. Valdeolmillos,
“Cajal-Retzius cells in early postnatal mouse cortex selectively express functional
metabotropic glutamate receptors,” European Journal of Neuroscience, vol.
13, no. 6. Wiley-Blackwell, pp. 1147–1154, 2001.
ista: Martínez G, López Bendito G, Luján R, Shigemoto R, Fairén A, Valdeolmillos
M. 2001. Cajal-Retzius cells in early postnatal mouse cortex selectively express
functional metabotropic glutamate receptors. European Journal of Neuroscience.
13(6), 1147–1154.
mla: Martínez, Galán, et al. “Cajal-Retzius Cells in Early Postnatal Mouse Cortex
Selectively Express Functional Metabotropic Glutamate Receptors.” European
Journal of Neuroscience, vol. 13, no. 6, Wiley-Blackwell, 2001, pp. 1147–54,
doi:10.1046/j.0953-816X.2001.01494.x.
short: G. Martínez, G. López Bendito, R. Luján, R. Shigemoto, A. Fairén, M. Valdeolmillos,
European Journal of Neuroscience 13 (2001) 1147–1154.
date_created: 2018-12-11T11:58:38Z
date_published: 2001-03-01T00:00:00Z
date_updated: 2023-05-24T12:53:46Z
day: '01'
doi: 10.1046/j.0953-816X.2001.01494.x
extern: '1'
external_id:
pmid:
- '11285012'
intvolume: ' 13'
issue: '6'
language:
- iso: eng
month: '03'
oa_version: None
page: 1147 - 1154
pmid: 1
publication: European Journal of Neuroscience
publication_identifier:
issn:
- 0953-816X
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4293'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cajal-Retzius cells in early postnatal mouse cortex selectively express functional
metabotropic glutamate receptors
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 13
year: '2001'
...
---
_id: '2607'
abstract:
- lang: eng
text: Alternative splicing in the mGluR5 gene generates two different receptor isoforms,
of which expression is developmentally regulated. However, little is known about
the functional significance of mGluR5 splice variants. We have examined the functional
coupling, subcellular targeting, and effect on neuronal differentiation of epitope-tagged
mGluR5 isoforms by expression in neuroblastoma NG108-15 cells. We found that both
mGluR5 splice variants give rise to comparable [Ca2+]i transients and have similar
pharmacological profile. Tagged receptors were shown by immunofluorescence to
be inserted in the plasma membrane. In undifferentiated cells the subcellular
localization of the two mGluR5 isoforms was partially segregated, whereas in differentiated
cells the labeling largely redistributed to the newly formed neurites. Interestingly,
we demonstrate that mGluR5 splice variants dramatically influence the formation
and maturation of neurites; mGluR5a hinders the acquisition of mature neuronal
traits and mGluR5b fosters the elaboration and extension of neurites. These effects
are partly inhibited by MPEP.
acknowledgement: "The authors thank: Dr. J. M. Rimland and M. T. Scupoli for their
technical help with X. oocytes recordings and FAC sorting, respectively; Dr. Y.
Dalezios for helping with the statistical analyses; and Dr. G. Varani for helping
with the analyses of mRNA and genomic sequences. We are also grateful to Professor
F. Benfenati, Dr. F. Conquet, Dr. Rafael Lujan, Dr. J. McIlhinney, Professor P.
Somogyi, Dr. J. H. Xuereb, and Dr. M. Zoli for careful reading of the manuscript\r\nand
helpful suggestions. R.S. is supported by the Laboratory of Cerebral Structure,
National Institute for Physiological Sciences, Myodaiji, Okazaki 444-8585, CREST
Japan Science and Technology Corporation, Japan."
article_processing_charge: No
article_type: original
author:
- first_name: Silvia
full_name: Mion, Silvia
last_name: Mion
- first_name: Corrado
full_name: Corti, Corrado
last_name: Corti
- first_name: Akio
full_name: Neki, Akio
last_name: Neki
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Mauro
full_name: Corsi, Mauro
last_name: Corsi
- first_name: Guido
full_name: Fumagalli, Guido
last_name: Fumagalli
- first_name: Francesco
full_name: Ferraguti, Francesco
last_name: Ferraguti
citation:
ama: Mion S, Corti C, Neki A, et al. Bidirectional regulation of neurite elaboration
by alternatively spliced metabotropic glutamate receptor 5 (mGluR5) isoforms.
Molecular and Cellular Neuroscience. 2001;17(6):957-972. doi:10.1006/mcne.2001.0993
apa: Mion, S., Corti, C., Neki, A., Shigemoto, R., Corsi, M., Fumagalli, G., &
Ferraguti, F. (2001). Bidirectional regulation of neurite elaboration by alternatively
spliced metabotropic glutamate receptor 5 (mGluR5) isoforms. Molecular and
Cellular Neuroscience. Academic Press. https://doi.org/10.1006/mcne.2001.0993
chicago: Mion, Silvia, Corrado Corti, Akio Neki, Ryuichi Shigemoto, Mauro Corsi,
Guido Fumagalli, and Francesco Ferraguti. “Bidirectional Regulation of Neurite
Elaboration by Alternatively Spliced Metabotropic Glutamate Receptor 5 (MGluR5)
Isoforms.” Molecular and Cellular Neuroscience. Academic Press, 2001. https://doi.org/10.1006/mcne.2001.0993.
ieee: S. Mion et al., “Bidirectional regulation of neurite elaboration by
alternatively spliced metabotropic glutamate receptor 5 (mGluR5) isoforms,” Molecular
and Cellular Neuroscience, vol. 17, no. 6. Academic Press, pp. 957–972, 2001.
ista: Mion S, Corti C, Neki A, Shigemoto R, Corsi M, Fumagalli G, Ferraguti F. 2001.
Bidirectional regulation of neurite elaboration by alternatively spliced metabotropic
glutamate receptor 5 (mGluR5) isoforms. Molecular and Cellular Neuroscience. 17(6),
957–972.
mla: Mion, Silvia, et al. “Bidirectional Regulation of Neurite Elaboration by Alternatively
Spliced Metabotropic Glutamate Receptor 5 (MGluR5) Isoforms.” Molecular and
Cellular Neuroscience, vol. 17, no. 6, Academic Press, 2001, pp. 957–72, doi:10.1006/mcne.2001.0993.
short: S. Mion, C. Corti, A. Neki, R. Shigemoto, M. Corsi, G. Fumagalli, F. Ferraguti,
Molecular and Cellular Neuroscience 17 (2001) 957–972.
date_created: 2018-12-11T11:58:38Z
date_published: 2001-06-01T00:00:00Z
date_updated: 2023-05-24T09:34:13Z
day: '01'
doi: 10.1006/mcne.2001.0993
extern: '1'
external_id:
pmid:
- '11414786'
intvolume: ' 17'
issue: '6'
language:
- iso: eng
month: '06'
oa_version: None
page: 957 - 972
pmid: 1
publication: Molecular and Cellular Neuroscience
publication_identifier:
issn:
- 1044-7431
publication_status: published
publisher: Academic Press
publist_id: '4291'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bidirectional regulation of neurite elaboration by alternatively spliced metabotropic
glutamate receptor 5 (mGluR5) isoforms
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 17
year: '2001'
...