[{"year":"2008","publist_id":"2384","page":"15581 - 6","author":[{"full_name":"Kerr, Angharad M","last_name":"Kerr","first_name":"Angharad"},{"full_name":"Reisinger, Ellen","first_name":"Ellen","last_name":"Reisinger"},{"full_name":"Peter Jonas","orcid":"0000-0001-5001-4804","last_name":"Jonas","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"title":"Differential dependence of phasic transmitter release on synaptotagmin 1 at GABAergic and glutamatergic hippocampal synapses","issue":"40","date_updated":"2021-01-12T07:52:29Z","publisher":"National Academy of Sciences","date_published":"2008-01-01T00:00:00Z","intvolume":"       105","month":"01","publication":"PNAS","publication_status":"published","doi":"10.1073/pnas.0800621105","quality_controlled":0,"status":"public","day":"01","date_created":"2018-12-11T12:05:23Z","_id":"3827","abstract":[{"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.","lang":"eng"}],"type":"journal_article","volume":105,"extern":1,"citation":{"short":"A. Kerr, E. Reisinger, P.M. Jonas, PNAS 105 (2008) 15581–6.","ieee":"A. Kerr, E. Reisinger, and P. M. Jonas, “Differential dependence of phasic transmitter release on synaptotagmin 1 at GABAergic and glutamatergic hippocampal synapses,” <i>PNAS</i>, 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.","ama":"Kerr A, Reisinger E, Jonas PM. Differential dependence of phasic transmitter release on synaptotagmin 1 at GABAergic and glutamatergic hippocampal synapses. <i>PNAS</i>. 2008;105(40):15581-15586. doi:<a href=\"https://doi.org/10.1073/pnas.0800621105\">10.1073/pnas.0800621105</a>","chicago":"Kerr, Angharad, Ellen Reisinger, and Peter M Jonas. “Differential Dependence of Phasic Transmitter Release on Synaptotagmin 1 at GABAergic and Glutamatergic Hippocampal Synapses.” <i>PNAS</i>. National Academy of Sciences, 2008. <a href=\"https://doi.org/10.1073/pnas.0800621105\">https://doi.org/10.1073/pnas.0800621105</a>.","apa":"Kerr, A., Reisinger, E., &#38; Jonas, P. M. (2008). Differential dependence of phasic transmitter release on synaptotagmin 1 at GABAergic and glutamatergic hippocampal synapses. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.0800621105\">https://doi.org/10.1073/pnas.0800621105</a>","mla":"Kerr, Angharad, et al. “Differential Dependence of Phasic Transmitter Release on Synaptotagmin 1 at GABAergic and Glutamatergic Hippocampal Synapses.” <i>PNAS</i>, vol. 105, no. 40, National Academy of Sciences, 2008, pp. 15581–86, doi:<a href=\"https://doi.org/10.1073/pnas.0800621105\">10.1073/pnas.0800621105</a>."}},{"publication_status":"published","doi":"10.1007/978-3-540-69850-0_7","publication":"25 Years in Model Checking","date_created":"2018-12-11T12:05:38Z","_id":"3872","quality_controlled":0,"day":"01","status":"public","citation":{"chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “Value Iteration.” In <i>25 Years in Model Checking</i>, 5000:107–38. Springer, 2008. <a href=\"https://doi.org/10.1007/978-3-540-69850-0_7\">https://doi.org/10.1007/978-3-540-69850-0_7</a>.","ama":"Chatterjee K, Henzinger TA. Value iteration. In: <i>25 Years in Model Checking</i>. Vol 5000. Springer; 2008:107-138. doi:<a href=\"https://doi.org/10.1007/978-3-540-69850-0_7\">10.1007/978-3-540-69850-0_7</a>","ieee":"K. Chatterjee and T. A. Henzinger, “Value iteration,” in <i>25 Years in Model Checking</i>, vol. 5000, Springer, 2008, pp. 107–138.","short":"K. Chatterjee, T.A. Henzinger, in:, 25 Years in Model Checking, 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.” <i>25 Years in Model Checking</i>, vol. 5000, Springer, 2008, pp. 107–38, doi:<a href=\"https://doi.org/10.1007/978-3-540-69850-0_7\">10.1007/978-3-540-69850-0_7</a>.","apa":"Chatterjee, K., &#38; Henzinger, T. A. (2008). Value iteration. In <i>25 Years in Model Checking</i> (Vol. 5000, pp. 107–138). Springer. <a href=\"https://doi.org/10.1007/978-3-540-69850-0_7\">https://doi.org/10.1007/978-3-540-69850-0_7</a>"},"extern":1,"volume":5000,"type":"book_chapter","abstract":[{"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.","lang":"eng"}],"year":"2008","page":"107 - 138","publist_id":"2299","date_updated":"2021-01-12T07:52:51Z","title":"Value iteration","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Krishnendu Chatterjee"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger"}],"month":"01","intvolume":"      5000","alternative_title":["LNCS"],"date_published":"2008-01-01T00:00:00Z","publisher":"Springer","acknowledgement":"This research was supported in part by the Swiss National Science Foundation and by the NSF grants CCR-0225610 and CCR-0234690."},{"publist_id":"2296","conference":{"name":"HSCC: Hybrid Systems - Computation and Control"},"page":"72 - 86","year":"2008","publisher":"Springer","date_published":"2008-04-03T00:00:00Z","alternative_title":["LNCS"],"month":"04","intvolume":"      4981","title":"Controller synthesis with budget constraints","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Krishnendu Chatterjee"},{"full_name":"Majumdar, Ritankar S","last_name":"Majumdar","first_name":"Ritankar"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Thomas Henzinger"}],"date_updated":"2021-01-12T07:52:51Z","doi":"DOI: 10.1007/978-3-540-78929-1_6","publication_status":"published","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."}],"type":"conference","volume":4981,"extern":1,"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Controller Synthesis with Budget Constraints</i>. Vol. 4981, Springer, 2008, pp. 72–86, doi:<a href=\"https://doi.org/DOI: 10.1007/978-3-540-78929-1_6\">DOI: 10.1007/978-3-540-78929-1_6</a>.","apa":"Chatterjee, K., Majumdar, R., &#38; Henzinger, T. A. (2008). Controller synthesis with budget constraints (Vol. 4981, pp. 72–86). Presented at the HSCC: Hybrid Systems - Computation and Control, Springer. <a href=\"https://doi.org/DOI: 10.1007/978-3-540-78929-1_6\">https://doi.org/DOI: 10.1007/978-3-540-78929-1_6</a>","chicago":"Chatterjee, Krishnendu, Ritankar Majumdar, and Thomas A Henzinger. “Controller Synthesis with Budget Constraints,” 4981:72–86. Springer, 2008. <a href=\"https://doi.org/DOI: 10.1007/978-3-540-78929-1_6\">https://doi.org/DOI: 10.1007/978-3-540-78929-1_6</a>.","ista":"Chatterjee K, Majumdar R, Henzinger TA. 2008. Controller synthesis with budget constraints. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 4981, 72–86.","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.","short":"K. Chatterjee, R. Majumdar, T.A. Henzinger, in:, Springer, 2008, pp. 72–86.","ama":"Chatterjee K, Majumdar R, Henzinger TA. Controller synthesis with budget constraints. In: Vol 4981. Springer; 2008:72-86. doi:<a href=\"https://doi.org/DOI: 10.1007/978-3-540-78929-1_6\">DOI: 10.1007/978-3-540-78929-1_6</a>"},"status":"public","quality_controlled":0,"day":"03","_id":"3873","date_created":"2018-12-11T12:05:38Z"},{"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.","publisher":"Springer","intvolume":"      4981","month":"04","date_published":"2008-04-03T00:00:00Z","alternative_title":["LNCS"],"author":[{"full_name":"Krishnendu Chatterjee","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Vinayak","last_name":"Prabhu","full_name":"Prabhu, Vinayak S"}],"title":"Trading infinite memory for uniform randomness in timed games","date_updated":"2021-01-12T07:52:51Z","conference":{"name":"HSCC: Hybrid Systems - Computation and Control"},"publist_id":"2297","page":"87 - 100","year":"2008","type":"conference","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."}],"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Trading Infinite Memory for Uniform Randomness in Timed Games</i>. Vol. 4981, Springer, 2008, pp. 87–100, doi:<a href=\"https://doi.org/10.1007/978-3-540-78929-1_7\">10.1007/978-3-540-78929-1_7</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; 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. <a href=\"https://doi.org/10.1007/978-3-540-78929-1_7\">https://doi.org/10.1007/978-3-540-78929-1_7</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Trading Infinite Memory for Uniform Randomness in Timed Games,” 4981:87–100. Springer, 2008. <a href=\"https://doi.org/10.1007/978-3-540-78929-1_7\">https://doi.org/10.1007/978-3-540-78929-1_7</a>.","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.","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Springer, 2008, 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.","ama":"Chatterjee K, Henzinger TA, Prabhu V. Trading infinite memory for uniform randomness in timed games. In: Vol 4981. Springer; 2008:87-100. doi:<a href=\"https://doi.org/10.1007/978-3-540-78929-1_7\">10.1007/978-3-540-78929-1_7</a>"},"extern":1,"volume":4981,"day":"03","quality_controlled":0,"status":"public","_id":"3874","date_created":"2018-12-11T12:05:38Z","doi":"10.1007/978-3-540-78929-1_7","publication_status":"published"},{"publist_id":"2298","conference":{"name":"FoSSaCS: Foundations of Software Science and Computation Structures"},"page":"302 - 317","year":"2008","publisher":"Springer","intvolume":"      4962","month":"03","alternative_title":["LNCS"],"date_published":"2008-03-01T00:00:00Z","title":"Model-checking omega-regular properties of interval Markov chains","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Krishnendu Chatterjee"},{"full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sen","first_name":"Koushik","full_name":"Sen, Koushik"}],"date_updated":"2021-01-12T07:52:52Z","publication_status":"published","doi":"10.1007/978-3-540-78499-9_22","type":"conference","abstract":[{"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.","lang":"eng"}],"extern":1,"citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Koushik Sen. “Model-Checking Omega-Regular Properties of Interval Markov Chains,” 4962:302–17. Springer, 2008. <a href=\"https://doi.org/10.1007/978-3-540-78499-9_22\">https://doi.org/10.1007/978-3-540-78499-9_22</a>.","ama":"Chatterjee K, Henzinger TA, Sen K. Model-checking omega-regular properties of interval Markov chains. In: Vol 4962. Springer; 2008:302-317. doi:<a href=\"https://doi.org/10.1007/978-3-540-78499-9_22\">10.1007/978-3-540-78499-9_22</a>","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.","short":"K. Chatterjee, T.A. Henzinger, K. Sen, in:, Springer, 2008, pp. 302–317.","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.","mla":"Chatterjee, Krishnendu, et al. <i>Model-Checking Omega-Regular Properties of Interval Markov Chains</i>. Vol. 4962, Springer, 2008, pp. 302–17, doi:<a href=\"https://doi.org/10.1007/978-3-540-78499-9_22\">10.1007/978-3-540-78499-9_22</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; 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. <a href=\"https://doi.org/10.1007/978-3-540-78499-9_22\">https://doi.org/10.1007/978-3-540-78499-9_22</a>"},"volume":4962,"day":"01","quality_controlled":0,"status":"public","_id":"3875","date_created":"2018-12-11T12:05:39Z"},{"date_published":"2008-10-01T00:00:00Z","alternative_title":["LNCS"],"month":"10","intvolume":"      5215","publisher":"Springer","acknowledgement":"This research was supported in part by the NSF grants CCR-0132780, CNS-0720884, and CCR-0225610, and by the European COMBEST project.","date_updated":"2023-02-23T11:21:54Z","title":"Timed parity games: complexity and robustness","author":[{"full_name":"Krishnendu Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Thomas Henzinger"},{"full_name":"Prabhu, Vinayak S","last_name":"Prabhu","first_name":"Vinayak"}],"page":"124 - 140","publist_id":"2294","conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"year":"2008","volume":5215,"extern":1,"citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness,” 5215:124–40. Springer, 2008. <a href=\"https://doi.org/10.1007/978-3-540-85778-5_10\">https://doi.org/10.1007/978-3-540-85778-5_10</a>.","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.","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Springer, 2008, 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.","ama":"Chatterjee K, Henzinger TA, Prabhu V. Timed parity games: complexity and robustness. In: Vol 5215. Springer; 2008:124-140. doi:<a href=\"https://doi.org/10.1007/978-3-540-85778-5_10\">10.1007/978-3-540-85778-5_10</a>","mla":"Chatterjee, Krishnendu, et al. <i>Timed Parity Games: Complexity and Robustness</i>. Vol. 5215, Springer, 2008, pp. 124–40, doi:<a href=\"https://doi.org/10.1007/978-3-540-85778-5_10\">10.1007/978-3-540-85778-5_10</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; 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. <a href=\"https://doi.org/10.1007/978-3-540-85778-5_10\">https://doi.org/10.1007/978-3-540-85778-5_10</a>"},"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."}],"type":"conference","date_created":"2018-12-11T12:05:39Z","_id":"3876","day":"01","status":"public","quality_controlled":0,"publication_status":"published","doi":"10.1007/978-3-540-85778-5_10","related_material":{"record":[{"status":"public","relation":"later_version","id":"3315"}]}},{"doi":"10.1007/978-3-540-85361-9_14","publication_status":"published","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 -&gt; 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."}],"type":"conference","volume":5201,"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Environment Assumptions for Synthesis</i>. Vol. 5201, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 147–61, doi:<a href=\"https://doi.org/10.1007/978-3-540-85361-9_14\">10.1007/978-3-540-85361-9_14</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; 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. <a href=\"https://doi.org/10.1007/978-3-540-85361-9_14\">https://doi.org/10.1007/978-3-540-85361-9_14</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Barbara Jobstmann. “Environment Assumptions for Synthesis,” 5201:147–61. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008. <a href=\"https://doi.org/10.1007/978-3-540-85361-9_14\">https://doi.org/10.1007/978-3-540-85361-9_14</a>.","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.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 147–161.","ista":"Chatterjee K, Henzinger TA, Jobstmann B. 2008. Environment assumptions for synthesis. CONCUR: Concurrency Theory, LNCS, vol. 5201, 147–161.","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:<a href=\"https://doi.org/10.1007/978-3-540-85361-9_14\">10.1007/978-3-540-85361-9_14</a>"},"extern":1,"status":"public","quality_controlled":0,"day":"30","date_created":"2018-12-11T12:05:39Z","_id":"3877","publist_id":"2295","conference":{"name":"CONCUR: Concurrency Theory"},"page":"147 - 161","year":"2008","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","alternative_title":["LNCS"],"date_published":"2008-07-30T00:00:00Z","month":"07","intvolume":"      5201","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Krishnendu Chatterjee"},{"full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"}],"title":"Environment assumptions for synthesis","date_updated":"2021-01-12T07:52:53Z"},{"type":"conference","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."}],"citation":{"chicago":"Chatterjee, Krishnendu, Luca De Alfaro, and Ritankar Majumdar. “The Complexity of Coverage,” 5356:91–106. Springer, 2008. <a href=\"https://doi.org/10.1007/978-3-540-89330-1_7\">https://doi.org/10.1007/978-3-540-89330-1_7</a>.","short":"K. Chatterjee, L. De Alfaro, R. Majumdar, in:, Springer, 2008, pp. 91–106.","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.","ama":"Chatterjee K, De Alfaro L, Majumdar R. The complexity of coverage. In: Vol 5356. Springer; 2008:91-106. doi:<a href=\"https://doi.org/10.1007/978-3-540-89330-1_7\">10.1007/978-3-540-89330-1_7</a>","mla":"Chatterjee, Krishnendu, et al. <i>The Complexity of Coverage</i>. Vol. 5356, Springer, 2008, pp. 91–106, doi:<a href=\"https://doi.org/10.1007/978-3-540-89330-1_7\">10.1007/978-3-540-89330-1_7</a>.","apa":"Chatterjee, K., De Alfaro, L., &#38; Majumdar, R. (2008). The complexity of coverage (Vol. 5356, pp. 91–106). Presented at the APLAS: Asian Symposium on Programming Languages and Systems, Springer. <a href=\"https://doi.org/10.1007/978-3-540-89330-1_7\">https://doi.org/10.1007/978-3-540-89330-1_7</a>"},"extern":1,"volume":5356,"day":"03","quality_controlled":0,"status":"public","_id":"3878","date_created":"2018-12-11T12:05:40Z","main_file_link":[{"url":"http://arxiv.org/abs/0804.4525","open_access":"1"}],"doi":"10.1007/978-3-540-89330-1_7","publication_status":"published","publisher":"Springer","acknowledgement":"This research was supported in part by the NSF grants CCR-0132780 and CNS-0720884.","month":"12","intvolume":"      5356","date_published":"2008-12-03T00:00:00Z","alternative_title":["LNCS"],"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Krishnendu Chatterjee"},{"last_name":"De Alfaro","first_name":"Luca","full_name":"de Alfaro, Luca"},{"full_name":"Majumdar, Ritankar S","first_name":"Ritankar","last_name":"Majumdar"}],"title":"The complexity of coverage","oa":1,"date_updated":"2021-01-12T07:52:53Z","conference":{"name":"APLAS: Asian Symposium on Programming Languages and Systems"},"publist_id":"2292","page":"91 - 106","year":"2008"},{"date_created":"2018-12-11T12:05:40Z","_id":"3879","status":"public","day":"10","quality_controlled":0,"citation":{"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.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2008, pp. 385–400.","ama":"Chatterjee K, Doyen L, Henzinger TA. Quantitative languages. In: Vol 5213. Springer; 2008:385-400. doi:<a href=\"https://doi.org/10.1007/978-3-540-87531-4_28\">10.1007/978-3-540-87531-4_28</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Quantitative Languages,” 5213:385–400. Springer, 2008. <a href=\"https://doi.org/10.1007/978-3-540-87531-4_28\">https://doi.org/10.1007/978-3-540-87531-4_28</a>.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2008). Quantitative languages (Vol. 5213, pp. 385–400). Presented at the CSL: Computer Science Logic, Springer. <a href=\"https://doi.org/10.1007/978-3-540-87531-4_28\">https://doi.org/10.1007/978-3-540-87531-4_28</a>","mla":"Chatterjee, Krishnendu, et al. <i>Quantitative Languages</i>. Vol. 5213, Springer, 2008, pp. 385–400, doi:<a href=\"https://doi.org/10.1007/978-3-540-87531-4_28\">10.1007/978-3-540-87531-4_28</a>."},"extern":1,"volume":5213,"type":"conference","abstract":[{"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.","lang":"eng"}],"publication_status":"published","doi":"10.1007/978-3-540-87531-4_28","date_updated":"2021-01-12T07:52:54Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Krishnendu Chatterjee"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"full_name":"Thomas Henzinger","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"title":"Quantitative languages","month":"09","intvolume":"      5213","date_published":"2008-09-10T00:00:00Z","alternative_title":["LNCS"],"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.","publisher":"Springer","year":"2008","page":"385 - 400","conference":{"name":"CSL: Computer Science Logic"},"publist_id":"2293"},{"date_updated":"2023-02-23T11:46:01Z","title":"Strategy construction for parity games with imperfect information","author":[{"first_name":"Dietmar","last_name":"Berwanger","full_name":"Berwanger, Dietmar"},{"full_name":"Krishnendu Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Thomas Henzinger"},{"full_name":"Raje, Sangram","last_name":"Raje","first_name":"Sangram"}],"month":"07","intvolume":"      5201","alternative_title":["LNCS"],"date_published":"2008-07-30T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2008","page":"325 - 339","publist_id":"2291","conference":{"name":"CONCUR: Concurrency Theory"},"_id":"3880","date_created":"2018-12-11T12:05:40Z","day":"30","quality_controlled":0,"status":"public","extern":1,"citation":{"mla":"Berwanger, Dietmar, et al. <i>Strategy Construction for Parity Games with Imperfect Information</i>. Vol. 5201, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, pp. 325–39, doi:<a href=\"https://doi.org/10.1007/978-3-540-85361-9\">10.1007/978-3-540-85361-9</a>.","apa":"Berwanger, D., Chatterjee, K., Doyen, L., Henzinger, T. A., &#38; 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. <a href=\"https://doi.org/10.1007/978-3-540-85361-9\">https://doi.org/10.1007/978-3-540-85361-9</a>","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. <a href=\"https://doi.org/10.1007/978-3-540-85361-9\">https://doi.org/10.1007/978-3-540-85361-9</a>.","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.","short":"D. Berwanger, K. Chatterjee, L. Doyen, T.A. Henzinger, S. Raje, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008, 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.","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:<a href=\"https://doi.org/10.1007/978-3-540-85361-9\">10.1007/978-3-540-85361-9</a>"},"volume":5201,"type":"conference","abstract":[{"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.","lang":"eng"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"3863"}]},"doi":"10.1007/978-3-540-85361-9","publication_status":"published"},{"doi":"10.1186/1741-7007-6-11","publication_status":"published","publication":"BMC Biology","oa_version":"None","citation":{"short":"L.V. Ugelvig, F. Drijfhout, D. Kronauer, J. Boomsma, J. Pedersen, S. Cremer, BMC Biology 6 (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).","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,” <i>BMC Biology</i>, vol. 6, no. 11. BioMed Central, 2008.","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. <i>BMC Biology</i>. 2008;6(11). doi:<a href=\"https://doi.org/10.1186/1741-7007-6-11\">10.1186/1741-7007-6-11</a>","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.” <i>BMC Biology</i>. BioMed Central, 2008. <a href=\"https://doi.org/10.1186/1741-7007-6-11\">https://doi.org/10.1186/1741-7007-6-11</a>.","apa":"Ugelvig, L. V., Drijfhout, F., Kronauer, D., Boomsma, J., Pedersen, J., &#38; Cremer, S. (2008). The introduction history of invasive garden ants in Europe: integrating genetic, chemical and behavioural approaches. <i>BMC Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1741-7007-6-11\">https://doi.org/10.1186/1741-7007-6-11</a>","mla":"Ugelvig, Line V., et al. “The Introduction History of Invasive Garden Ants in Europe: Integrating Genetic, Chemical and Behavioural Approaches.” <i>BMC Biology</i>, vol. 6, no. 11, BioMed Central, 2008, doi:<a href=\"https://doi.org/10.1186/1741-7007-6-11\">10.1186/1741-7007-6-11</a>."},"extern":"1","volume":6,"type":"journal_article","abstract":[{"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. ","lang":"eng"}],"date_created":"2018-12-11T12:05:48Z","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)"},"_id":"3903","day":"26","status":"public","publist_id":"2249","language":[{"iso":"eng"}],"year":"2008","intvolume":"         6","month":"02","date_published":"2008-02-26T00:00:00Z","publisher":"BioMed Central","date_updated":"2021-01-12T07:53:05Z","issue":"11","author":[{"full_name":"Ugelvig, Line V","last_name":"Ugelvig","orcid":"0000-0003-1832-8883","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","first_name":"Line V"},{"full_name":"Drijfhout, Falko","first_name":"Falko","last_name":"Drijfhout"},{"full_name":"Kronauer, Daniel","last_name":"Kronauer","first_name":"Daniel"},{"first_name":"Jacobus","last_name":"Boomsma","full_name":"Boomsma, Jacobus"},{"full_name":"Pedersen, Jes","first_name":"Jes","last_name":"Pedersen"},{"full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868","last_name":"Cremer","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"}],"title":"The introduction history of invasive garden ants in Europe: integrating genetic, chemical and behavioural approaches","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"oa_version":"None","publication":"Naturwissenschaften","doi":"10.1007/s00114-008-0430-8","publication_status":"published","date_created":"2018-12-11T12:05:48Z","_id":"3905","day":"05","status":"public","volume":95,"citation":{"apa":"Cremer, S., D’Ettorre, P., Drijfhout, F., Sledge, M., Turillazzi, S., &#38; Heinze, J. (2008). Imperfect chemical female mimicry in males of the ant Cardiocondyla obscurior. <i>Naturwissenschaften</i>. Springer. <a href=\"https://doi.org/10.1007/s00114-008-0430-8\">https://doi.org/10.1007/s00114-008-0430-8</a>","mla":"Cremer, Sylvia, et al. “Imperfect Chemical Female Mimicry in Males of the Ant Cardiocondyla Obscurior.” <i>Naturwissenschaften</i>, vol. 95, no. 11, Springer, 2008, pp. 1101–05, doi:<a href=\"https://doi.org/10.1007/s00114-008-0430-8\">10.1007/s00114-008-0430-8</a>.","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.","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,” <i>Naturwissenschaften</i>, vol. 95, no. 11. Springer, pp. 1101–1105, 2008.","short":"S. Cremer, P. D’Ettorre, F. Drijfhout, M. Sledge, S. Turillazzi, J. Heinze, Naturwissenschaften 95 (2008) 1101–1105.","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. <i>Naturwissenschaften</i>. 2008;95(11):1101-1105. doi:<a href=\"https://doi.org/10.1007/s00114-008-0430-8\">10.1007/s00114-008-0430-8</a>","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.” <i>Naturwissenschaften</i>. Springer, 2008. <a href=\"https://doi.org/10.1007/s00114-008-0430-8\">https://doi.org/10.1007/s00114-008-0430-8</a>."},"extern":"1","abstract":[{"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.","lang":"eng"}],"type":"journal_article","language":[{"iso":"eng"}],"year":"2008","page":"1101 - 1105","publist_id":"2246","date_updated":"2021-01-12T07:53:06Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Imperfect chemical female mimicry in males of the ant Cardiocondyla obscurior","author":[{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia","orcid":"0000-0002-2193-3868","last_name":"Cremer","full_name":"Cremer, Sylvia"},{"full_name":"D'Ettorre, Patrizia","first_name":"Patrizia","last_name":"D'Ettorre"},{"full_name":"Drijfhout, Falko","first_name":"Falko","last_name":"Drijfhout"},{"first_name":"Matthew","last_name":"Sledge","full_name":"Sledge, Matthew"},{"first_name":"Stefano","last_name":"Turillazzi","full_name":"Turillazzi, Stefano"},{"full_name":"Heinze, Jürgen","first_name":"Jürgen","last_name":"Heinze"}],"issue":"11","date_published":"2008-08-05T00:00:00Z","month":"08","intvolume":"        95","publisher":"Springer"},{"oa_version":"None","publication":"PLoS One","doi":"10.1371/journal.pone.0003838","publication_status":"published","day":"03","status":"public","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)"},"_id":"3906","date_created":"2018-12-11T12:05:49Z","type":"journal_article","volume":3,"citation":{"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. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0003838\">https://doi.org/10.1371/journal.pone.0003838</a>","mla":"Cremer, Sylvia, et al. “The Evolution of Invasiveness in Garden Ants.” <i>PLoS One</i>, vol. 3, no. 12, Public Library of Science, 2008, doi:<a href=\"https://doi.org/10.1371/journal.pone.0003838\">10.1371/journal.pone.0003838</a>.","ama":"Cremer S, Ugelvig LV, Drijfhout F, et al. The evolution of invasiveness in garden ants. <i>PLoS One</i>. 2008;3(12). doi:<a href=\"https://doi.org/10.1371/journal.pone.0003838\">10.1371/journal.pone.0003838</a>","ieee":"S. Cremer <i>et al.</i>, “The evolution of invasiveness in garden ants,” <i>PLoS One</i>, vol. 3, no. 12. Public Library of Science, 2008.","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).","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).","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.” <i>PLoS One</i>. Public Library of Science, 2008. <a href=\"https://doi.org/10.1371/journal.pone.0003838\">https://doi.org/10.1371/journal.pone.0003838</a>."},"extern":"1","year":"2008","language":[{"iso":"eng"}],"publist_id":"2247","author":[{"full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia","last_name":"Cremer","orcid":"0000-0002-2193-3868"},{"full_name":"Ugelvig, Line V","first_name":"Line V","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1832-8883","last_name":"Ugelvig"},{"last_name":"Drijfhout","first_name":"Falko","full_name":"Drijfhout, Falko"},{"full_name":"Schlick Steiner, Birgit","first_name":"Birgit","last_name":"Schlick Steiner"},{"first_name":"Florian","last_name":"Steiner","full_name":"Steiner, Florian"},{"full_name":"Seifert, Bernhard","first_name":"Bernhard","last_name":"Seifert"},{"first_name":"David","last_name":"Hughes","full_name":"Hughes, David"},{"full_name":"Schulz, Andreas","last_name":"Schulz","first_name":"Andreas"},{"first_name":"Klaus","last_name":"Petersen","full_name":"Petersen, Klaus"},{"full_name":"Konrad, Heino","first_name":"Heino","last_name":"Konrad"},{"full_name":"Stauffer, Christian","last_name":"Stauffer","first_name":"Christian"},{"full_name":"Kiran, Kadri","last_name":"Kiran","first_name":"Kadri"},{"full_name":"Espadaler, Xavier","last_name":"Espadaler","first_name":"Xavier"},{"full_name":"D'Ettorre, Patrizia","last_name":"D'Ettorre","first_name":"Patrizia"},{"full_name":"Aktaç, Nihat","last_name":"Aktaç","first_name":"Nihat"},{"full_name":"Eilenberg, Jørgen","last_name":"Eilenberg","first_name":"Jørgen"},{"last_name":"Jones","first_name":"Graeme","full_name":"Jones, Graeme"},{"last_name":"Nash","first_name":"David","full_name":"Nash, David"},{"first_name":"Jes","last_name":"Pedersen","full_name":"Pedersen, Jes"},{"full_name":"Boomsma, Jacobus","first_name":"Jacobus","last_name":"Boomsma"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The evolution of invasiveness in garden ants","issue":"12","date_updated":"2021-01-12T07:53:06Z","publisher":"Public Library of Science","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).","date_published":"2008-12-03T00:00:00Z","intvolume":"         3","month":"12"},{"volume":4,"citation":{"ama":"Suefuji M, Cremer S, Oettler J, Heinze J. Queen number influences the timing of the sexual production in colonies of Cardiocondyla ants. <i>Biology Letters</i>. 2008;4(6):670-673. doi:<a href=\"https://doi.org/10.1098/rsbl.2008.0355\">10.1098/rsbl.2008.0355</a>","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.","short":"M. Suefuji, S. Cremer, J. Oettler, J. Heinze, Biology Letters 4 (2008) 670–673.","ieee":"M. Suefuji, S. Cremer, J. Oettler, and J. Heinze, “Queen number influences the timing of the sexual production in colonies of Cardiocondyla ants,” <i>Biology Letters</i>, vol. 4, no. 6. Royal Society, The, pp. 670–673, 2008.","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.” <i>Biology Letters</i>. Royal Society, The, 2008. <a href=\"https://doi.org/10.1098/rsbl.2008.0355\">https://doi.org/10.1098/rsbl.2008.0355</a>.","apa":"Suefuji, M., Cremer, S., Oettler, J., &#38; Heinze, J. (2008). Queen number influences the timing of the sexual production in colonies of Cardiocondyla ants. <i>Biology Letters</i>. Royal Society, The. <a href=\"https://doi.org/10.1098/rsbl.2008.0355\">https://doi.org/10.1098/rsbl.2008.0355</a>","mla":"Suefuji, Masaki, et al. “Queen Number Influences the Timing of the Sexual Production in Colonies of Cardiocondyla Ants.” <i>Biology Letters</i>, vol. 4, no. 6, Royal Society, The, 2008, pp. 670–73, doi:<a href=\"https://doi.org/10.1098/rsbl.2008.0355\">10.1098/rsbl.2008.0355</a>."},"extern":"1","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. "}],"type":"journal_article","_id":"3907","date_created":"2018-12-11T12:05:49Z","status":"public","day":"23","publication":"Biology Letters","publication_status":"published","doi":"10.1098/rsbl.2008.0355","oa_version":"None","date_published":"2008-12-23T00:00:00Z","intvolume":"         4","month":"12","publisher":"Royal Society, The","date_updated":"2021-01-12T07:53:07Z","title":"Queen number influences the timing of the sexual production in colonies of Cardiocondyla ants","author":[{"last_name":"Suefuji","first_name":"Masaki","full_name":"Suefuji, Masaki"},{"first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia"},{"full_name":"Oettler, Jan","first_name":"Jan","last_name":"Oettler"},{"last_name":"Heinze","first_name":"Jürgen","full_name":"Heinze, Jürgen"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"6","page":"670 - 673","publist_id":"2248","language":[{"iso":"eng"}],"year":"2008"},{"publication":"Immunological Reviews","doi":"10.1111/j.1600-065X.2008.00592.x","publication_status":"published","oa_version":"None","volume":221,"extern":"1","citation":{"ieee":"T. Lämmermann and M. K. Sixt, “The microanatomy of T-cell responses,” <i>Immunological Reviews</i>, vol. 221, no. 1. Wiley-Blackwell, pp. 26–43, 2008.","short":"T. Lämmermann, M.K. Sixt, Immunological Reviews 221 (2008) 26–43.","ista":"Lämmermann T, Sixt MK. 2008. The microanatomy of T-cell responses. Immunological Reviews. 221(1), 26–43.","ama":"Lämmermann T, Sixt MK. The microanatomy of T-cell responses. <i>Immunological Reviews</i>. 2008;221(1):26-43. doi:<a href=\"https://doi.org/10.1111/j.1600-065X.2008.00592.x\">10.1111/j.1600-065X.2008.00592.x</a>","chicago":"Lämmermann, Tim, and Michael K Sixt. “The Microanatomy of T-Cell Responses.” <i>Immunological Reviews</i>. Wiley-Blackwell, 2008. <a href=\"https://doi.org/10.1111/j.1600-065X.2008.00592.x\">https://doi.org/10.1111/j.1600-065X.2008.00592.x</a>.","apa":"Lämmermann, T., &#38; Sixt, M. K. (2008). The microanatomy of T-cell responses. <i>Immunological Reviews</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1600-065X.2008.00592.x\">https://doi.org/10.1111/j.1600-065X.2008.00592.x</a>","mla":"Lämmermann, Tim, and Michael K. Sixt. “The Microanatomy of T-Cell Responses.” <i>Immunological Reviews</i>, vol. 221, no. 1, Wiley-Blackwell, 2008, pp. 26–43, doi:<a href=\"https://doi.org/10.1111/j.1600-065X.2008.00592.x\">10.1111/j.1600-065X.2008.00592.x</a>."},"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."}],"type":"journal_article","_id":"3939","date_created":"2018-12-11T12:06:00Z","status":"public","day":"07","page":"26 - 43","publist_id":"2187","language":[{"iso":"eng"}],"year":"2008","date_published":"2008-02-07T00:00:00Z","month":"02","intvolume":"       221","publisher":"Wiley-Blackwell","date_updated":"2021-01-12T07:53:20Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Lämmermann, Tim","first_name":"Tim","last_name":"Lämmermann"},{"orcid":"0000-0002-6620-9179","last_name":"Sixt","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K"}],"title":"The microanatomy of T-cell responses","issue":"1"},{"publication_status":"published","doi":"10.1016/j.smim.2007.12.009","publication":"Seminars in Immunology","day":"01","quality_controlled":0,"status":"public","date_created":"2018-12-11T12:06:00Z","_id":"3940","type":"journal_article","abstract":[{"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.","lang":"eng"}],"extern":1,"citation":{"apa":"Lokmic, Z., Lämmermann, T., Sixt, M. K., Cardell, S., Hallmann, R., &#38; Sorokin, L. (2008). The extracellular matrix of the spleen as a potential organizer of immune cell compartments. <i>Seminars in Immunology</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.smim.2007.12.009\">https://doi.org/10.1016/j.smim.2007.12.009</a>","mla":"Lokmic, Zerina, et al. “The Extracellular Matrix of the Spleen as a Potential Organizer of Immune Cell Compartments.” <i>Seminars in Immunology</i>, vol. 20, no. 1, Academic Press, 2008, pp. 4–13, doi:<a href=\"https://doi.org/10.1016/j.smim.2007.12.009\">10.1016/j.smim.2007.12.009</a>.","short":"Z. Lokmic, T. Lämmermann, M.K. Sixt, S. Cardell, R. Hallmann, L. Sorokin, Seminars in Immunology 20 (2008) 4–13.","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,” <i>Seminars in Immunology</i>, 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.","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. <i>Seminars in Immunology</i>. 2008;20(1):4-13. doi:<a href=\"https://doi.org/10.1016/j.smim.2007.12.009\">10.1016/j.smim.2007.12.009</a>","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.” <i>Seminars in Immunology</i>. Academic Press, 2008. <a href=\"https://doi.org/10.1016/j.smim.2007.12.009\">https://doi.org/10.1016/j.smim.2007.12.009</a>."},"volume":20,"year":"2008","publist_id":"2188","page":"4 - 13","issue":"1","title":"The extracellular matrix of the spleen as a potential organizer of immune cell compartments","author":[{"first_name":"Zerina","last_name":"Lokmic","full_name":"Lokmic, Zerina"},{"last_name":"Lämmermann","first_name":"Tim","full_name":"Lämmermann, Tim"},{"full_name":"Michael Sixt","orcid":"0000-0002-6620-9179","last_name":"Sixt","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Susanna","last_name":"Cardell","full_name":"Cardell, Susanna"},{"full_name":"Hallmann, Rupert","last_name":"Hallmann","first_name":"Rupert"},{"last_name":"Sorokin","first_name":"Lydia","full_name":"Sorokin, Lydia"}],"date_updated":"2021-01-12T07:53:20Z","publisher":"Academic Press","month":"02","intvolume":"        20","date_published":"2008-02-01T00:00:00Z"},{"publist_id":"2186","page":"51 - 55","year":"2008","publisher":"Nature Publishing Group","month":"05","intvolume":"       453","date_published":"2008-05-01T00:00:00Z","issue":"7191","title":"Rapid leukocyte migration by integrin-independent flowing and squeezing","author":[{"full_name":"Lämmermann, Tim","last_name":"Lämmermann","first_name":"Tim"},{"full_name":"Bader, Bernhard L","first_name":"Bernhard","last_name":"Bader"},{"full_name":"Monkley, Susan J","last_name":"Monkley","first_name":"Susan"},{"full_name":"Worbs, Tim","last_name":"Worbs","first_name":"Tim"},{"last_name":"Wedlich Söldner","first_name":"Roland","full_name":"Wedlich-Söldner, Roland"},{"full_name":"Hirsch, Karin","last_name":"Hirsch","first_name":"Karin"},{"full_name":"Keller, Markus","last_name":"Keller","first_name":"Markus"},{"last_name":"Förster","first_name":"Reinhold","full_name":"Förster, Reinhold"},{"first_name":"David","last_name":"Critchley","full_name":"Critchley, David R"},{"first_name":"Reinhard","last_name":"Fässler","full_name":"Fässler, Reinhard"},{"first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","orcid":"0000-0002-6620-9179","full_name":"Michael Sixt"}],"date_updated":"2021-01-12T07:53:21Z","doi":"10.1038/nature06887","publication_status":"published","publication":"Nature","type":"journal_article","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."}],"citation":{"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. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature06887\">https://doi.org/10.1038/nature06887</a>","mla":"Lämmermann, Tim, et al. “Rapid Leukocyte Migration by Integrin-Independent Flowing and Squeezing.” <i>Nature</i>, vol. 453, no. 7191, Nature Publishing Group, 2008, pp. 51–55, doi:<a href=\"https://doi.org/10.1038/nature06887\">10.1038/nature06887</a>.","ama":"Lämmermann T, Bader B, Monkley S, et al. Rapid leukocyte migration by integrin-independent flowing and squeezing. <i>Nature</i>. 2008;453(7191):51-55. doi:<a href=\"https://doi.org/10.1038/nature06887\">10.1038/nature06887</a>","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.","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.","ieee":"T. Lämmermann <i>et al.</i>, “Rapid leukocyte migration by integrin-independent flowing and squeezing,” <i>Nature</i>, vol. 453, no. 7191. Nature Publishing Group, pp. 51–55, 2008.","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.” <i>Nature</i>. Nature Publishing Group, 2008. <a href=\"https://doi.org/10.1038/nature06887\">https://doi.org/10.1038/nature06887</a>."},"extern":1,"volume":453,"quality_controlled":0,"day":"01","status":"public","date_created":"2018-12-11T12:06:00Z","_id":"3941"},{"page":"1435 - 1446","publist_id":"2185","year":"2008","intvolume":"       205","month":"06","date_published":"2008-06-02T00:00:00Z","publisher":"Rockefeller University Press","date_updated":"2021-01-12T07:53:21Z","issue":"6","title":"Sialyltransferase ST3Gal-IV controls CXCR2-mediated firm leukocyte arrest during inflammation","author":[{"last_name":"Frommhold","first_name":"David","full_name":"Frommhold, David"},{"last_name":"Ludwig","first_name":"Andreas","full_name":"Ludwig, Andreas"},{"last_name":"Bixel","first_name":"M Gabriele","full_name":"Bixel, M Gabriele"},{"full_name":"Zarbock, Alexander","last_name":"Zarbock","first_name":"Alexander"},{"full_name":"Babushkina, Inna","last_name":"Babushkina","first_name":"Inna"},{"first_name":"Melitta","last_name":"Weissinger","full_name":"Weissinger, Melitta"},{"last_name":"Cauwenberghs","first_name":"Sandra","full_name":"Cauwenberghs, Sandra"},{"full_name":"Ellies, Lesley G","first_name":"Lesley","last_name":"Ellies"},{"full_name":"Marth, Jamey D","last_name":"Marth","first_name":"Jamey"},{"full_name":"Beck-Sickinger, Annette G","first_name":"Annette","last_name":"Beck Sickinger"},{"orcid":"0000-0002-6620-9179","last_name":"Sixt","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Michael Sixt"},{"full_name":"Lange-Sperandio, Bärbel","last_name":"Lange Sperandio","first_name":"Bärbel"},{"full_name":"Zernecke, Alma","first_name":"Alma","last_name":"Zernecke"},{"last_name":"Brandt","first_name":"Ernst","full_name":"Brandt, Ernst"},{"last_name":"Weber","first_name":"Christian","full_name":"Weber, Christian"},{"first_name":"Dietmar","last_name":"Vestweber","full_name":"Vestweber, Dietmar"},{"last_name":"Ley","first_name":"Klaus","full_name":"Ley, Klaus"},{"full_name":"Sperandio, Markus","last_name":"Sperandio","first_name":"Markus"}],"doi":"10.1084/jem.20070846","publication_status":"published","publication":"The Journal of Experimental Medicine","citation":{"ieee":"D. Frommhold <i>et al.</i>, “Sialyltransferase ST3Gal-IV controls CXCR2-mediated firm leukocyte arrest during inflammation,” <i>The Journal of Experimental Medicine</i>, vol. 205, no. 6. Rockefeller University Press, pp. 1435–1446, 2008.","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.","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.","ama":"Frommhold D, Ludwig A, Bixel MG, et al. Sialyltransferase ST3Gal-IV controls CXCR2-mediated firm leukocyte arrest during inflammation. <i>The Journal of Experimental Medicine</i>. 2008;205(6):1435-1446. doi:<a href=\"https://doi.org/10.1084/jem.20070846\">10.1084/jem.20070846</a>","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.” <i>The Journal of Experimental Medicine</i>. Rockefeller University Press, 2008. <a href=\"https://doi.org/10.1084/jem.20070846\">https://doi.org/10.1084/jem.20070846</a>.","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. <i>The Journal of Experimental Medicine</i>. Rockefeller University Press. <a href=\"https://doi.org/10.1084/jem.20070846\">https://doi.org/10.1084/jem.20070846</a>","mla":"Frommhold, David, et al. “Sialyltransferase ST3Gal-IV Controls CXCR2-Mediated Firm Leukocyte Arrest during Inflammation.” <i>The Journal of Experimental Medicine</i>, vol. 205, no. 6, Rockefeller University Press, 2008, pp. 1435–46, doi:<a href=\"https://doi.org/10.1084/jem.20070846\">10.1084/jem.20070846</a>."},"extern":1,"volume":205,"type":"journal_article","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."}],"date_created":"2018-12-11T12:06:01Z","_id":"3942","day":"02","status":"public","quality_controlled":0},{"_id":"3943","date_created":"2018-12-11T12:06:01Z","day":"01","status":"public","quality_controlled":0,"volume":118,"extern":1,"citation":{"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. <i>The Journal of Clinical Investigation</i>. American Society for Clinical Investigation. <a href=\"https://doi.org/10.1172/JCI34694\">https://doi.org/10.1172/JCI34694</a>","mla":"Kessenbrock, Kai, et al. “Proteinase 3 and Neutrophil Elastase Enhance Inflammation in Mice by Inactivating Antiinflammatory Progranulin.” <i>The Journal of Clinical Investigation</i>, vol. 118, no. 7, American Society for Clinical Investigation, 2008, pp. 2438–47, doi:<a href=\"https://doi.org/10.1172/JCI34694\">10.1172/JCI34694</a>.","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.","ieee":"K. Kessenbrock <i>et al.</i>, “Proteinase 3 and neutrophil elastase enhance inflammation in mice by inactivating antiinflammatory progranulin,” <i>The Journal of Clinical Investigation</i>, vol. 118, no. 7. American Society for Clinical Investigation, pp. 2438–2447, 2008.","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.","ama":"Kessenbrock K, Fröhlich L, Sixt MK, et al. Proteinase 3 and neutrophil elastase enhance inflammation in mice by inactivating antiinflammatory progranulin. <i>The Journal of Clinical Investigation</i>. 2008;118(7):2438-2447. doi:<a href=\"https://doi.org/10.1172/JCI34694\">10.1172/JCI34694</a>","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.” <i>The Journal of Clinical Investigation</i>. American Society for Clinical Investigation, 2008. <a href=\"https://doi.org/10.1172/JCI34694\">https://doi.org/10.1172/JCI34694</a>."},"abstract":[{"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.","lang":"eng"}],"type":"journal_article","publication":"The Journal of Clinical Investigation","doi":"10.1172/JCI34694","publication_status":"published","date_updated":"2021-01-12T07:53:22Z","title":"Proteinase 3 and neutrophil elastase enhance inflammation in mice by inactivating antiinflammatory progranulin","author":[{"full_name":"Kessenbrock, Kai","last_name":"Kessenbrock","first_name":"Kai"},{"first_name":"Leopold","last_name":"Fröhlich","full_name":"Fröhlich, Leopold"},{"full_name":"Michael Sixt","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","last_name":"Sixt"},{"full_name":"Lämmermann, Tim","last_name":"Lämmermann","first_name":"Tim"},{"full_name":"Pfister, Heiko","last_name":"Pfister","first_name":"Heiko"},{"last_name":"Bateman","first_name":"Andrew","full_name":"Bateman, Andrew"},{"first_name":"Azzaq","last_name":"Belaaouaj","full_name":"Belaaouaj, Azzaq"},{"full_name":"Ring, Johannes","first_name":"Johannes","last_name":"Ring"},{"full_name":"Ollert, Markus","first_name":"Markus","last_name":"Ollert"},{"full_name":"Fässler, Reinhard","last_name":"Fässler","first_name":"Reinhard"},{"full_name":"Jenne, Dieter E","last_name":"Jenne","first_name":"Dieter"}],"issue":"7","date_published":"2008-07-01T00:00:00Z","month":"07","intvolume":"       118","publisher":"American Society for Clinical Investigation","year":"2008","page":"2438 - 2447","publist_id":"2183"},{"publist_id":"2184","page":"605 - 607","year":"2008","publisher":"Nature Publishing Group","intvolume":"         5","month":"06","date_published":"2008-06-08T00:00:00Z","issue":"7","author":[{"first_name":"Julia","last_name":"Riedl","full_name":"Riedl, Julia"},{"last_name":"Crevenna","first_name":"Alvaro","full_name":"Crevenna, Alvaro H"},{"first_name":"Kai","last_name":"Kessenbrock","full_name":"Kessenbrock, Kai"},{"first_name":"Jerry","last_name":"Yu","full_name":"Yu, Jerry Haochen"},{"last_name":"Neukirchen","first_name":"Dorothee","full_name":"Neukirchen, Dorothee"},{"last_name":"Bista","first_name":"Michal","full_name":"Bista, Michal"},{"first_name":"Frank","last_name":"Bradke","full_name":"Bradke, Frank"},{"full_name":"Jenne, Dieter","first_name":"Dieter","last_name":"Jenne"},{"full_name":"Holak, Tad A","first_name":"Tad","last_name":"Holak"},{"last_name":"Werb","first_name":"Zena","full_name":"Werb, Zena"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","last_name":"Sixt","orcid":"0000-0002-6620-9179","full_name":"Michael Sixt"},{"first_name":"Roland","last_name":"Wedlich Soldner","full_name":"Wedlich-Soldner, Roland"}],"title":"Lifeact: a versatile marker to visualize F-actin","date_updated":"2021-01-12T07:53:22Z","publication_status":"published","doi":"10.1038/nmeth.1220","publication":"Nature Methods","type":"journal_article","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."}],"citation":{"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.” <i>Nature Methods</i>. Nature Publishing Group, 2008. <a href=\"https://doi.org/10.1038/nmeth.1220\">https://doi.org/10.1038/nmeth.1220</a>.","ama":"Riedl J, Crevenna A, Kessenbrock K, et al. Lifeact: a versatile marker to visualize F-actin. <i>Nature Methods</i>. 2008;5(7):605-607. doi:<a href=\"https://doi.org/10.1038/nmeth.1220\">10.1038/nmeth.1220</a>","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.","ieee":"J. Riedl <i>et al.</i>, “Lifeact: a versatile marker to visualize F-actin,” <i>Nature Methods</i>, 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.” <i>Nature Methods</i>, vol. 5, no. 7, Nature Publishing Group, 2008, pp. 605–07, doi:<a href=\"https://doi.org/10.1038/nmeth.1220\">10.1038/nmeth.1220</a>.","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. <i>Nature Methods</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nmeth.1220\">https://doi.org/10.1038/nmeth.1220</a>"},"extern":1,"volume":5,"quality_controlled":0,"status":"public","day":"08","date_created":"2018-12-11T12:06:02Z","_id":"3944"}]