@inproceedings{3858, abstract = {We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided partial-observation (one player has partial-observation and the other player has complete-observation); and (c) complete-observation (both players have com- plete view of the game). We survey the complexity results for the problem of de- ciding the winner in various classes of partial-observation games with ω-regular winning conditions specified as parity objectives. We present a reduction from the class of parity objectives that depend on sequence of states of the game to the sub-class of parity objectives that only depend on the sequence of observations. We also establish that partial-observation acyclic games are PSPACE-complete.}, author = {Chatterjee, Krishnendu and Doyen, Laurent}, location = {Yogyakarta, Indonesia}, pages = {1 -- 14}, publisher = {Springer}, title = {{The complexity of partial-observation parity games}}, doi = {10.1007/978-3-642-16242-8_1}, volume = {6397}, year = {2010}, } @proceedings{3859, abstract = {This book constitutes the proceedings of the 8th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2010, held in Klosterneuburg, Austria in September 2010. The 14 papers presented were carefully reviewed and selected from 31 submissions. In addition, the volume contains 3 invited talks and 2 invited tutorials.The aim of FORMATS is to promote the study of fundamental and practical aspects of timed systems, and to bring together researchers from different disciplines that share an interest in the modeling and analysis of timed systems. Typical topics include foundations and semantics, methods and tools, and applications.}, editor = {Chatterjee, Krishnendu and Henzinger, Thomas A}, location = {Klosterneuburg, Austria}, publisher = {Springer}, title = {{Formal modeling and analysis of timed systems}}, doi = {10.1007/978-3-642-15297-9}, volume = {6246}, year = {2010}, } @inproceedings{3860, abstract = {In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Generalized mean-payoff and energy games replace individual weights by tuples, and the limit average (resp. running sum) of each coordinate must be (resp. remain) nonnegative. These games have applications in the synthesis of resource-bounded processes with multiple resources. We prove the finite-memory determinacy of generalized energy games and show the inter- reducibility of generalized mean-payoff and energy games for finite-memory strategies. We also improve the computational complexity for solving both classes of games with finite-memory strategies: while the previously best known upper bound was EXPSPACE, and no lower bound was known, we give an optimal coNP-complete bound. For memoryless strategies, we show that the problem of deciding the existence of a winning strategy for the protagonist is NP-complete.}, author = {Chatterjee, Krishnendu and Doyen, Laurent and Henzinger, Thomas A and Raskin, Jean}, location = {Chennai, India}, pages = {505 -- 516}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Generalized mean-payoff and energy games}}, doi = {10.4230/LIPIcs.FSTTCS.2010.505}, volume = {8}, year = {2010}, } @article{3861, abstract = {We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properties of nonzero-sum games in a simple and natural way. We show that the one-alternation fragment of strategy logic is strong enough to express the existence of Nash equilibria and secure equilibria, and subsumes other logics that were introduced to reason about games, such as ATL, ATL*, and game logic. We show that strategy logic is decidable, by constructing tree automata that recognize sets of strategies. While for the general logic, our decision procedure is nonelementary, for the simple fragment that is used above we show that the complexity is polynomial in the size of the game graph and optimal in the size of the formula (ranging from polynomial to 2EXPTIME depending on the form of the formula).}, author = {Chatterjee, Krishnendu and Henzinger, Thomas A and Piterman, Nir}, journal = {Information and Computation}, number = {6}, pages = {677 -- 693}, publisher = {Elsevier}, title = {{Strategy logic}}, doi = {10.1016/j.ic.2009.07.004}, volume = {208}, year = {2010}, } @article{3862, abstract = {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 the language-inclusion problem 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.}, author = {Chatterjee, Krishnendu and Doyen, Laurent and Henzinger, Thomas A}, journal = {ACM Transactions on Computational Logic (TOCL)}, number = {4}, publisher = {ACM}, title = {{Quantitative languages}}, doi = {10.1145/1805950.1805953}, volume = {11}, year = {2010}, } @article{3863, abstract = {We consider two-player parity games with imperfect information 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. One major obstacle in adapting the classical procedure is that the complementation of attractor sets would break the invariant of downward-closedness on which the antichain representation relies. We overcome this difficulty by decomposing problem instances recursively into games with a combination of reachability, safety, and simpler parity conditions. We also report on an experimental implementation of our algorithm: to our knowledge, this is the first implementation of a procedure for solving imperfect-information parity games on graphs.}, author = {Berwanger, Dietmar and Chatterjee, Krishnendu and De Wulf, Martin and Doyen, Laurent and Henzinger, Thomas A}, journal = {Information and Computation}, number = {10}, pages = {1206 -- 1220}, publisher = {Elsevier}, title = {{Strategy construction for parity games with imperfect information}}, doi = {10.1016/j.ic.2009.09.006}, volume = {208}, year = {2010}, } @inproceedings{3864, abstract = {Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each word a value, such that a system is preferred if it generates a higher expected value. We solve the following optimal-synthesis problem: given an omega-regular specification, a Markov chain that describes the distribution of inputs, and a weighted automaton that measures how well a system satisfies the given specification tinder the given input assumption, synthesize a system that optimizes the measured value. For safety specifications and measures that are defined by mean-payoff automata, the optimal-synthesis problem amounts to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average reward objective, which can be done in polynomial time. For general omega-regular specifications, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives. We present some experimental results showing optimal systems that were automatically generated in this way.}, author = {Chatterjee, Krishnendu and Henzinger, Thomas A and Jobstmann, Barbara and Singh, Rohit}, location = {Edinburgh, United Kingdom}, pages = {380 -- 395}, publisher = {Springer}, title = {{Measuring and synthesizing systems in probabilistic environments}}, doi = {10.1007/978-3-642-14295-6_34}, volume = {6174}, year = {2010}, } @inproceedings{3865, abstract = {We introduce a technique for debugging multi-threaded C programs and analyzing the impact of source code changes, and its implementation in the prototype tool DIRECT. Our approach uses a combination of source code instrumentation and runtime management. The source code along with a test harness is instrumented to monitor Operating System (OS) and user defined function calls. DIRECT tracks all concurrency control primitives and, optionally, data from the program. DIRECT maintains an abstract global state that combines information from every thread, including the sequence of function calls and concurrency primitives executed. The runtime manager can insert delays, provoking thread inter-leavings that may exhibit bugs that are difficult to reach otherwise. The runtime manager collects an approximation of the reachable state space and uses this approximation to assess the impact of change in a new version of the program.}, author = {Chatterjee, Krishnendu and De Alfaro, Luca and Raman, Vishwanath and Sánchez, César}, editor = {Rosenblum, David and Taenzer, Gabriele}, location = {Paphos, Cyprus}, pages = {293 -- 307}, publisher = {Springer}, title = {{Analyzing the impact of change in multi-threaded programs}}, doi = {10.1007/978-3-642-12029-9_21}, volume = {6013}, year = {2010}, } @inproceedings{3866, abstract = {Systems ought to behave reasonably even in circumstances that are not anticipated in their specifications. We propose a definition of robustness for liveness specifications which prescribes, for any number of environment assumptions that are violated, a minimal number of system guarantees that must still be fulfilled. This notion of robustness can be formulated and realized using a Generalized Reactivity formula. We present an algorithm for synthesizing robust systems from such formulas. For the important special case of Generalized Reactivity formulas of rank 1, our algorithm improves the complexity of [PPS06] for large specifications with a small number of assumptions and guarantees.}, author = {Bloem, Roderick and Chatterjee, Krishnendu and Greimel, Karin and Henzinger, Thomas A and Jobstmann, Barbara}, editor = {Touili, Tayssir and Cook, Byron and Jackson, Paul}, location = {Edinburgh, UK}, pages = {410 -- 424}, publisher = {Springer}, title = {{Robustness in the presence of liveness}}, doi = {10.1007/978-3-642-14295-6_36}, volume = {6174}, year = {2010}, } @article{3867, abstract = {Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit-average, or discounted-sum of the transition weights. The value of a word w is the supremum of the values of the runs over w. We study expressiveness and closure questions about these quantitative languages. We first show that the set of words with value greater than a threshold can be omega-regular for deterministic limit-average and discounted-sum automata, while this set is always omega-regular when the threshold is isolated (i.e., some neighborhood around the threshold contains no word). In the latter case, we prove that the omega-regular language is robust against small perturbations of the transition weights. We next consider automata with transition weights 0 or 1 and show that they are as expressive as general weighted automata in the limit-average case, but not in the discounted-sum case. Third, for quantitative languages L-1 and L-2, we consider the operations max(L-1, L-2), min(L-1, L-2), and 1 - L-1, which generalize the boolean operations on languages, as well as the sum L-1 + L-2. We establish the closure properties of all classes of quantitative languages with respect to these four operations.}, author = {Chatterjee, Krishnendu and Doyen, Laurent and Henzinger, Thomas A}, journal = {Logical Methods in Computer Science}, number = {3}, pages = {1 -- 23}, publisher = {International Federation of Computational Logic}, title = {{Expressiveness and closure properties for quantitative languages}}, doi = {10.2168/LMCS-6(3:10)2010}, volume = {6}, year = {2010}, } @article{3868, abstract = {Simulation and bisimulation metrics for stochastic systems provide a quantitative generalization of the classical simulation and bisimulation relations. These metrics capture the similarity of states with respect to quantitative specifications written in the quantitative mu-calculus and related probabilistic logics. We first show that the metrics provide a bound for the difference in long-run average and discounted average behavior across states, indicating that the metrics can be used both in system verification, and in performance evaluation. For turn-based games and MDPs, we provide a polynomial-time algorithm for the computation of the one-step metric distance between states. The algorithm is based on linear programming; it improves on the previous known exponential-time algorithm based on a reduction to the theory of reals. We then present PSPACE algorithms for both the decision problem and the problem of approximating the metric distance between two states, matching the best known algorithms for Markov chains. For the bisimulation kernel of the metric our algorithm works in time O(n(4)) for both turn-based games and MDPs; improving the previously best known O(n(9).log(n)) time algorithm for MDPs. For a concurrent game G, we show that computing the exact distance be tween states is at least as hard as computing the value of concurrent reachability games and the square-root-sum problem in computational geometry. We show that checking whether the metric distance is bounded by a rational r, can be done via a reduction to the theory of real closed fields, involving a formula with three quantifier alternations, yielding O(vertical bar G vertical bar(O(vertical bar G vertical bar 5))) time complexity, improving the previously known reduction, which yielded O(vertical bar G vertical bar(O(vertical bar G vertical bar 7))) time complexity. These algorithms can be iterated to approximate the metrics using binary search}, author = {Chatterjee, Krishnendu and De Alfaro, Luca and Majumdar, Ritankar and Raman, Vishwanath}, journal = {Logical Methods in Computer Science}, number = {3}, pages = {1 -- 27}, publisher = {International Federation of Computational Logic}, title = {{Algorithms for game metrics}}, doi = {10.2168/LMCS-6(3:13)2010}, volume = {6}, year = {2010}, } @book{3899, abstract = {Combining concepts from topology and algorithms, this book delivers what its title promises: an introduction to the field of computational topology. Starting with motivating problems in both mathematics and computer science and building up from classic topics in geometric and algebraic topology, the third part of the text advances to persistent homology. This point of view is critically important in turning a mostly theoretical field of mathematics into one that is relevant to a multitude of disciplines in the sciences and engineering. The main approach is the discovery of topology through algorithms. The book is ideal for teaching a graduate or advanced undergraduate course in computational topology, as it develops all the background of both the mathematical and algorithmic aspects of the subject from first principles. Thus the text could serve equally well in a course taught in a mathematics department or computer science department.}, author = {Edelsbrunner, Herbert and Harer, John}, isbn = {978-0-8218-4925-5}, pages = {XII, 241}, publisher = {American Mathematical Society}, title = {{Computational Topology: An Introduction}}, doi = {10.1090/mbk/069}, volume = {69}, year = {2010}, } @article{3901, abstract = {We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to acontinuous function, we study the robustness of homology classes in its level and interlevel sets, that is, the amount of perturbationneeded to destroy these classes. The structure of the homology classes and their robustness, over all level and interlevel sets, can bevisualized by a triangular diagram of dots obtained by computing the extended persistence of the function. We give a fast hierarchicalalgorithm using the dual complexes of oct-tree approximations of the function. In addition, we show that for balanced oct-trees, thedual complexes are geometrically realized in $R^3$ and can thus be used to construct level and interlevel sets. We apply these tools tostudy 3-dimensional images of plant root systems.}, author = {Bendich, Paul and Edelsbrunner, Herbert and Kerber, Michael}, journal = {IEEE Transactions of Visualization and Computer Graphics}, number = {6}, pages = {1251 -- 1260}, publisher = {IEEE}, title = {{Computing robustness and persistence for images}}, doi = {10.1109/TVCG.2010.139}, volume = {16}, year = {2010}, } @article{3904, abstract = {Social organisms are constantly exposed to infectious agents via physical contact with conspecifics. While previous work has shown that disease susceptibility at the individual and group level is influenced by gen- etic diversity within and between group members, it remains poorly understood how group-level resistance to pathogens relates directly to individual physiology, defence behaviour and social interactions. We investigated the effects of high versus low genetic diversity on both the individual and collective disease defences in the ant Cardiocondyla obscurior. We compared the antiseptic behaviours (grooming and hygienic behaviour) of workers from genetically homogeneous and diverse colonies after exposure of their brood to the entomopathogenic fungus Metarhizium anisopliae. While workers from diverse colonies performed intensive allogrooming and quickly removed larvae covered with live fungal spores from the nest, workers from homogeneous colonies only removed sick larvae late after infection. This difference was not caused by a reduced repertoire of antiseptic behaviours or a generally decreased brood care activity in ants from homogeneous colonies. Our data instead suggest that reduced genetic diversity compromises the ability of Cardiocondyla colonies to quickly detect or react to the presence of pathogenic fungal spores before an infection is established, thereby affecting the dynamics of social immunity in the colony.}, author = {Ugelvig, Line V and Kronauer, Daniel and Schrempf, Alexandra and Heinze, Jürgen and Cremer, Sylvia}, journal = {Proceedings of the Royal Society of London Series B Biological Sciences}, number = {1695}, pages = {2821 -- 2828}, publisher = {Royal Society, The}, title = {{Rapid anti-pathogen response in ant societies relies on high genetic diversity}}, doi = {10.1098/rspb.2010.0644}, volume = {277}, year = {2010}, } @article{3956, abstract = {The shuttling of leukocytes between the bloodstream and interstitial tissues involves different locomotion strategies that are governed by locally presented soluble and cell-bound signals. Recent studies have furthered our understanding of the rapidly advancing field of leukocyte migration, particularly regarding cellular and subcellular events at the level of the venular wall. Furthermore, emerging cellular models are now addressing the transition from an adherent mode to a non-adherent state, incorporating mechanisms that support an efficient migratory profile of leukocytes in the interstitial tissue beyond the venular wall.}, author = {Nourshargh, Sussan and Hordijk, Peter L and Michael Sixt}, journal = {Nature Reviews Molecular Cell Biology}, number = {5}, pages = {366 -- 378}, publisher = {Nature Publishing Group}, title = {{Breaching multiple barriers: leukocyte motility through venular walls and the interstitium}}, doi = {10.1038/nrm2889}, volume = {11}, year = {2010}, } @article{3957, author = {Riedl, Julia and Flynn, Kevin C and Raducanu, Aurelia and Florian Gärtner and Beck, Gisela and Bosl, Michael and Bradke, Frank and Massberg, Steffen and Aszodi, Attila and Michael Sixt and Wedlich-Söldner, Roland}, journal = {Nature Methods}, number = {3}, pages = {168 -- 169}, publisher = {Nature Publishing Group}, title = {{Lifeact mice for studying F-actin dynamics}}, doi = {10.1038/nmeth0310-168}, volume = {7}, year = {2010}, } @article{3958, abstract = {Extracellular matrix (ECM) proteins can modify immune reactions, e.g. by sequestering or displaying growth factors and by interacting with immune and glial cells. Here we quantified by quantitative polymerase chain reaction (qPCR) expression of 50 ECM components and 34 ECM degrading enzymes in multiple sclerosis (MS) active and inactive white matter lesions. COL1A1, COL3A1, COL5A1 and COL5A2 chains were induced strongly in active lesions and even more in inactive lesions. These chains interact to form collagen types I, III and V, which are fibrillar collagens. Biglycan and decorin, which can decorate fibrillar collagens, were also induced strongly. The fibrillar collagens, biglycan and decorin were largely found between the endothelium and astrocytic glia limitans in the perivascular space where they formed a meshwork which was closely associated with infiltrating immune cells. In active lesions collagen V was also seen in the heavily infiltrated parenchyma. Fibrillar collagens I and III inhibited in vitro human monocyte production of CCL2 (MCP-1), an inflammatory chemokine involved in recruitment of immune cells. Together, ECM changes in lesions with different activities were quantified and proteins forming a perivascular fibrosis were identified. Induced fibrillar collagens may contribute to limiting enlargement of MS lesions by inhibiting the production of CCL2 by monocytes.}, author = {Mohan, Hema and Krumbholz, Markus and Sharma, Rakhi and Eisele, Sylvia and Junker, Andreas and Michael Sixt and Newcombe, Jia and Wekerle, Hartmut and Hohlfeld, Reinhard and Lassmann, Hans and Meinl, Edgar}, journal = {Brain Pathology}, number = {5}, pages = {966 -- 975}, publisher = {Wiley-Blackwell}, title = {{Extracellular matrix in multiple sclerosis lesions: fibrillar collagens, biglycan and decorin are upregulated and associated with infiltrating immune cells}}, doi = {10.1111/j.1750-3639.2010.00399.x}, volume = {20}, year = {2010}, } @article{3959, abstract = {Chemokines orchestrate immune cell trafficking by eliciting either directed or random migration and by activating integrins in order to induce cell adhesion. Analyzing dendritic cell (DC) migration, we showed that these distinct cellular responses depended on the mode of chemokine presentation within tissues. The surface-immobilized form of the chemokine CCL21, the heparan sulfate-anchoring ligand of the CC-chemokine receptor 7 (CCR7), caused random movement of DCs that was confined to the chemokine-presenting surface because it triggered integrin-mediated adhesion. Upon direct contact with CCL21, DCs truncated the anchoring residues of CCL21, thereby releasing it from the solid phase. Soluble CCL21 functionally resembles the second CCR7 ligand, CCL19, which lacks anchoring residues and forms soluble gradients. Both soluble CCR7 ligands triggered chemotactic movement, but not surface adhesion. Adhesive random migration and directional steering cooperate to produce dynamic but spatially restricted locomotion patterns closely resembling the cellular dynamics observed in secondary lymphoid organs.}, author = {Schumann, Kathrin and Lämmermann, Tim and Bruckner, Markus and Legler, Daniel and Polleux, Julien and Spatz, Joachim and Schuler, Gerold and Förster, Reinhold and Lutz, Manfred and Sorokin, Lydia and Sixt, Michael K}, journal = {Immunity}, number = {5}, pages = {703 -- 713}, publisher = {Cell Press}, title = {{Immobilized chemokine fields and soluble chemokine gradients cooperatively shape migration patterns of dendritic cells}}, doi = {10.1016/j.immuni.2010.04.017}, volume = {32}, year = {2010}, } @article{3960, abstract = {When lymphocytes follow chemotactic cues, they can adopt different migratory modes depending on the geometry and molecular composition of their extracellular environment. In this issue of The EMBO Journal, Klemke et al (2010) describe a novel Ras-dependent chemokine receptor signalling pathway that leads to activation of cofilin, which in turn amplifies actin turnover. This signalling module is exclusively required for lymphocyte migration in three-dimensional (3D) environments, but not for locomotion on two-dimensional (2D) surfaces.}, author = {Michele Weber and Michael Sixt}, journal = {EMBO Journal}, number = {17}, pages = {2861 -- 2863}, publisher = {Wiley-Blackwell}, title = {{MEK signalling tunes actin treadmilling for interstitial lymphocyte migration}}, doi = {10.1038/emboj.2010.183}, volume = {29}, year = {2010}, } @article{3961, abstract = {For innate and adaptive immune responses it is essential that inflammatory cells use quick and flexible locomotion strategies. Accordingly, most leukocytes can efficiently infiltrate and traverse almost every physiological or artificial environment. Here, we review how leukocytes might achieve this task mechanistically, and summarize recent findings on the principles of cytoskeletal force generation and transduction at the leading edge of leukocytes. We propose a model in which the cells switch between adhesion-receptor-mediated force transmission and locomotion modes that are based on cellular deformations, but independent of adhesion receptors. This plasticity in migration strategies allows leukocytes to adapt to the geometry and molecular composition of their environment.}, author = {Jörg Renkawitz and Michael Sixt}, journal = {EMBO Reports}, number = {10}, pages = {744 -- 750}, publisher = {Wiley-Blackwell}, title = {{Mechanisms of force generation and force transmission during interstitial leukocyte migration}}, doi = {10.1038/embor.2010.147}, volume = {11}, year = {2010}, }