---
_id: '3827'
abstract:
- lang: eng
text: Previous studies revealed that synaptotagmin 1 is the major Ca(2+) sensor
for fast synchronous transmitter release at excitatory synapses. However, the
molecular identity of the Ca(2+) sensor at hippocampal inhibitory synapses has
not been determined. To address the functional role of synaptotagmin 1 at identified
inhibitory terminals, we made paired recordings from synaptically connected basket
cells (BCs) and granule cells (GCs) in the dentate gyrus in organotypic slice
cultures from wild-type and synaptotagmin 1-deficient mice. As expected, genetic
elimination of synaptotagmin 1 abolished synchronous transmitter release at excitatory
GC-BC synapses. However, synchronous release at inhibitory BC-GC synapses was
maintained. Quantitative analysis revealed that elimination of synaptotagmin 1
reduced release probability and depression but maintained the synchrony of transmitter
release at BC-GC synapses. Elimination of synaptotagmin 1 also increased the frequency
of both miniature excitatory postsynaptic currents (measured in BCs) and miniature
inhibitory postsynaptic currents (recorded in GCs), consistent with a clamping
function of synaptotagmin 1 at both excitatory and inhibitory terminals. Single-cell
reverse-transcription quantitative PCR analysis revealed that single BCs coexpressed
multiple synaptotagmin isoforms, including synaptotagmin 1-5, 7, and 11-13. Our
results indicate that, in contrast to excitatory synapses, synaptotagmin 1 is
not absolutely required for synchronous release at inhibitory BC-GC synapses.
Thus, alternative fast Ca(2+) sensors contribute to synchronous release of the
inhibitory transmitter GABA in cortical circuits.
author:
- first_name: Angharad
full_name: Kerr, Angharad M
last_name: Kerr
- first_name: Ellen
full_name: Reisinger, Ellen
last_name: Reisinger
- first_name: Peter M
full_name: Peter Jonas
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Kerr A, Reisinger E, Jonas PM. Differential dependence of phasic transmitter
release on synaptotagmin 1 at GABAergic and glutamatergic hippocampal synapses.
PNAS. 2008;105(40):15581-15586. doi:10.1073/pnas.0800621105
apa: Kerr, A., Reisinger, E., & Jonas, P. M. (2008). Differential dependence
of phasic transmitter release on synaptotagmin 1 at GABAergic and glutamatergic
hippocampal synapses. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.0800621105
chicago: Kerr, Angharad, Ellen Reisinger, and Peter M Jonas. “Differential Dependence
of Phasic Transmitter Release on Synaptotagmin 1 at GABAergic and Glutamatergic
Hippocampal Synapses.” PNAS. National Academy of Sciences, 2008. https://doi.org/10.1073/pnas.0800621105.
ieee: A. Kerr, E. Reisinger, and P. M. Jonas, “Differential dependence of phasic
transmitter release on synaptotagmin 1 at GABAergic and glutamatergic hippocampal
synapses,” PNAS, vol. 105, no. 40. National Academy of Sciences, pp. 15581–6,
2008.
ista: Kerr A, Reisinger E, Jonas PM. 2008. Differential dependence of phasic transmitter
release on synaptotagmin 1 at GABAergic and glutamatergic hippocampal synapses.
PNAS. 105(40), 15581–6.
mla: Kerr, Angharad, et al. “Differential Dependence of Phasic Transmitter Release
on Synaptotagmin 1 at GABAergic and Glutamatergic Hippocampal Synapses.” PNAS,
vol. 105, no. 40, National Academy of Sciences, 2008, pp. 15581–86, doi:10.1073/pnas.0800621105.
short: A. Kerr, E. Reisinger, P.M. Jonas, PNAS 105 (2008) 15581–6.
date_created: 2018-12-11T12:05:23Z
date_published: 2008-01-01T00:00:00Z
date_updated: 2021-01-12T07:52:29Z
day: '01'
doi: 10.1073/pnas.0800621105
extern: 1
intvolume: ' 105'
issue: '40'
month: '01'
page: 15581 - 6
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '2384'
quality_controlled: 0
status: public
title: Differential dependence of phasic transmitter release on synaptotagmin 1 at
GABAergic and glutamatergic hippocampal synapses
type: journal_article
volume: 105
year: '2008'
...
---
_id: '3872'
abstract:
- lang: eng
text: We survey value iteration algorithms on graphs. Such algorithms can be used
for determining the existence of certain paths (model checking), the existence
of certain strategies (game solving), and the probabilities of certain events
(performance analysis). We classify the algorithms according to the value domain
(boolean, probabilistic, or quantitative); according to the graph structure (nondeterministic,
probabilistic, or multi-player); according to the desired property of paths (Borel
level 1, 2, or 3); and according to the alternation depth and convergence rate
of fixpoint computations.
acknowledgement: This research was supported in part by the Swiss National Science
Foundation and by the NSF grants CCR-0225610 and CCR-0234690.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Chatterjee K, Henzinger TA. Value iteration. In: 25 Years in Model Checking.
Vol 5000. Springer; 2008:107-138. doi:10.1007/978-3-540-69850-0_7'
apa: Chatterjee, K., & Henzinger, T. A. (2008). Value iteration. In 25 Years
in Model Checking (Vol. 5000, pp. 107–138). Springer. https://doi.org/10.1007/978-3-540-69850-0_7
chicago: Chatterjee, Krishnendu, and Thomas A Henzinger. “Value Iteration.” In 25
Years in Model Checking, 5000:107–38. Springer, 2008. https://doi.org/10.1007/978-3-540-69850-0_7.
ieee: K. Chatterjee and T. A. Henzinger, “Value iteration,” in 25 Years in Model
Checking, vol. 5000, Springer, 2008, pp. 107–138.
ista: 'Chatterjee K, Henzinger TA. 2008.Value iteration. In: 25 Years in Model Checking.
LNCS, vol. 5000, 107–138.'
mla: Chatterjee, Krishnendu, and Thomas A. Henzinger. “Value Iteration.” 25 Years
in Model Checking, vol. 5000, Springer, 2008, pp. 107–38, doi:10.1007/978-3-540-69850-0_7.
short: K. Chatterjee, T.A. Henzinger, in:, 25 Years in Model Checking, Springer,
2008, pp. 107–138.
date_created: 2018-12-11T12:05:38Z
date_published: 2008-01-01T00:00:00Z
date_updated: 2021-01-12T07:52:51Z
day: '01'
doi: 10.1007/978-3-540-69850-0_7
extern: 1
intvolume: ' 5000'
month: '01'
page: 107 - 138
publication: 25 Years in Model Checking
publication_status: published
publisher: Springer
publist_id: '2299'
quality_controlled: 0
status: public
title: Value iteration
type: book_chapter
volume: 5000
year: '2008'
...
---
_id: '3873'
abstract:
- lang: eng
text: We study the controller synthesis problem under budget constraints. In this
problem, there is a cost associated with making an observation, and a controller
can make only a limited number of observations in each round so that the total
cost of the observations does not exceed a given fixed budget. The controller
must ensure some omega-regular requirement subject to the budget constraint. Budget
constraints arise in designing and implementing controllers for resource-constrained
embedded systems, where a controller may not have enough power, time, or bandwidth
to obtain data from all sensors in each round. They lead to games of imperfect
information, where the unknown information is not fixed a priori, but can vary
from round to round, based on the choices made by the controller how to allocate
its budget. We show that the budget-constrained synthesis problem for W-regular
objectives is complete for exponential time. In addition to studying synthesis
under a fixed budget constraint, we study the budget optimization problem, where
given a plant, an objective, and observation costs, we have to find a controller
that achieves the objective with minimal average accumulated cost (or minimal
peak cost). We show that this problem is reducible to a game of imperfect information
where the winning objective is a conjunction of an omega-regular condition and
a long-run average condition (or a least max-cost condition), and this again leads
to an exponential-time algorithm. Finally, we extend our results to games over
infinite state spaces, and show that the budget-constrained synthesis problem
is decidable for infinite state games with stable quotients of finite index. Consequently,
the discrete time budget-constrained synthesis problem is decidable for rectangular
hybrid automata.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Ritankar
full_name: Majumdar, Ritankar S
last_name: Majumdar
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Chatterjee K, Majumdar R, Henzinger TA. Controller synthesis with budget constraints.
In: Vol 4981. Springer; 2008:72-86. doi:DOI:
10.1007/978-3-540-78929-1_6'
apa: 'Chatterjee, K., Majumdar, R., & Henzinger, T. A. (2008). Controller synthesis
with budget constraints (Vol. 4981, pp. 72–86). Presented at the HSCC: Hybrid
Systems - Computation and Control, Springer. https://doi.org/DOI:
10.1007/978-3-540-78929-1_6'
chicago: 'Chatterjee, Krishnendu, Ritankar Majumdar, and Thomas A Henzinger. “Controller
Synthesis with Budget Constraints,” 4981:72–86. Springer, 2008. https://doi.org/DOI: 10.1007/978-3-540-78929-1_6.'
ieee: 'K. Chatterjee, R. Majumdar, and T. A. Henzinger, “Controller synthesis with
budget constraints,” presented at the HSCC: Hybrid Systems - Computation and Control,
2008, vol. 4981, pp. 72–86.'
ista: 'Chatterjee K, Majumdar R, Henzinger TA. 2008. Controller synthesis with budget
constraints. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 4981,
72–86.'
mla: 'Chatterjee, Krishnendu, et al. Controller Synthesis with Budget Constraints.
Vol. 4981, Springer, 2008, pp. 72–86, doi:DOI:
10.1007/978-3-540-78929-1_6.'
short: K. Chatterjee, R. Majumdar, T.A. Henzinger, in:, Springer, 2008, pp. 72–86.
conference:
name: 'HSCC: Hybrid Systems - Computation and Control'
date_created: 2018-12-11T12:05:38Z
date_published: 2008-04-03T00:00:00Z
date_updated: 2021-01-12T07:52:51Z
day: '03'
doi: 'DOI: 10.1007/978-3-540-78929-1_6'
extern: 1
intvolume: ' 4981'
month: '04'
page: 72 - 86
publication_status: published
publisher: Springer
publist_id: '2296'
quality_controlled: 0
status: public
title: Controller synthesis with budget constraints
type: conference
volume: 4981
year: '2008'
...
---
_id: '3874'
abstract:
- lang: eng
text: We consider concurrent two-player timed automaton games with omega-regular
objectives specified as parity conditions. These games offer an appropriate model
for the synthesis of real-time controllers. Earlier works on timed games focused
on pure strategies for each player. We study, for the first time, the use of randomized
strategies in such games. While pure (i.e., nonrandomized) strategies in timed
games require infinite memory for winning even with respect to reachability objectives,
we show that randomized strategies can win with finite memory with respect to
all parity objectives. Also, the synthesized randomized real-time controllers
are much simpler in structure than the corresponding pure controllers, and therefore
easier to implement. For safety objectives we prove the existence of pure finite-memory
winning strategies. Finally, while randomization helps in simplifying the strategies
required for winning timed parity games, we prove that randomization does not
help in winning at more states.
acknowledgement: This research was supported in part by the NSF grants CCR-0208875,
CCR-0225610, CCR-0234690, by the Swiss National Science Foundation, and by the Artist2
European Network of Excellence.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Vinayak
full_name: Prabhu, Vinayak S
last_name: Prabhu
citation:
ama: 'Chatterjee K, Henzinger TA, Prabhu V. Trading infinite memory for uniform
randomness in timed games. In: Vol 4981. Springer; 2008:87-100. doi:10.1007/978-3-540-78929-1_7'
apa: 'Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2008). Trading infinite
memory for uniform randomness in timed games (Vol. 4981, pp. 87–100). Presented
at the HSCC: Hybrid Systems - Computation and Control, Springer. https://doi.org/10.1007/978-3-540-78929-1_7'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Trading
Infinite Memory for Uniform Randomness in Timed Games,” 4981:87–100. Springer,
2008. https://doi.org/10.1007/978-3-540-78929-1_7.
ieee: 'K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Trading infinite memory for
uniform randomness in timed games,” presented at the HSCC: Hybrid Systems - Computation
and Control, 2008, vol. 4981, pp. 87–100.'
ista: 'Chatterjee K, Henzinger TA, Prabhu V. 2008. Trading infinite memory for uniform
randomness in timed games. HSCC: Hybrid Systems - Computation and Control, LNCS,
vol. 4981, 87–100.'
mla: Chatterjee, Krishnendu, et al. Trading Infinite Memory for Uniform Randomness
in Timed Games. Vol. 4981, Springer, 2008, pp. 87–100, doi:10.1007/978-3-540-78929-1_7.
short: K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Springer, 2008, pp. 87–100.
conference:
name: 'HSCC: Hybrid Systems - Computation and Control'
date_created: 2018-12-11T12:05:38Z
date_published: 2008-04-03T00:00:00Z
date_updated: 2021-01-12T07:52:51Z
day: '03'
doi: 10.1007/978-3-540-78929-1_7
extern: 1
intvolume: ' 4981'
month: '04'
page: 87 - 100
publication_status: published
publisher: Springer
publist_id: '2297'
quality_controlled: 0
status: public
title: Trading infinite memory for uniform randomness in timed games
type: conference
volume: 4981
year: '2008'
...
---
_id: '3875'
abstract:
- lang: eng
text: We study the problem of model checking Interval-valued Discrete-time Markov
Chains (IDTMC). IDTMCs are discrete-time finite Markov Chains for which the exact
transition probabilities are riot known. Instead in IDTMCs, each transition is
associated with an interval in which the actual transition probability must lie.
We consider two semantic interpretations for the uncertainty in the transition
probabilities of an IDTMC. In the first interpretation, we think of an IDTMC as
representing a (possibly uncountable) family of (classical) discrete-time Markov
Chains, where each member of the family is a Markov Chain whose transition probabilities
lie within the interval range given in the IDTMC. We call this semantic interpretation
Uncertain Markov Chains (UMC). In the second semantics for an IDTMC, which we
call Interval Markov Decision Process (IMDP), we view the uncertainty as being
resolved through non-determinism. In other words, each time a state is visited,
we adversarially pick a transition distribution that respects the interval constraints,
and take a probabilistic step according to the chosen distribution. We introduce
a logic omega-PCTL that can express liveness, strong fairness, and omega-regular
properties (such properties cannot be expressed in PCTL). We show that the omega-PCTL
model checking problem for Uncertain Markov Chain semantics is decidable in PSPACE
(same as the best known upper bound for PCTL) and for Interval Markov Decision
Process semantics is decidable in coNP (improving the previous known PSPACE bound
for PCTL). We also show that the qualitative fragment of the logic can lie solved
in coNP for the UMC interpretation, and can be solved in polynomial time for a
sub-class of UMCs. We also prove lower bounds for these model checking problems.
We show that the model checking problem of IDTMCs with LTL formulas can be solved
for both UMC and IMDP semantics by reduction to the model checking problem of
IDTMC with omega-PcTL formulas.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Koushik
full_name: Sen, Koushik
last_name: Sen
citation:
ama: 'Chatterjee K, Henzinger TA, Sen K. Model-checking omega-regular properties
of interval Markov chains. In: Vol 4962. Springer; 2008:302-317. doi:10.1007/978-3-540-78499-9_22'
apa: 'Chatterjee, K., Henzinger, T. A., & Sen, K. (2008). Model-checking omega-regular
properties of interval Markov chains (Vol. 4962, pp. 302–317). Presented at the
FoSSaCS: Foundations of Software Science and Computation Structures, Springer.
https://doi.org/10.1007/978-3-540-78499-9_22'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Koushik Sen. “Model-Checking
Omega-Regular Properties of Interval Markov Chains,” 4962:302–17. Springer, 2008.
https://doi.org/10.1007/978-3-540-78499-9_22.
ieee: 'K. Chatterjee, T. A. Henzinger, and K. Sen, “Model-checking omega-regular
properties of interval Markov chains,” presented at the FoSSaCS: Foundations of
Software Science and Computation Structures, 2008, vol. 4962, pp. 302–317.'
ista: 'Chatterjee K, Henzinger TA, Sen K. 2008. Model-checking omega-regular properties
of interval Markov chains. FoSSaCS: Foundations of Software Science and Computation
Structures, LNCS, vol. 4962, 302–317.'
mla: Chatterjee, Krishnendu, et al. Model-Checking Omega-Regular Properties of
Interval Markov Chains. Vol. 4962, Springer, 2008, pp. 302–17, doi:10.1007/978-3-540-78499-9_22.
short: K. Chatterjee, T.A. Henzinger, K. Sen, in:, Springer, 2008, pp. 302–317.
conference:
name: 'FoSSaCS: Foundations of Software Science and Computation Structures'
date_created: 2018-12-11T12:05:39Z
date_published: 2008-03-01T00:00:00Z
date_updated: 2021-01-12T07:52:52Z
day: '01'
doi: 10.1007/978-3-540-78499-9_22
extern: 1
intvolume: ' 4962'
month: '03'
page: 302 - 317
publication_status: published
publisher: Springer
publist_id: '2298'
quality_controlled: 0
status: public
title: Model-checking omega-regular properties of interval Markov chains
type: conference
volume: 4962
year: '2008'
...
---
_id: '3876'
abstract:
- lang: eng
text: We consider two-player games played in real time on game structures with clocks
and parity objectives. The games are concurrent in that at each turn, both players
independently propose a time delay and an action, and the action with the shorter
delay is chosen. To prevent a player from winning by blocking time, we restrict
each player to strategies that ensure that the player cannot be responsible for
causing a zeno run. First, we present an efficient reduction of these games to
turn-based (i.e., nonconcurrent) finite-state (i.e., untimed) parity games. The
states of the resulting game are pairs of clock regions of the original game.
Our reduction improves the best known complexity for solving timed parity games.
Moreover, the rich class of algorithms for classical parity games can now be applied
to timed parity games. Second, we consider two restricted classes of strategies
for the player that represents the controller in a real-time synthesis problem,
namely, limit-robust and bounded-robust strategies. Using a limit-robust strategy,
the controller cannot choose an exact real-valued time delay but must allow for
some nonzero jitter in each of its actions. If there is a given lower bound on
the jitter, then the strategy is bounded-robust. We show that exact strategies
are more powerful than limit-robust strategies, which are more powerful than bounded-robust
strategies for any bound. For both kinds of robust strategies, we present efficient
reductions to standard timed automaton games. These reductions provide algorithms
for the synthesis of robust real-time controllers.
acknowledgement: This research was supported in part by the NSF grants CCR-0132780,
CNS-0720884, and CCR-0225610, and by the European COMBEST project.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Vinayak
full_name: Prabhu, Vinayak S
last_name: Prabhu
citation:
ama: 'Chatterjee K, Henzinger TA, Prabhu V. Timed parity games: complexity and robustness.
In: Vol 5215. Springer; 2008:124-140. doi:10.1007/978-3-540-85778-5_10'
apa: 'Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2008). Timed parity games:
complexity and robustness (Vol. 5215, pp. 124–140). Presented at the FORMATS:
Formal Modeling and Analysis of Timed Systems, Springer. https://doi.org/10.1007/978-3-540-85778-5_10'
chicago: 'Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed
Parity Games: Complexity and Robustness,” 5215:124–40. Springer, 2008. https://doi.org/10.1007/978-3-540-85778-5_10.'
ieee: 'K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: complexity
and robustness,” presented at the FORMATS: Formal Modeling and Analysis of Timed
Systems, 2008, vol. 5215, pp. 124–140.'
ista: 'Chatterjee K, Henzinger TA, Prabhu V. 2008. Timed parity games: complexity
and robustness. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS,
vol. 5215, 124–140.'
mla: 'Chatterjee, Krishnendu, et al. Timed Parity Games: Complexity and Robustness.
Vol. 5215, Springer, 2008, pp. 124–40, doi:10.1007/978-3-540-85778-5_10.'
short: K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Springer, 2008, pp. 124–140.
conference:
name: 'FORMATS: Formal Modeling and Analysis of Timed Systems'
date_created: 2018-12-11T12:05:39Z
date_published: 2008-10-01T00:00:00Z
date_updated: 2023-02-23T11:21:54Z
day: '01'
doi: 10.1007/978-3-540-85778-5_10
extern: 1
intvolume: ' 5215'
month: '10'
page: 124 - 140
publication_status: published
publisher: Springer
publist_id: '2294'
quality_controlled: 0
related_material:
record:
- id: '3315'
relation: later_version
status: public
status: public
title: 'Timed parity games: complexity and robustness'
type: conference
volume: 5215
year: '2008'
...
---
_id: '3877'
abstract:
- lang: eng
text: The synthesis problem asks to construct a reactive finite-state system from
an omega-regular specification. Initial specifications are often unrealizable,
which means that there is no system that implements the specification. A common
reason for unrealizability is that assumptions on the environment of the system
are incomplete. We study the problem of correcting an unrealizable specification
phi by computing an environment assumption psi such that the new specification
psi -> phi is realizable. Our aim is to construct an assumption psi that constrains
only the environment and is as weak as possible. We present a two-step algorithm
for computing assumptions. The algorithm operates on the game graph that is used
to answer the realizability question. First, we compute a safety assumption that
removes a minimal set of environment edges from the graph. Second, we compute
a liveness assumption that puts fairness conditions on some of the remaining environment
edges. We show that the problem of finding a minimal set of fair edges is computationally
hard, and we use probabilistic games to compute a locally minimal fairness assumption.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Barbara
full_name: Jobstmann, Barbara
last_name: Jobstmann
citation:
ama: 'Chatterjee K, Henzinger TA, Jobstmann B. Environment assumptions for synthesis.
In: Vol 5201. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2008:147-161.
doi:10.1007/978-3-540-85361-9_14'
apa: 'Chatterjee, K., Henzinger, T. A., & Jobstmann, B. (2008). Environment
assumptions for synthesis (Vol. 5201, pp. 147–161). Presented at the CONCUR: Concurrency
Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-85361-9_14'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Barbara Jobstmann. “Environment
Assumptions for Synthesis,” 5201:147–61. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2008. https://doi.org/10.1007/978-3-540-85361-9_14.
ieee: 'K. Chatterjee, T. A. Henzinger, and B. Jobstmann, “Environment assumptions
for synthesis,” presented at the CONCUR: Concurrency Theory, 2008, vol. 5201,
pp. 147–161.'
ista: 'Chatterjee K, Henzinger TA, Jobstmann B. 2008. Environment assumptions for
synthesis. CONCUR: Concurrency Theory, LNCS, vol. 5201, 147–161.'
mla: Chatterjee, Krishnendu, et al. Environment Assumptions for Synthesis.
Vol. 5201, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 147–61,
doi:10.1007/978-3-540-85361-9_14.
short: K. Chatterjee, T.A. Henzinger, B. Jobstmann, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2008, pp. 147–161.
conference:
name: 'CONCUR: Concurrency Theory'
date_created: 2018-12-11T12:05:39Z
date_published: 2008-07-30T00:00:00Z
date_updated: 2021-01-12T07:52:53Z
day: '30'
doi: 10.1007/978-3-540-85361-9_14
extern: 1
intvolume: ' 5201'
month: '07'
page: 147 - 161
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '2295'
quality_controlled: 0
status: public
title: Environment assumptions for synthesis
type: conference
volume: 5201
year: '2008'
...
---
_id: '3878'
abstract:
- lang: eng
text: We study the problem of generating a test sequence that achieves maximal coverage
for a reactive system under test. We formulate the problem as a repeated game
between the tester and the system, where the system state space is partitioned
according to some coverage criterion and the objective of the tester is to maximize
the set of partitions (or coverage goals) visited during the game. We show the
complexity of the maximal coverage problem for non-deterministic systems is PSPACE-complete,
but is NP-complete for deterministic systems. For the special case of non-deterministic
systems with a re-initializing “reset” action, which represent running a new test
input on a re-initialized system, we show that the complexity is coNP-complete.
Our proof technique for reset games uses randomized testing strategies that circumvent
the exponentially large memory requirement of deterministic testing strategies.
acknowledgement: This research was supported in part by the NSF grants CCR-0132780
and CNS-0720884.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Luca
full_name: de Alfaro, Luca
last_name: De Alfaro
- first_name: Ritankar
full_name: Majumdar, Ritankar S
last_name: Majumdar
citation:
ama: 'Chatterjee K, De Alfaro L, Majumdar R. The complexity of coverage. In: Vol
5356. Springer; 2008:91-106. doi:10.1007/978-3-540-89330-1_7'
apa: 'Chatterjee, K., De Alfaro, L., & Majumdar, R. (2008). The complexity of
coverage (Vol. 5356, pp. 91–106). Presented at the APLAS: Asian Symposium on Programming
Languages and Systems, Springer. https://doi.org/10.1007/978-3-540-89330-1_7'
chicago: Chatterjee, Krishnendu, Luca De Alfaro, and Ritankar Majumdar. “The Complexity
of Coverage,” 5356:91–106. Springer, 2008. https://doi.org/10.1007/978-3-540-89330-1_7.
ieee: 'K. Chatterjee, L. De Alfaro, and R. Majumdar, “The complexity of coverage,”
presented at the APLAS: Asian Symposium on Programming Languages and Systems,
2008, vol. 5356, pp. 91–106.'
ista: 'Chatterjee K, De Alfaro L, Majumdar R. 2008. The complexity of coverage.
APLAS: Asian Symposium on Programming Languages and Systems, LNCS, vol. 5356,
91–106.'
mla: Chatterjee, Krishnendu, et al. The Complexity of Coverage. Vol. 5356,
Springer, 2008, pp. 91–106, doi:10.1007/978-3-540-89330-1_7.
short: K. Chatterjee, L. De Alfaro, R. Majumdar, in:, Springer, 2008, pp. 91–106.
conference:
name: 'APLAS: Asian Symposium on Programming Languages and Systems'
date_created: 2018-12-11T12:05:40Z
date_published: 2008-12-03T00:00:00Z
date_updated: 2021-01-12T07:52:53Z
day: '03'
doi: 10.1007/978-3-540-89330-1_7
extern: 1
intvolume: ' 5356'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/0804.4525
month: '12'
oa: 1
page: 91 - 106
publication_status: published
publisher: Springer
publist_id: '2292'
quality_controlled: 0
status: public
title: The complexity of coverage
type: conference
volume: 5356
year: '2008'
...
---
_id: '3879'
abstract:
- lang: eng
text: Quantitative generalizations of classical languages, which assign to each
word a real number instead of a boolean value, have applications in modeling resource-constrained
computation. We use weighted automata (finite automata with transition weights)
to define several natural classes of quantitative languages over finite and infinite
words; in particular, the real value of an infinite run is computed as the maximum,
limsup, liminf, limit average, or discounted sum of the transition weights. We
define the classical decision problems of automata theory (emptiness, universality,
language inclusion, and language equivalence) in the quantitative setting and
study their computational complexity. As the decidability of language inclusion
remains open for some classes of weighted automata, we introduce a notion of quantitative
simulation that is decidable and implies language inclusion. We also give a complete
characterization of the expressive power of the various classes of weighted automata.
In particular, we show that most classes of weighted automata cannot be determinized.
acknowledgement: Research supported in part by the NSF grants CCR-0132780, CNS-0720884,
and CCR-0225610, by the Swiss National Science Foundation, and by the European COMBEST
project.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Chatterjee K, Doyen L, Henzinger TA. Quantitative languages. In: Vol 5213.
Springer; 2008:385-400. doi:10.1007/978-3-540-87531-4_28'
apa: 'Chatterjee, K., Doyen, L., & Henzinger, T. A. (2008). Quantitative languages
(Vol. 5213, pp. 385–400). Presented at the CSL: Computer Science Logic, Springer.
https://doi.org/10.1007/978-3-540-87531-4_28'
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Quantitative
Languages,” 5213:385–400. Springer, 2008. https://doi.org/10.1007/978-3-540-87531-4_28.
ieee: 'K. Chatterjee, L. Doyen, and T. A. Henzinger, “Quantitative languages,” presented
at the CSL: Computer Science Logic, 2008, vol. 5213, pp. 385–400.'
ista: 'Chatterjee K, Doyen L, Henzinger TA. 2008. Quantitative languages. CSL: Computer
Science Logic, LNCS, vol. 5213, 385–400.'
mla: Chatterjee, Krishnendu, et al. Quantitative Languages. Vol. 5213, Springer,
2008, pp. 385–400, doi:10.1007/978-3-540-87531-4_28.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2008, pp. 385–400.
conference:
name: 'CSL: Computer Science Logic'
date_created: 2018-12-11T12:05:40Z
date_published: 2008-09-10T00:00:00Z
date_updated: 2021-01-12T07:52:54Z
day: '10'
doi: 10.1007/978-3-540-87531-4_28
extern: 1
intvolume: ' 5213'
month: '09'
page: 385 - 400
publication_status: published
publisher: Springer
publist_id: '2293'
quality_controlled: 0
status: public
title: Quantitative languages
type: conference
volume: 5213
year: '2008'
...
---
_id: '3880'
abstract:
- lang: eng
text: We consider imperfect-information parity games in which strategies rely on
observations that provide imperfect information about the history of a play. To
solve such games, i.e., to determine the winning regions of players and corresponding
winning strategies, one can use the subset construction to build an equivalent
perfect-information game. Recently, an algorithm that avoids the inefficient subset
construction has been proposed. The algorithm performs a fixed-point computation
in a lattice of antichains, thus maintaining a succinct representation of state
sets. However, this representation does not allow to recover winning strategies.
In this paper, we build on the antichain approach to develop an algorithm for
constructing the winning strategies in parity games of imperfect information.
We have implemented this algorithm as a prototype. To our knowledge, this is the
first implementation of a procedure for solving imperfect-information parity games
on graphs.
alternative_title:
- LNCS
author:
- first_name: Dietmar
full_name: Berwanger, Dietmar
last_name: Berwanger
- first_name: Krishnendu
full_name: Krishnendu Chatterjee
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Sangram
full_name: Raje, Sangram
last_name: Raje
citation:
ama: 'Berwanger D, Chatterjee K, Doyen L, Henzinger TA, Raje S. Strategy construction
for parity games with imperfect information. In: Vol 5201. Schloss Dagstuhl -
Leibniz-Zentrum für Informatik; 2008:325-339. doi:10.1007/978-3-540-85361-9'
apa: 'Berwanger, D., Chatterjee, K., Doyen, L., Henzinger, T. A., & Raje, S.
(2008). Strategy construction for parity games with imperfect information (Vol.
5201, pp. 325–339). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-85361-9'
chicago: Berwanger, Dietmar, Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger,
and Sangram Raje. “Strategy Construction for Parity Games with Imperfect Information,”
5201:325–39. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008. https://doi.org/10.1007/978-3-540-85361-9.
ieee: 'D. Berwanger, K. Chatterjee, L. Doyen, T. A. Henzinger, and S. Raje, “Strategy
construction for parity games with imperfect information,” presented at the CONCUR:
Concurrency Theory, 2008, vol. 5201, pp. 325–339.'
ista: 'Berwanger D, Chatterjee K, Doyen L, Henzinger TA, Raje S. 2008. Strategy
construction for parity games with imperfect information. CONCUR: Concurrency
Theory, LNCS, vol. 5201, 325–339.'
mla: Berwanger, Dietmar, et al. Strategy Construction for Parity Games with Imperfect
Information. Vol. 5201, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2008, pp. 325–39, doi:10.1007/978-3-540-85361-9.
short: D. Berwanger, K. Chatterjee, L. Doyen, T.A. Henzinger, S. Raje, in:, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 325–339.
conference:
name: 'CONCUR: Concurrency Theory'
date_created: 2018-12-11T12:05:40Z
date_published: 2008-07-30T00:00:00Z
date_updated: 2023-02-23T11:46:01Z
day: '30'
doi: 10.1007/978-3-540-85361-9
extern: 1
intvolume: ' 5201'
month: '07'
page: 325 - 339
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '2291'
quality_controlled: 0
related_material:
record:
- id: '3863'
relation: later_version
status: public
status: public
title: Strategy construction for parity games with imperfect information
type: conference
volume: 5201
year: '2008'
...
---
_id: '3903'
abstract:
- lang: eng
text: "Background\r\n\r\nThe invasive garden ant, Lasius neglectus, is the most
recently detected pest ant and the first known invasive ant able to become established
and thrive in the temperate regions of Eurasia. In this study, we aim to reconstruct
the invasion history of this ant in Europe analysing 14 populations with three
complementary approaches: genetic microsatellite analysis, chemical analysis of
cuticular hydrocarbon profiles and behavioural observations of aggression behaviour.
We evaluate the relative informative power of the three methodological approaches
and estimate both the number of independent introduction events from a yet unknown
native range somewhere in the Black Sea area, and the invasive potential of the
existing introduced populations.\r\n\r\nResults\r\n\r\nThree clusters of genetically
similar populations were detected, and all but one population had a similar chemical
profile. Aggression between populations could be predicted from their genetic
and chemical distance, and two major clusters of non-aggressive groups of populations
were found. However, populations of L. neglectus did not separate into clear supercolonial
associations, as is typical for other invasive ants.\r\n\r\nConclusion\r\n\r\nThe
three methodological approaches gave consistent and complementary results. All
joint evidence supports the inference that the 14 introduced populations of L.
neglectus in Europe likely arose from only very few independent introductions
from the native range, and that new infestations were typically started through
introductions from other invasive populations. This indicates that existing introduced
populations have a very high invasive potential when the ants are inadvertently
spread by human transport. "
author:
- first_name: Line V
full_name: Ugelvig, Line V
id: 3DC97C8E-F248-11E8-B48F-1D18A9856A87
last_name: Ugelvig
orcid: 0000-0003-1832-8883
- first_name: Falko
full_name: Drijfhout, Falko
last_name: Drijfhout
- first_name: Daniel
full_name: Kronauer, Daniel
last_name: Kronauer
- first_name: Jacobus
full_name: Boomsma, Jacobus
last_name: Boomsma
- first_name: Jes
full_name: Pedersen, Jes
last_name: Pedersen
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: 'Ugelvig LV, Drijfhout F, Kronauer D, Boomsma J, Pedersen J, Cremer S. The
introduction history of invasive garden ants in Europe: integrating genetic, chemical
and behavioural approaches. BMC Biology. 2008;6(11). doi:10.1186/1741-7007-6-11'
apa: 'Ugelvig, L. V., Drijfhout, F., Kronauer, D., Boomsma, J., Pedersen, J., &
Cremer, S. (2008). The introduction history of invasive garden ants in Europe:
integrating genetic, chemical and behavioural approaches. BMC Biology.
BioMed Central. https://doi.org/10.1186/1741-7007-6-11'
chicago: 'Ugelvig, Line V, Falko Drijfhout, Daniel Kronauer, Jacobus Boomsma, Jes
Pedersen, and Sylvia Cremer. “The Introduction History of Invasive Garden Ants
in Europe: Integrating Genetic, Chemical and Behavioural Approaches.” BMC Biology.
BioMed Central, 2008. https://doi.org/10.1186/1741-7007-6-11.'
ieee: 'L. V. Ugelvig, F. Drijfhout, D. Kronauer, J. Boomsma, J. Pedersen, and S.
Cremer, “The introduction history of invasive garden ants in Europe: integrating
genetic, chemical and behavioural approaches,” BMC Biology, vol. 6, no.
11. BioMed Central, 2008.'
ista: 'Ugelvig LV, Drijfhout F, Kronauer D, Boomsma J, Pedersen J, Cremer S. 2008.
The introduction history of invasive garden ants in Europe: integrating genetic,
chemical and behavioural approaches. BMC Biology. 6(11).'
mla: 'Ugelvig, Line V., et al. “The Introduction History of Invasive Garden Ants
in Europe: Integrating Genetic, Chemical and Behavioural Approaches.” BMC Biology,
vol. 6, no. 11, BioMed Central, 2008, doi:10.1186/1741-7007-6-11.'
short: L.V. Ugelvig, F. Drijfhout, D. Kronauer, J. Boomsma, J. Pedersen, S. Cremer,
BMC Biology 6 (2008).
date_created: 2018-12-11T12:05:48Z
date_published: 2008-02-26T00:00:00Z
date_updated: 2021-01-12T07:53:05Z
day: '26'
doi: 10.1186/1741-7007-6-11
extern: '1'
intvolume: ' 6'
issue: '11'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '02'
oa_version: None
publication: BMC Biology
publication_status: published
publisher: BioMed Central
publist_id: '2249'
status: public
title: 'The introduction history of invasive garden ants in Europe: integrating genetic,
chemical and behavioural approaches'
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2008'
...
---
_id: '3905'
abstract:
- lang: eng
text: Winged and wingless males coexist in the ant Cardiocondyla obscurior. Wingless
(“ergatoid”) males never leave their maternal colony and fight remorselessly among
each other for the access to emerging females. The peaceful winged males disperse
after about 10 days, but beforehand also mate in the nest. In the first 5 days
of their life, winged males perform a chemical female mimicry that protects them
against attack and even makes them sexually attractive to ergatoid males. When
older, the chemical profile of winged males no longer matches that of virgin females;
nevertheless, they are still tolerated, which so far has been puzzling. Contrasting
this general pattern, we have identified a single aberrant colony in which all
winged males were attacked and killed by the ergatoid males. A comparative analysis
of the morphology and chemical profile of these untypical attacked winged males
and the tolerated males from several normal colonies revealed that normal old
males are still performing some chemical mimicry to the virgin queens, though
less perfect than in their young ages. The anomalous attacked winged males, on
the other hand, had a very different odour to the females. Our study thus exemplifies
that the analysis of rare malfunctioning can add valuable insight on functioning
under normal conditions and allows the conclusion that older winged males from
normal colonies of the ant C. obscurior are guarded through an imperfect chemical
female mimicry, still close enough to protect against attacks by the wingless
fighters yet dissimilar enough not to elicit their sexual interest.
author:
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
- first_name: Patrizia
full_name: D'Ettorre, Patrizia
last_name: D'Ettorre
- first_name: Falko
full_name: Drijfhout, Falko
last_name: Drijfhout
- first_name: Matthew
full_name: Sledge, Matthew
last_name: Sledge
- first_name: Stefano
full_name: Turillazzi, Stefano
last_name: Turillazzi
- first_name: Jürgen
full_name: Heinze, Jürgen
last_name: Heinze
citation:
ama: Cremer S, D’Ettorre P, Drijfhout F, Sledge M, Turillazzi S, Heinze J. Imperfect
chemical female mimicry in males of the ant Cardiocondyla obscurior. Naturwissenschaften.
2008;95(11):1101-1105. doi:10.1007/s00114-008-0430-8
apa: Cremer, S., D’Ettorre, P., Drijfhout, F., Sledge, M., Turillazzi, S., &
Heinze, J. (2008). Imperfect chemical female mimicry in males of the ant Cardiocondyla
obscurior. Naturwissenschaften. Springer. https://doi.org/10.1007/s00114-008-0430-8
chicago: Cremer, Sylvia, Patrizia D’Ettorre, Falko Drijfhout, Matthew Sledge, Stefano
Turillazzi, and Jürgen Heinze. “Imperfect Chemical Female Mimicry in Males of
the Ant Cardiocondyla Obscurior.” Naturwissenschaften. Springer, 2008.
https://doi.org/10.1007/s00114-008-0430-8.
ieee: S. Cremer, P. D’Ettorre, F. Drijfhout, M. Sledge, S. Turillazzi, and J. Heinze,
“Imperfect chemical female mimicry in males of the ant Cardiocondyla obscurior,”
Naturwissenschaften, vol. 95, no. 11. Springer, pp. 1101–1105, 2008.
ista: Cremer S, D’Ettorre P, Drijfhout F, Sledge M, Turillazzi S, Heinze J. 2008.
Imperfect chemical female mimicry in males of the ant Cardiocondyla obscurior.
Naturwissenschaften. 95(11), 1101–1105.
mla: Cremer, Sylvia, et al. “Imperfect Chemical Female Mimicry in Males of the Ant
Cardiocondyla Obscurior.” Naturwissenschaften, vol. 95, no. 11, Springer,
2008, pp. 1101–05, doi:10.1007/s00114-008-0430-8.
short: S. Cremer, P. D’Ettorre, F. Drijfhout, M. Sledge, S. Turillazzi, J. Heinze,
Naturwissenschaften 95 (2008) 1101–1105.
date_created: 2018-12-11T12:05:48Z
date_published: 2008-08-05T00:00:00Z
date_updated: 2021-01-12T07:53:06Z
day: '05'
doi: 10.1007/s00114-008-0430-8
extern: '1'
intvolume: ' 95'
issue: '11'
language:
- iso: eng
month: '08'
oa_version: None
page: 1101 - 1105
publication: Naturwissenschaften
publication_status: published
publisher: Springer
publist_id: '2246'
status: public
title: Imperfect chemical female mimicry in males of the ant Cardiocondyla obscurior
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 95
year: '2008'
...
---
_id: '3906'
acknowledgement: 'Funding was obtained from the European Community: FP5 EU research-training
network ‘INSECTS’ (JJB SC PD FPD DPH) and FP6 Individual Marie Curie EIF grant (SC),
the Alexander-von-Humboldt Foundation (Feodor-Lynen postdoctoral stipend to SC),
the Danish Natural Science Research Council (JSP), the Danish National Research
Foundation (JJB DRN JSP), and the Austrian Science Fund (BCS FMS CS HK).'
author:
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
- first_name: Line V
full_name: Ugelvig, Line V
id: 3DC97C8E-F248-11E8-B48F-1D18A9856A87
last_name: Ugelvig
orcid: 0000-0003-1832-8883
- first_name: Falko
full_name: Drijfhout, Falko
last_name: Drijfhout
- first_name: Birgit
full_name: Schlick Steiner, Birgit
last_name: Schlick Steiner
- first_name: Florian
full_name: Steiner, Florian
last_name: Steiner
- first_name: Bernhard
full_name: Seifert, Bernhard
last_name: Seifert
- first_name: David
full_name: Hughes, David
last_name: Hughes
- first_name: Andreas
full_name: Schulz, Andreas
last_name: Schulz
- first_name: Klaus
full_name: Petersen, Klaus
last_name: Petersen
- first_name: Heino
full_name: Konrad, Heino
last_name: Konrad
- first_name: Christian
full_name: Stauffer, Christian
last_name: Stauffer
- first_name: Kadri
full_name: Kiran, Kadri
last_name: Kiran
- first_name: Xavier
full_name: Espadaler, Xavier
last_name: Espadaler
- first_name: Patrizia
full_name: D'Ettorre, Patrizia
last_name: D'Ettorre
- first_name: Nihat
full_name: Aktaç, Nihat
last_name: Aktaç
- first_name: Jørgen
full_name: Eilenberg, Jørgen
last_name: Eilenberg
- first_name: Graeme
full_name: Jones, Graeme
last_name: Jones
- first_name: David
full_name: Nash, David
last_name: Nash
- first_name: Jes
full_name: Pedersen, Jes
last_name: Pedersen
- first_name: Jacobus
full_name: Boomsma, Jacobus
last_name: Boomsma
citation:
ama: Cremer S, Ugelvig LV, Drijfhout F, et al. The evolution of invasiveness in
garden ants. PLoS One. 2008;3(12). doi:10.1371/journal.pone.0003838
apa: Cremer, S., Ugelvig, L. V., Drijfhout, F., Schlick Steiner, B., Steiner, F.,
Seifert, B., … Boomsma, J. (2008). The evolution of invasiveness in garden ants.
PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0003838
chicago: Cremer, Sylvia, Line V Ugelvig, Falko Drijfhout, Birgit Schlick Steiner,
Florian Steiner, Bernhard Seifert, David Hughes, et al. “The Evolution of Invasiveness
in Garden Ants.” PLoS One. Public Library of Science, 2008. https://doi.org/10.1371/journal.pone.0003838.
ieee: S. Cremer et al., “The evolution of invasiveness in garden ants,” PLoS
One, vol. 3, no. 12. Public Library of Science, 2008.
ista: Cremer S, Ugelvig LV, Drijfhout F, Schlick Steiner B, Steiner F, Seifert B,
Hughes D, Schulz A, Petersen K, Konrad H, Stauffer C, Kiran K, Espadaler X, D’Ettorre
P, Aktaç N, Eilenberg J, Jones G, Nash D, Pedersen J, Boomsma J. 2008. The evolution
of invasiveness in garden ants. PLoS One. 3(12).
mla: Cremer, Sylvia, et al. “The Evolution of Invasiveness in Garden Ants.” PLoS
One, vol. 3, no. 12, Public Library of Science, 2008, doi:10.1371/journal.pone.0003838.
short: S. Cremer, L.V. Ugelvig, F. Drijfhout, B. Schlick Steiner, F. Steiner, B.
Seifert, D. Hughes, A. Schulz, K. Petersen, H. Konrad, C. Stauffer, K. Kiran,
X. Espadaler, P. D’Ettorre, N. Aktaç, J. Eilenberg, G. Jones, D. Nash, J. Pedersen,
J. Boomsma, PLoS One 3 (2008).
date_created: 2018-12-11T12:05:49Z
date_published: 2008-12-03T00:00:00Z
date_updated: 2021-01-12T07:53:06Z
day: '03'
doi: 10.1371/journal.pone.0003838
extern: '1'
intvolume: ' 3'
issue: '12'
language:
- iso: eng
month: '12'
oa_version: None
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '2247'
status: public
title: The evolution of invasiveness in garden ants
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2008'
...
---
_id: '3907'
abstract:
- lang: eng
text: 'Wingless males of the ant genus Cardiocondyla engage in fatal fighting for
access to female sexual nestmates. Older, heavily sclerotized males are usually
capable of eliminating all younger rivals, whose cuticle is still soft. In Cardiocondyla
sp. A, this type of local mate competition (LMC) has turned the standard pattern
of brood production of social insects upside down, in that mother queens in multi-queen
colonies produce extremely long-lived sons very early in the life cycle of the
colony. Here, we investigated the emergence pattern of sexuals in two species
with LMC, in which males are much less long-lived. Queens of Cardiocondyla obscurior
and Cardiocondyla minutior reared their first sons significantly earlier in multi-queen
than in single-queen societies. In addition, first female sexuals also emerged
earlier in multi-queen colonies, so that early males had mating opportunities.
Hence, the timing of sexual production appears to be well predicted by evolutionary
theory, in particular by local mate and queen–queen competition. '
author:
- first_name: Masaki
full_name: Suefuji, Masaki
last_name: Suefuji
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
- first_name: Jan
full_name: Oettler, Jan
last_name: Oettler
- first_name: Jürgen
full_name: Heinze, Jürgen
last_name: Heinze
citation:
ama: Suefuji M, Cremer S, Oettler J, Heinze J. Queen number influences the timing
of the sexual production in colonies of Cardiocondyla ants. Biology Letters.
2008;4(6):670-673. doi:10.1098/rsbl.2008.0355
apa: Suefuji, M., Cremer, S., Oettler, J., & Heinze, J. (2008). Queen number
influences the timing of the sexual production in colonies of Cardiocondyla ants.
Biology Letters. Royal Society, The. https://doi.org/10.1098/rsbl.2008.0355
chicago: Suefuji, Masaki, Sylvia Cremer, Jan Oettler, and Jürgen Heinze. “Queen
Number Influences the Timing of the Sexual Production in Colonies of Cardiocondyla
Ants.” Biology Letters. Royal Society, The, 2008. https://doi.org/10.1098/rsbl.2008.0355.
ieee: M. Suefuji, S. Cremer, J. Oettler, and J. Heinze, “Queen number influences
the timing of the sexual production in colonies of Cardiocondyla ants,” Biology
Letters, vol. 4, no. 6. Royal Society, The, pp. 670–673, 2008.
ista: Suefuji M, Cremer S, Oettler J, Heinze J. 2008. Queen number influences the
timing of the sexual production in colonies of Cardiocondyla ants. Biology Letters.
4(6), 670–673.
mla: Suefuji, Masaki, et al. “Queen Number Influences the Timing of the Sexual Production
in Colonies of Cardiocondyla Ants.” Biology Letters, vol. 4, no. 6, Royal
Society, The, 2008, pp. 670–73, doi:10.1098/rsbl.2008.0355.
short: M. Suefuji, S. Cremer, J. Oettler, J. Heinze, Biology Letters 4 (2008) 670–673.
date_created: 2018-12-11T12:05:49Z
date_published: 2008-12-23T00:00:00Z
date_updated: 2021-01-12T07:53:07Z
day: '23'
doi: 10.1098/rsbl.2008.0355
extern: '1'
intvolume: ' 4'
issue: '6'
language:
- iso: eng
month: '12'
oa_version: None
page: 670 - 673
publication: Biology Letters
publication_status: published
publisher: Royal Society, The
publist_id: '2248'
status: public
title: Queen number influences the timing of the sexual production in colonies of
Cardiocondyla ants
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2008'
...
---
_id: '3939'
abstract:
- lang: eng
text: The priming of a T cell results from its physical interaction with a dendritic
cell (DC) that presents the cognate antigenic peptide. The success rate of such
interactions is extremely low, because the precursor frequency of a naive T cell
recognizing a specific antigen is in the range of 1:10(5)-10(6). To make this
principle practicable, encounter frequencies between DCs and T cells are maximized
within lymph nodes (LNs) that are compact immunological projections of the peripheral
tissue they drain. But LNs are more than passive meeting places for DCs that immigrated
from the tissue and lymphocytes that recirculated via the blood. The microanatomy
of the LN stroma actively organizes the cellular encounters by providing preformed
migration tracks that create dynamic but highly ordered movement patterns. LN
architecture further acts as a sophisticated filtration system that sieves the
incoming interstitial fluid at different levels and guarantees that immunologically
relevant antigens are loaded on DCs or B cells while inert substances are channeled
back into the blood circulation. This review focuses on the non-hematopoietic
infrastructure of the lymph node. We describe the association between fibroblastic
reticular cell, conduit, DC, and T cell as the essential functional unit of the
T-cell cortex.
author:
- first_name: Tim
full_name: Lämmermann, Tim
last_name: Lämmermann
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
citation:
ama: Lämmermann T, Sixt MK. The microanatomy of T-cell responses. Immunological
Reviews. 2008;221(1):26-43. doi:10.1111/j.1600-065X.2008.00592.x
apa: Lämmermann, T., & Sixt, M. K. (2008). The microanatomy of T-cell responses.
Immunological Reviews. Wiley-Blackwell. https://doi.org/10.1111/j.1600-065X.2008.00592.x
chicago: Lämmermann, Tim, and Michael K Sixt. “The Microanatomy of T-Cell Responses.”
Immunological Reviews. Wiley-Blackwell, 2008. https://doi.org/10.1111/j.1600-065X.2008.00592.x.
ieee: T. Lämmermann and M. K. Sixt, “The microanatomy of T-cell responses,” Immunological
Reviews, vol. 221, no. 1. Wiley-Blackwell, pp. 26–43, 2008.
ista: Lämmermann T, Sixt MK. 2008. The microanatomy of T-cell responses. Immunological
Reviews. 221(1), 26–43.
mla: Lämmermann, Tim, and Michael K. Sixt. “The Microanatomy of T-Cell Responses.”
Immunological Reviews, vol. 221, no. 1, Wiley-Blackwell, 2008, pp. 26–43,
doi:10.1111/j.1600-065X.2008.00592.x.
short: T. Lämmermann, M.K. Sixt, Immunological Reviews 221 (2008) 26–43.
date_created: 2018-12-11T12:06:00Z
date_published: 2008-02-07T00:00:00Z
date_updated: 2021-01-12T07:53:20Z
day: '07'
doi: 10.1111/j.1600-065X.2008.00592.x
extern: '1'
intvolume: ' 221'
issue: '1'
language:
- iso: eng
month: '02'
oa_version: None
page: 26 - 43
publication: Immunological Reviews
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2187'
status: public
title: The microanatomy of T-cell responses
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 221
year: '2008'
...
---
_id: '3940'
abstract:
- lang: eng
text: Until recently little information was available on the molecular details of
the extracellular matrix (ECM) of secondary lymphoid tissues. There is now growing
evidence that these ECMs are unique structures, combining characteristics of basement
membranes and interstitial or fibrillar matrices, resulting in scaffolds that
are strong and highly flexible and, in certain secondary lymphoid compartments,
also forming conduit networks for rapid fluid transport. This review will address
the structural characteristics of the ECM of the murine spleen and its potential
role as an organizer of immune cell compartments, with reference to the lymph
node where relevant.
author:
- first_name: Zerina
full_name: Lokmic, Zerina
last_name: Lokmic
- first_name: Tim
full_name: Lämmermann, Tim
last_name: Lämmermann
- first_name: Michael K
full_name: Michael Sixt
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Susanna
full_name: Cardell, Susanna
last_name: Cardell
- first_name: Rupert
full_name: Hallmann, Rupert
last_name: Hallmann
- first_name: Lydia
full_name: Sorokin, Lydia
last_name: Sorokin
citation:
ama: Lokmic Z, Lämmermann T, Sixt MK, Cardell S, Hallmann R, Sorokin L. The extracellular
matrix of the spleen as a potential organizer of immune cell compartments. Seminars
in Immunology. 2008;20(1):4-13. doi:10.1016/j.smim.2007.12.009
apa: Lokmic, Z., Lämmermann, T., Sixt, M. K., Cardell, S., Hallmann, R., & Sorokin,
L. (2008). The extracellular matrix of the spleen as a potential organizer of
immune cell compartments. Seminars in Immunology. Academic Press. https://doi.org/10.1016/j.smim.2007.12.009
chicago: Lokmic, Zerina, Tim Lämmermann, Michael K Sixt, Susanna Cardell, Rupert
Hallmann, and Lydia Sorokin. “The Extracellular Matrix of the Spleen as a Potential
Organizer of Immune Cell Compartments.” Seminars in Immunology. Academic
Press, 2008. https://doi.org/10.1016/j.smim.2007.12.009.
ieee: Z. Lokmic, T. Lämmermann, M. K. Sixt, S. Cardell, R. Hallmann, and L. Sorokin,
“The extracellular matrix of the spleen as a potential organizer of immune cell
compartments,” Seminars in Immunology, vol. 20, no. 1. Academic Press,
pp. 4–13, 2008.
ista: Lokmic Z, Lämmermann T, Sixt MK, Cardell S, Hallmann R, Sorokin L. 2008. The
extracellular matrix of the spleen as a potential organizer of immune cell compartments.
Seminars in Immunology. 20(1), 4–13.
mla: Lokmic, Zerina, et al. “The Extracellular Matrix of the Spleen as a Potential
Organizer of Immune Cell Compartments.” Seminars in Immunology, vol. 20,
no. 1, Academic Press, 2008, pp. 4–13, doi:10.1016/j.smim.2007.12.009.
short: Z. Lokmic, T. Lämmermann, M.K. Sixt, S. Cardell, R. Hallmann, L. Sorokin,
Seminars in Immunology 20 (2008) 4–13.
date_created: 2018-12-11T12:06:00Z
date_published: 2008-02-01T00:00:00Z
date_updated: 2021-01-12T07:53:20Z
day: '01'
doi: 10.1016/j.smim.2007.12.009
extern: 1
intvolume: ' 20'
issue: '1'
month: '02'
page: 4 - 13
publication: Seminars in Immunology
publication_status: published
publisher: Academic Press
publist_id: '2188'
quality_controlled: 0
status: public
title: The extracellular matrix of the spleen as a potential organizer of immune cell
compartments
type: journal_article
volume: 20
year: '2008'
...
---
_id: '3941'
abstract:
- lang: eng
text: All metazoan cells carry transmembrane receptors of the integrin family, which
couple the contractile force of the actomyosin cytoskeleton to the extracellular
environment. In agreement with this principle, rapidly migrating leukocytes use
integrin-mediated adhesion when moving over two-dimensional surfaces. As migration
on two-dimensional substrates naturally overemphasizes the role of adhesion, the
contribution of integrins during three-dimensional movement of leukocytes within
tissues has remained controversial. We studied the interplay between adhesive,
contractile and protrusive forces during interstitial leukocyte chemotaxis in
vivo and in vitro. We ablated all integrin heterodimers from murine leukocytes,
and show here that functional integrins do not contribute to migration in three-dimensional
environments. Instead, these cells migrate by the sole force of actin-network
expansion, which promotes protrusive flowing of the leading edge. Myosin II-dependent
contraction is only required on passage through narrow gaps, where a squeezing
contraction of the trailing edge propels the rigid nucleus.
author:
- first_name: Tim
full_name: Lämmermann, Tim
last_name: Lämmermann
- first_name: Bernhard
full_name: Bader, Bernhard L
last_name: Bader
- first_name: Susan
full_name: Monkley, Susan J
last_name: Monkley
- first_name: Tim
full_name: Worbs, Tim
last_name: Worbs
- first_name: Roland
full_name: Wedlich-Söldner, Roland
last_name: Wedlich Söldner
- first_name: Karin
full_name: Hirsch, Karin
last_name: Hirsch
- first_name: Markus
full_name: Keller, Markus
last_name: Keller
- first_name: Reinhold
full_name: Förster, Reinhold
last_name: Förster
- first_name: David
full_name: Critchley, David R
last_name: Critchley
- first_name: Reinhard
full_name: Fässler, Reinhard
last_name: Fässler
- first_name: Michael K
full_name: Michael Sixt
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
citation:
ama: Lämmermann T, Bader B, Monkley S, et al. Rapid leukocyte migration by integrin-independent
flowing and squeezing. Nature. 2008;453(7191):51-55. doi:10.1038/nature06887
apa: Lämmermann, T., Bader, B., Monkley, S., Worbs, T., Wedlich Söldner, R., Hirsch,
K., … Sixt, M. K. (2008). Rapid leukocyte migration by integrin-independent flowing
and squeezing. Nature. Nature Publishing Group. https://doi.org/10.1038/nature06887
chicago: Lämmermann, Tim, Bernhard Bader, Susan Monkley, Tim Worbs, Roland Wedlich
Söldner, Karin Hirsch, Markus Keller, et al. “Rapid Leukocyte Migration by Integrin-Independent
Flowing and Squeezing.” Nature. Nature Publishing Group, 2008. https://doi.org/10.1038/nature06887.
ieee: T. Lämmermann et al., “Rapid leukocyte migration by integrin-independent
flowing and squeezing,” Nature, vol. 453, no. 7191. Nature Publishing Group,
pp. 51–55, 2008.
ista: Lämmermann T, Bader B, Monkley S, Worbs T, Wedlich Söldner R, Hirsch K, Keller
M, Förster R, Critchley D, Fässler R, Sixt MK. 2008. Rapid leukocyte migration
by integrin-independent flowing and squeezing. Nature. 453(7191), 51–55.
mla: Lämmermann, Tim, et al. “Rapid Leukocyte Migration by Integrin-Independent
Flowing and Squeezing.” Nature, vol. 453, no. 7191, Nature Publishing Group,
2008, pp. 51–55, doi:10.1038/nature06887.
short: T. Lämmermann, B. Bader, S. Monkley, T. Worbs, R. Wedlich Söldner, K. Hirsch,
M. Keller, R. Förster, D. Critchley, R. Fässler, M.K. Sixt, Nature 453 (2008)
51–55.
date_created: 2018-12-11T12:06:00Z
date_published: 2008-05-01T00:00:00Z
date_updated: 2021-01-12T07:53:21Z
day: '01'
doi: 10.1038/nature06887
extern: 1
intvolume: ' 453'
issue: '7191'
month: '05'
page: 51 - 55
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '2186'
quality_controlled: 0
status: public
title: Rapid leukocyte migration by integrin-independent flowing and squeezing
type: journal_article
volume: 453
year: '2008'
...
---
_id: '3942'
abstract:
- lang: eng
text: Recent in vitro studies have suggested a role for sialylation in chemokine
receptor binding to its ligand (Bannert, N., S. Craig, M. Farzan, D. Sogah, N.V.
Santo, H. Choe, and J. Sodroski. 2001. J. Exp. Med. 194:1661-1673). This prompted
us to investigate chemokine-induced leukocyte adhesion in inflamed cremaster muscle
venules of alpha2,3 sialyltransferase (ST3Gal-IV)-deficient mice. We found a marked
reduction in leukocyte adhesion to inflamed microvessels upon injection of the
CXCR2 ligands CXCL1 (keratinocyte-derived chemokine) or CXCL8 (interleukin 8).
In addition, extravasation of ST3Gal-IV(-/-) neutrophils into thioglycollate-pretreated
peritoneal cavities was significantly decreased. In vitro assays revealed that
CXCL8 binding to isolated ST3Gal-IV(-/-) neutrophils was markedly impaired. Furthermore,
CXCL1-mediated adhesion of ST3Gal-IV(-/-) leukocytes at physiological flow conditions,
as well as transendothelial migration of ST3Gal-IV(-/-) leukocytes in response
to CXCL1, was significantly reduced. In human neutrophils, enzymatic desialylation
decreased binding of CXCR2 ligands to the neutrophil surface and diminished neutrophil
degranulation in response to these chemokines. In addition, binding of alpha2,3-linked
sialic acid-specific Maackia amurensis lectin II to purified CXCR2 from neuraminidase-treated
CXCR2-transfected HEK293 cells was markedly impaired. Collectively, we provide
substantial evidence that sialylation by ST3Gal-IV significantly contributes to
CXCR2-mediated leukocyte adhesion during inflammation in vivo.
author:
- first_name: David
full_name: Frommhold, David
last_name: Frommhold
- first_name: Andreas
full_name: Ludwig, Andreas
last_name: Ludwig
- first_name: M Gabriele
full_name: Bixel, M Gabriele
last_name: Bixel
- first_name: Alexander
full_name: Zarbock, Alexander
last_name: Zarbock
- first_name: Inna
full_name: Babushkina, Inna
last_name: Babushkina
- first_name: Melitta
full_name: Weissinger, Melitta
last_name: Weissinger
- first_name: Sandra
full_name: Cauwenberghs, Sandra
last_name: Cauwenberghs
- first_name: Lesley
full_name: Ellies, Lesley G
last_name: Ellies
- first_name: Jamey
full_name: Marth, Jamey D
last_name: Marth
- first_name: Annette
full_name: Beck-Sickinger, Annette G
last_name: Beck Sickinger
- first_name: Michael K
full_name: Michael Sixt
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Bärbel
full_name: Lange-Sperandio, Bärbel
last_name: Lange Sperandio
- first_name: Alma
full_name: Zernecke, Alma
last_name: Zernecke
- first_name: Ernst
full_name: Brandt, Ernst
last_name: Brandt
- first_name: Christian
full_name: Weber, Christian
last_name: Weber
- first_name: Dietmar
full_name: Vestweber, Dietmar
last_name: Vestweber
- first_name: Klaus
full_name: Ley, Klaus
last_name: Ley
- first_name: Markus
full_name: Sperandio, Markus
last_name: Sperandio
citation:
ama: Frommhold D, Ludwig A, Bixel MG, et al. Sialyltransferase ST3Gal-IV controls
CXCR2-mediated firm leukocyte arrest during inflammation. The Journal of Experimental
Medicine. 2008;205(6):1435-1446. doi:10.1084/jem.20070846
apa: Frommhold, D., Ludwig, A., Bixel, M. G., Zarbock, A., Babushkina, I., Weissinger,
M., … Sperandio, M. (2008). Sialyltransferase ST3Gal-IV controls CXCR2-mediated
firm leukocyte arrest during inflammation. The Journal of Experimental Medicine.
Rockefeller University Press. https://doi.org/10.1084/jem.20070846
chicago: Frommhold, David, Andreas Ludwig, M Gabriele Bixel, Alexander Zarbock,
Inna Babushkina, Melitta Weissinger, Sandra Cauwenberghs, et al. “Sialyltransferase
ST3Gal-IV Controls CXCR2-Mediated Firm Leukocyte Arrest during Inflammation.”
The Journal of Experimental Medicine. Rockefeller University Press, 2008.
https://doi.org/10.1084/jem.20070846.
ieee: D. Frommhold et al., “Sialyltransferase ST3Gal-IV controls CXCR2-mediated
firm leukocyte arrest during inflammation,” The Journal of Experimental Medicine,
vol. 205, no. 6. Rockefeller University Press, pp. 1435–1446, 2008.
ista: Frommhold D, Ludwig A, Bixel MG, Zarbock A, Babushkina I, Weissinger M, Cauwenberghs
S, Ellies L, Marth J, Beck Sickinger A, Sixt MK, Lange Sperandio B, Zernecke A,
Brandt E, Weber C, Vestweber D, Ley K, Sperandio M. 2008. Sialyltransferase ST3Gal-IV
controls CXCR2-mediated firm leukocyte arrest during inflammation. The Journal
of Experimental Medicine. 205(6), 1435–1446.
mla: Frommhold, David, et al. “Sialyltransferase ST3Gal-IV Controls CXCR2-Mediated
Firm Leukocyte Arrest during Inflammation.” The Journal of Experimental Medicine,
vol. 205, no. 6, Rockefeller University Press, 2008, pp. 1435–46, doi:10.1084/jem.20070846.
short: D. Frommhold, A. Ludwig, M.G. Bixel, A. Zarbock, I. Babushkina, M. Weissinger,
S. Cauwenberghs, L. Ellies, J. Marth, A. Beck Sickinger, M.K. Sixt, B. Lange Sperandio,
A. Zernecke, E. Brandt, C. Weber, D. Vestweber, K. Ley, M. Sperandio, The Journal
of Experimental Medicine 205 (2008) 1435–1446.
date_created: 2018-12-11T12:06:01Z
date_published: 2008-06-02T00:00:00Z
date_updated: 2021-01-12T07:53:21Z
day: '02'
doi: 10.1084/jem.20070846
extern: 1
intvolume: ' 205'
issue: '6'
month: '06'
page: 1435 - 1446
publication: The Journal of Experimental Medicine
publication_status: published
publisher: Rockefeller University Press
publist_id: '2185'
quality_controlled: 0
status: public
title: Sialyltransferase ST3Gal-IV controls CXCR2-mediated firm leukocyte arrest during
inflammation
type: journal_article
volume: 205
year: '2008'
...
---
_id: '3943'
abstract:
- lang: eng
text: Neutrophil granulocytes form the body's first line of antibacterial defense,
but they also contribute to tissue injury and noninfectious, chronic inflammation.
Proteinase 3 (PR3) and neutrophil elastase (NE) are 2 abundant neutrophil serine
proteases implicated in antimicrobial defense with overlapping and potentially
redundant substrate specificity. Here, we unraveled a cooperative role for PR3
and NE in neutrophil activation and noninfectious inflammation in vivo, which
we believe to be novel. Mice lacking both PR3 and NE demonstrated strongly diminished
immune complex-mediated (IC-mediated) neutrophil infiltration in vivo as well
as reduced activation of isolated neutrophils by ICs in vitro. In contrast, in
mice lacking just NE, neutrophil recruitment to ICs was only marginally impaired.
The defects in mice lacking both PR3 and NE were directly linked to the accumulation
of antiinflammatory progranulin (PGRN). Both PR3 and NE cleaved PGRN in vitro
and during neutrophil activation and inflammation in vivo. Local administration
of recombinant PGRN potently inhibited neutrophilic inflammation in vivo, demonstrating
that PGRN represents a crucial inflammation-suppressing mediator. We conclude
that PR3 and NE enhance neutrophil-dependent inflammation by eliminating the local
antiinflammatory activity of PGRN. Our results support the use of serine protease
inhibitors as antiinflammatory agents.
author:
- first_name: Kai
full_name: Kessenbrock, Kai
last_name: Kessenbrock
- first_name: Leopold
full_name: Fröhlich, Leopold
last_name: Fröhlich
- first_name: Michael K
full_name: Michael Sixt
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Tim
full_name: Lämmermann, Tim
last_name: Lämmermann
- first_name: Heiko
full_name: Pfister, Heiko
last_name: Pfister
- first_name: Andrew
full_name: Bateman, Andrew
last_name: Bateman
- first_name: Azzaq
full_name: Belaaouaj, Azzaq
last_name: Belaaouaj
- first_name: Johannes
full_name: Ring, Johannes
last_name: Ring
- first_name: Markus
full_name: Ollert, Markus
last_name: Ollert
- first_name: Reinhard
full_name: Fässler, Reinhard
last_name: Fässler
- first_name: Dieter
full_name: Jenne, Dieter E
last_name: Jenne
citation:
ama: Kessenbrock K, Fröhlich L, Sixt MK, et al. Proteinase 3 and neutrophil elastase
enhance inflammation in mice by inactivating antiinflammatory progranulin. The
Journal of Clinical Investigation. 2008;118(7):2438-2447. doi:10.1172/JCI34694
apa: Kessenbrock, K., Fröhlich, L., Sixt, M. K., Lämmermann, T., Pfister, H., Bateman,
A., … Jenne, D. (2008). Proteinase 3 and neutrophil elastase enhance inflammation
in mice by inactivating antiinflammatory progranulin. The Journal of Clinical
Investigation. American Society for Clinical Investigation. https://doi.org/10.1172/JCI34694
chicago: Kessenbrock, Kai, Leopold Fröhlich, Michael K Sixt, Tim Lämmermann, Heiko
Pfister, Andrew Bateman, Azzaq Belaaouaj, et al. “Proteinase 3 and Neutrophil
Elastase Enhance Inflammation in Mice by Inactivating Antiinflammatory Progranulin.”
The Journal of Clinical Investigation. American Society for Clinical Investigation,
2008. https://doi.org/10.1172/JCI34694.
ieee: K. Kessenbrock et al., “Proteinase 3 and neutrophil elastase enhance
inflammation in mice by inactivating antiinflammatory progranulin,” The Journal
of Clinical Investigation, vol. 118, no. 7. American Society for Clinical
Investigation, pp. 2438–2447, 2008.
ista: Kessenbrock K, Fröhlich L, Sixt MK, Lämmermann T, Pfister H, Bateman A, Belaaouaj
A, Ring J, Ollert M, Fässler R, Jenne D. 2008. Proteinase 3 and neutrophil elastase
enhance inflammation in mice by inactivating antiinflammatory progranulin. The
Journal of Clinical Investigation. 118(7), 2438–2447.
mla: Kessenbrock, Kai, et al. “Proteinase 3 and Neutrophil Elastase Enhance Inflammation
in Mice by Inactivating Antiinflammatory Progranulin.” The Journal of Clinical
Investigation, vol. 118, no. 7, American Society for Clinical Investigation,
2008, pp. 2438–47, doi:10.1172/JCI34694.
short: K. Kessenbrock, L. Fröhlich, M.K. Sixt, T. Lämmermann, H. Pfister, A. Bateman,
A. Belaaouaj, J. Ring, M. Ollert, R. Fässler, D. Jenne, The Journal of Clinical
Investigation 118 (2008) 2438–2447.
date_created: 2018-12-11T12:06:01Z
date_published: 2008-07-01T00:00:00Z
date_updated: 2021-01-12T07:53:22Z
day: '01'
doi: 10.1172/JCI34694
extern: 1
intvolume: ' 118'
issue: '7'
month: '07'
page: 2438 - 2447
publication: The Journal of Clinical Investigation
publication_status: published
publisher: American Society for Clinical Investigation
publist_id: '2183'
quality_controlled: 0
status: public
title: Proteinase 3 and neutrophil elastase enhance inflammation in mice by inactivating
antiinflammatory progranulin
type: journal_article
volume: 118
year: '2008'
...
---
_id: '3944'
abstract:
- lang: eng
text: Live imaging of the actin cytoskeleton is crucial for the study of many fundamental
biological processes, but current approaches to visualize actin have several limitations.
Here we describe Lifeact, a 17-amino-acid peptide, which stained filamentous actin
(F-actin) structures in eukaryotic cells and tissues. Lifeact did not interfere
with actin dynamics in vitro and in vivo and in its chemically modified peptide
form allowed visualization of actin dynamics in nontransfectable cells.
author:
- first_name: Julia
full_name: Riedl, Julia
last_name: Riedl
- first_name: Alvaro
full_name: Crevenna, Alvaro H
last_name: Crevenna
- first_name: Kai
full_name: Kessenbrock, Kai
last_name: Kessenbrock
- first_name: Jerry
full_name: Yu, Jerry Haochen
last_name: Yu
- first_name: Dorothee
full_name: Neukirchen, Dorothee
last_name: Neukirchen
- first_name: Michal
full_name: Bista, Michal
last_name: Bista
- first_name: Frank
full_name: Bradke, Frank
last_name: Bradke
- first_name: Dieter
full_name: Jenne, Dieter
last_name: Jenne
- first_name: Tad
full_name: Holak, Tad A
last_name: Holak
- first_name: Zena
full_name: Werb, Zena
last_name: Werb
- first_name: Michael K
full_name: Michael Sixt
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Roland
full_name: Wedlich-Soldner, Roland
last_name: Wedlich Soldner
citation:
ama: 'Riedl J, Crevenna A, Kessenbrock K, et al. Lifeact: a versatile marker to
visualize F-actin. Nature Methods. 2008;5(7):605-607. doi:10.1038/nmeth.1220'
apa: 'Riedl, J., Crevenna, A., Kessenbrock, K., Yu, J., Neukirchen, D., Bista, M.,
… Wedlich Soldner, R. (2008). Lifeact: a versatile marker to visualize F-actin.
Nature Methods. Nature Publishing Group. https://doi.org/10.1038/nmeth.1220'
chicago: 'Riedl, Julia, Alvaro Crevenna, Kai Kessenbrock, Jerry Yu, Dorothee Neukirchen,
Michal Bista, Frank Bradke, et al. “Lifeact: A Versatile Marker to Visualize F-Actin.”
Nature Methods. Nature Publishing Group, 2008. https://doi.org/10.1038/nmeth.1220.'
ieee: 'J. Riedl et al., “Lifeact: a versatile marker to visualize F-actin,”
Nature Methods, vol. 5, no. 7. Nature Publishing Group, pp. 605–607, 2008.'
ista: 'Riedl J, Crevenna A, Kessenbrock K, Yu J, Neukirchen D, Bista M, Bradke F,
Jenne D, Holak T, Werb Z, Sixt MK, Wedlich Soldner R. 2008. Lifeact: a versatile
marker to visualize F-actin. Nature Methods. 5(7), 605–607.'
mla: 'Riedl, Julia, et al. “Lifeact: A Versatile Marker to Visualize F-Actin.” Nature
Methods, vol. 5, no. 7, Nature Publishing Group, 2008, pp. 605–07, doi:10.1038/nmeth.1220.'
short: J. Riedl, A. Crevenna, K. Kessenbrock, J. Yu, D. Neukirchen, M. Bista, F.
Bradke, D. Jenne, T. Holak, Z. Werb, M.K. Sixt, R. Wedlich Soldner, Nature Methods
5 (2008) 605–607.
date_created: 2018-12-11T12:06:02Z
date_published: 2008-06-08T00:00:00Z
date_updated: 2021-01-12T07:53:22Z
day: '08'
doi: 10.1038/nmeth.1220
extern: 1
intvolume: ' 5'
issue: '7'
month: '06'
page: 605 - 607
publication: Nature Methods
publication_status: published
publisher: Nature Publishing Group
publist_id: '2184'
quality_controlled: 0
status: public
title: 'Lifeact: a versatile marker to visualize F-actin'
type: journal_article
volume: 5
year: '2008'
...