[{"file_date_updated":"2020-07-14T12:46:17Z","page":"258 - 269","month":"08","ddc":["004"],"conference":{"location":"Brno, Czech Republic","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2010-08-27","start_date":"2010-08-23"},"year":"2010","quality_controlled":"1","volume":6281,"language":[{"iso":"eng"}],"type":"conference","corr_author":"1","publisher":"Springer","publication_status":"published","intvolume":"      6281","pubrep_id":"61","has_accepted_license":"1","doi":"10.1007/978-3-642-15155-2_24","related_material":{"record":[{"relation":"earlier_version","id":"5395","status":"public"}]},"scopus_import":1,"abstract":[{"text":"We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observation-based strategy relies on partial information about the history of a play, namely, on the past sequence of observations. We consider qualitative analysis problems: given a POMDP with a parity objective, decide whether there exists an observation-based strategy to achieve the objective with probability 1 (almost-sure winning), or with positive probability (positive winning). Our main results are twofold. First, we present a complete picture of the computational complexity of the qualitative analysis problem for POMDPs with parity objectives and its subclasses: safety, reachability, Büchi, and coBüchi objectives. We establish several upper and lower bounds that were not known in the literature. Second, we give optimal bounds (matching upper and lower bounds) for the memory required by pure and randomized observation-based strategies for each class of objectives.","lang":"eng"}],"citation":{"apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2010). Qualitative analysis of partially-observable Markov Decision Processes (Vol. 6281, pp. 258–269). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_24\">https://doi.org/10.1007/978-3-642-15155-2_24</a>","mla":"Chatterjee, Krishnendu, et al. <i>Qualitative Analysis of Partially-Observable Markov Decision Processes</i>. Vol. 6281, Springer, 2010, pp. 258–69, doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_24\">10.1007/978-3-642-15155-2_24</a>.","ama":"Chatterjee K, Doyen L, Henzinger TA. Qualitative analysis of partially-observable Markov Decision Processes. In: Vol 6281. Springer; 2010:258-269. doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_24\">10.1007/978-3-642-15155-2_24</a>","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2010, pp. 258–269.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Qualitative Analysis of Partially-Observable Markov Decision Processes,” 6281:258–69. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_24\">https://doi.org/10.1007/978-3-642-15155-2_24</a>.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Qualitative analysis of partially-observable Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 258–269.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2010. Qualitative analysis of partially-observable Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 258–269."},"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"title":"Qualitative analysis of partially-observable Markov Decision Processes","alternative_title":["LNCS"],"ec_funded":1,"day":"01","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-09T21:08:23Z","status":"public","_id":"3855","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques"},{"name":"Design for Embedded Systems","call_identifier":"FP7","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T12:05:32Z","oa_version":"Submitted Version","file":[{"file_id":"5038","access_level":"open_access","date_updated":"2020-07-14T12:46:17Z","content_type":"application/pdf","checksum":"b6c82ec82f194e5b0ab7c1c3800e4580","date_created":"2018-12-12T10:13:51Z","file_size":173948,"relation":"main_file","file_name":"IST-2012-61-v1+1_Qualitative_analysis_of_partially-observable_Markov_Decision_Processes.pdf","creator":"system"}],"publist_id":"2326","date_published":"2010-08-01T00:00:00Z","oa":1},{"related_material":{"record":[{"relation":"later_version","id":"1731","status":"public"}]},"doi":"10.1007/978-3-642-15155-2_23","scopus_import":"1","abstract":[{"lang":"eng","text":"We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided complete-observation (one player has complete observation); and (c) complete-observation (both players have complete view of the game). On the basis of mode of interaction we have the following classification: (a) concurrent (players interact simultaneously); and (b) turn-based (players interact in turn). The two sources of randomness in these games are randomness in transition function and randomness in strategies. In general, randomized strategies are more powerful than deterministic strategies, and randomness in transitions gives more general classes of games. We present a complete characterization for the classes of games where randomness is not helpful in: (a) the transition function (probabilistic transition can be simulated by deterministic transition); and (b) strategies (pure strategies are as powerful as randomized strategies). As consequence of our characterization we obtain new undecidability results for these games. "}],"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Randomness for Free</i>. Vol. 6281, Springer, 2010, pp. 246–57, doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_23\">10.1007/978-3-642-15155-2_23</a>.","apa":"Chatterjee, K., Doyen, L., Gimbert, H., &#38; Henzinger, T. A. (2010). Randomness for free (Vol. 6281, pp. 246–257). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_23\">https://doi.org/10.1007/978-3-642-15155-2_23</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free,” 6281:246–57. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_23\">https://doi.org/10.1007/978-3-642-15155-2_23</a>.","ista":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2010. Randomness for free. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 246–257.","ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 246–257.","ama":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. Randomness for free. In: Vol 6281. Springer; 2010:246-257. doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_23\">10.1007/978-3-642-15155-2_23</a>","short":"K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, in:, Springer, 2010, pp. 246–257."},"publisher":"Springer","corr_author":"1","type":"conference","publication_status":"published","pubrep_id":"60","intvolume":"      6281","year":"2010","conference":{"start_date":"2010-08-23","end_date":"2010-08-27","name":"MFCS: Mathematical Foundations of Computer Science","location":"Brno, Czech Republic"},"quality_controlled":"1","volume":6281,"language":[{"iso":"eng"}],"article_processing_charge":"No","page":"246 - 257","month":"09","arxiv":1,"date_published":"2010-09-06T00:00:00Z","external_id":{"arxiv":["1006.0673"]},"oa":1,"project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"},{"name":"Design for Embedded Systems","call_identifier":"FP7","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"_id":"3856","oa_version":"Preprint","date_created":"2018-12-11T12:05:32Z","publist_id":"2325","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-09-23T10:32:00Z","status":"public","alternative_title":["LNCS"],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"full_name":"Gimbert, Hugo","last_name":"Gimbert","first_name":"Hugo"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"title":"Randomness for free","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1006.0673"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"day":"06","ec_funded":1,"acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign."},{"pubrep_id":"28","intvolume":"      6252","corr_author":"1","type":"conference","publisher":"Springer","publication_status":"published","abstract":[{"lang":"eng","text":"We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi, and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present an almost complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words."}],"citation":{"ama":"Chatterjee K, Henzinger TA. Probabilistic Automata on infinite words: decidability and undecidability results. In: Vol 6252. Springer; 2010:1-16. doi:<a href=\"https://doi.org/10.1007/978-3-642-15643-4_1\">10.1007/978-3-642-15643-4_1</a>","short":"K. Chatterjee, T.A. Henzinger, in:, Springer, 2010, pp. 1–16.","ieee":"K. Chatterjee and T. A. Henzinger, “Probabilistic Automata on infinite words: decidability and undecidability results,” presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore, 2010, vol. 6252, pp. 1–16.","ista":"Chatterjee K, Henzinger TA. 2010. Probabilistic Automata on infinite words: decidability and undecidability results. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6252, 1–16.","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “Probabilistic Automata on Infinite Words: Decidability and Undecidability Results,” 6252:1–16. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15643-4_1\">https://doi.org/10.1007/978-3-642-15643-4_1</a>.","mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger. <i>Probabilistic Automata on Infinite Words: Decidability and Undecidability Results</i>. Vol. 6252, Springer, 2010, pp. 1–16, doi:<a href=\"https://doi.org/10.1007/978-3-642-15643-4_1\">10.1007/978-3-642-15643-4_1</a>.","apa":"Chatterjee, K., &#38; Henzinger, T. A. (2010). Probabilistic Automata on infinite words: decidability and undecidability results (Vol. 6252, pp. 1–16). Presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15643-4_1\">https://doi.org/10.1007/978-3-642-15643-4_1</a>"},"related_material":{"record":[{"status":"public","id":"5392","relation":"earlier_version"}]},"doi":"10.1007/978-3-642-15643-4_1","scopus_import":1,"page":"1 - 16","month":"10","volume":6252,"language":[{"iso":"eng"}],"conference":{"end_date":"2010-09-24","name":"ATVA: Automated Technology for Verification and Analysis","location":"Singapore, Singapore","start_date":"2010-09-21"},"year":"2010","quality_controlled":"1","publist_id":"2324","project":[{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques"},{"call_identifier":"FP7","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373"}],"_id":"3857","oa_version":"None","date_created":"2018-12-11T12:05:33Z","date_published":"2010-10-12T00:00:00Z","day":"12","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"ec_funded":1,"alternative_title":["LNCS"],"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"}],"title":"Probabilistic Automata on infinite words: decidability and undecidability results","date_updated":"2024-10-09T21:08:23Z","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"},{"alternative_title":["LNCS"],"title":"The complexity of partial-observation parity games","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"}],"day":"09","department":[{"_id":"KrCh"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","date_updated":"2025-09-30T09:34:35Z","oa_version":"Submitted Version","date_created":"2018-12-11T12:05:33Z","_id":"3858","publist_id":"2323","file":[{"file_id":"7872","date_updated":"2020-07-14T12:46:18Z","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"770e86e5d78c56fddb4786a8da7ef126","date_created":"2020-05-19T16:29:04Z","file_size":142836,"creator":"dernst","file_name":"2010_LPAR_Chatterjee.pdf"}],"date_published":"2010-12-09T00:00:00Z","external_id":{"isi":["000288062700001"]},"oa":1,"article_processing_charge":"No","isi":1,"month":"12","page":"1 - 14","file_date_updated":"2020-07-14T12:46:18Z","quality_controlled":"1","year":"2010","ddc":["000"],"conference":{"start_date":"2010-10-10","end_date":"2010-10-15","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","location":"Yogyakarta, Indonesia"},"language":[{"iso":"eng"}],"volume":6397,"publication_status":"published","type":"conference","corr_author":"1","publisher":"Springer","has_accepted_license":"1","intvolume":"      6397","scopus_import":"1","doi":"10.1007/978-3-642-16242-8_1","citation":{"mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>The Complexity of Partial-Observation Parity Games</i>. Vol. 6397, Springer, 2010, pp. 1–14, doi:<a href=\"https://doi.org/10.1007/978-3-642-16242-8_1\">10.1007/978-3-642-16242-8_1</a>.","apa":"Chatterjee, K., &#38; Doyen, L. (2010). The complexity of partial-observation parity games (Vol. 6397, pp. 1–14). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-16242-8_1\">https://doi.org/10.1007/978-3-642-16242-8_1</a>","ieee":"K. Chatterjee and L. Doyen, “The complexity of partial-observation parity games,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia, 2010, vol. 6397, pp. 1–14.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “The Complexity of Partial-Observation Parity Games,” 6397:1–14. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-16242-8_1\">https://doi.org/10.1007/978-3-642-16242-8_1</a>.","ista":"Chatterjee K, Doyen L. 2010. The complexity of partial-observation parity games. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 6397, 1–14.","ama":"Chatterjee K, Doyen L. The complexity of partial-observation parity games. In: Vol 6397. Springer; 2010:1-14. doi:<a href=\"https://doi.org/10.1007/978-3-642-16242-8_1\">10.1007/978-3-642-16242-8_1</a>","short":"K. Chatterjee, L. Doyen, in:, Springer, 2010, pp. 1–14."},"abstract":[{"text":"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.","lang":"eng"}]},{"type":"conference_editor","_id":"3859","publisher":"Springer","corr_author":"1","publication_status":"published","oa_version":"None","date_created":"2018-12-11T12:05:33Z","intvolume":"      6246","publist_id":"2322","related_material":{"link":[{"url":"https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=12721","relation":"other","description":"eBook available via IST BookList"}]},"doi":"10.1007/978-3-642-15297-9","date_published":"2010-09-20T00:00:00Z","abstract":[{"lang":"eng","text":"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."}],"citation":{"short":"K. Chatterjee, T.A. Henzinger, eds., Formal Modeling and Analysis of Timed Systems, Springer, 2010.","ama":"Chatterjee K, Henzinger TA, eds. <i>Formal Modeling and Analysis of Timed Systems</i>. Vol 6246. Springer; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9\">10.1007/978-3-642-15297-9</a>","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger, eds. <i>Formal Modeling and Analysis of Timed Systems</i>. Vol. 6246. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15297-9\">https://doi.org/10.1007/978-3-642-15297-9</a>.","ista":"Chatterjee K, Henzinger TA eds. 2010. Formal modeling and analysis of timed systems, Springer,p.","ieee":"K. Chatterjee and T. A. Henzinger, Eds., <i>Formal modeling and analysis of timed systems</i>, vol. 6246. Springer, 2010.","apa":"Chatterjee, K., &#38; Henzinger, T. A. (Eds.). (2010). <i>Formal modeling and analysis of timed systems</i> (Vol. 6246). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15297-9\">https://doi.org/10.1007/978-3-642-15297-9</a>","mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger, editors. <i>Formal Modeling and Analysis of Timed Systems</i>. Vol. 6246, Springer, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9\">10.1007/978-3-642-15297-9</a>."},"alternative_title":["LNCS"],"title":"Formal modeling and analysis of timed systems","day":"20","editor":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"month":"09","conference":{"start_date":"2010-09-08","location":"Klosterneuburg, Austria","end_date":"2010-09-10","name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"year":"2010","quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","volume":6246,"date_updated":"2024-10-09T20:54:05Z","language":[{"iso":"eng"}],"status":"public"},{"language":[{"iso":"eng"}],"volume":8,"quality_controlled":"1","conference":{"location":"Chennai, India","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","end_date":"2010-12-18","start_date":"2010-12-15"},"year":"2010","ddc":["005"],"month":"12","page":"505 - 516","file_date_updated":"2020-07-14T12:46:18Z","article_processing_charge":"No","isi":1,"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","citation":{"apa":"Chatterjee, K., Doyen, L., Henzinger, T. A., &#38; Raskin, J. (2010). Generalized mean-payoff and energy games (Vol. 8, pp. 505–516). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505</a>","mla":"Chatterjee, Krishnendu, et al. <i>Generalized Mean-Payoff and Energy Games</i>. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">10.4230/LIPIcs.FSTTCS.2010.505</a>.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–516.","ama":"Chatterjee K, Doyen L, Henzinger TA, Raskin J. Generalized mean-payoff and energy games. In: Vol 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:505-516. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">10.4230/LIPIcs.FSTTCS.2010.505</a>","ista":"Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2010. Generalized mean-payoff and energy games. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 505–516.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Generalized Mean-Payoff and Energy Games,” 8:505–16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505</a>.","ieee":"K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Generalized mean-payoff and energy games,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 505–516."},"abstract":[{"text":"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.","lang":"eng"}],"scopus_import":"1","doi":"10.4230/LIPIcs.FSTTCS.2010.505","has_accepted_license":"1","intvolume":"         8","pubrep_id":"59","publication_status":"published","type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","corr_author":"1","status":"public","tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"date_updated":"2025-09-30T09:33:50Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"13","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"alternative_title":["LIPIcs"],"title":"Generalized mean-payoff and energy games","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Raskin, Jean","last_name":"Raskin","first_name":"Jean"}],"external_id":{"isi":["000310361000043"]},"oa":1,"date_published":"2010-12-13T00:00:00Z","publist_id":"2321","file":[{"file_id":"5147","access_level":"open_access","date_updated":"2020-07-14T12:46:18Z","content_type":"application/pdf","date_created":"2018-12-12T10:15:27Z","checksum":"1caabd6319b979927208117a41192637","file_size":178278,"relation":"main_file","file_name":"IST-2012-59-v1+1_Generalized_mean-payoff_and_energy_games.pdf","creator":"system"},{"file_size":477976,"date_created":"2018-12-12T10:15:28Z","checksum":"3a59759ceeacdb5b578f3803d5e6769b","relation":"main_file","file_name":"IST-2016-59-v2+1_2_1_.pdf","creator":"system","file_id":"5148","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:46:18Z"}],"oa_version":"Submitted Version","date_created":"2018-12-11T12:05:34Z","_id":"3860"},{"_id":"3861","date_created":"2018-12-11T12:05:34Z","oa_version":"Submitted Version","file":[{"date_updated":"2020-07-14T12:46:18Z","content_type":"application/pdf","access_level":"open_access","file_id":"4911","creator":"system","file_name":"IST-2012-56-v1+1_Strategy_logic.pdf","relation":"main_file","date_created":"2018-12-12T10:11:54Z","checksum":"13bff93f3c2a014e2908145a4517f177","file_size":189120}],"publist_id":"2317","publication":"Information and Computation","date_published":"2010-06-01T00:00:00Z","oa":1,"external_id":{"isi":["000278070100006"]},"title":"Strategy logic","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nir","last_name":"Piterman","full_name":"Piterman, Nir"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-30T09:32:18Z","status":"public","type":"journal_article","corr_author":"1","publisher":"Elsevier","publication_status":"published","pubrep_id":"56","intvolume":"       208","has_accepted_license":"1","doi":"10.1016/j.ic.2009.07.004","related_material":{"record":[{"status":"public","id":"3884","relation":"earlier_version"}]},"scopus_import":"1","abstract":[{"lang":"eng","text":"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)."}],"citation":{"apa":"Chatterjee, K., Henzinger, T. A., &#38; Piterman, N. (2010). Strategy logic. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">https://doi.org/10.1016/j.ic.2009.07.004</a>","mla":"Chatterjee, Krishnendu, et al. “Strategy Logic.” <i>Information and Computation</i>, vol. 208, no. 6, Elsevier, 2010, pp. 677–93, doi:<a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">10.1016/j.ic.2009.07.004</a>.","short":"K. Chatterjee, T.A. Henzinger, N. Piterman, Information and Computation 208 (2010) 677–693.","ama":"Chatterjee K, Henzinger TA, Piterman N. Strategy logic. <i>Information and Computation</i>. 2010;208(6):677-693. doi:<a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">10.1016/j.ic.2009.07.004</a>","ista":"Chatterjee K, Henzinger TA, Piterman N. 2010. Strategy logic. Information and Computation. 208(6), 677–693.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy Logic.” <i>Information and Computation</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">https://doi.org/10.1016/j.ic.2009.07.004</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and N. Piterman, “Strategy logic,” <i>Information and Computation</i>, vol. 208, no. 6. Elsevier, pp. 677–693, 2010."},"isi":1,"article_processing_charge":"No","file_date_updated":"2020-07-14T12:46:18Z","issue":"6","page":"677 - 693","month":"06","ddc":["000","004"],"year":"2010","quality_controlled":"1","volume":208,"language":[{"iso":"eng"}]},{"citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Quantitative Languages.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2010. <a href=\"https://doi.org/10.1145/1805950.1805953\">https://doi.org/10.1145/1805950.1805953</a>.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2010. Quantitative languages. ACM Transactions on Computational Logic (TOCL). 11(4), 23.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Quantitative languages,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 11, no. 4. ACM, 2010.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 11 (2010).","ama":"Chatterjee K, Doyen L, Henzinger TA. Quantitative languages. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2010;11(4). doi:<a href=\"https://doi.org/10.1145/1805950.1805953\">10.1145/1805950.1805953</a>","mla":"Chatterjee, Krishnendu, et al. “Quantitative Languages.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 11, no. 4, 23, ACM, 2010, doi:<a href=\"https://doi.org/10.1145/1805950.1805953\">10.1145/1805950.1805953</a>.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2010). Quantitative languages. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/1805950.1805953\">https://doi.org/10.1145/1805950.1805953</a>"},"abstract":[{"lang":"eng","text":"Quantitative generalizations of classical languages, which assign to each word a real number instead of a Boolean value, have applications in modeling resource-constrained computation. We use weighted automata (finite automata with transition weights) to define several natural classes of quantitative languages over finite and infinite words; in particular, the real value of an infinite run is computed as the maximum, limsup, liminf, limit average, or discounted sum of the transition weights. We define the classical decision problems of automata theory (emptiness, universality, language inclusion, and language equivalence) in the quantitative setting and study their computational complexity. As the decidability of 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."}],"scopus_import":"1","doi":"10.1145/1805950.1805953","has_accepted_license":"1","intvolume":"        11","pubrep_id":"57","publication_status":"published","publisher":"ACM","type":"journal_article","corr_author":"1","language":[{"iso":"eng"}],"volume":11,"quality_controlled":"1","ddc":["004"],"year":"2010","month":"07","file_date_updated":"2020-07-14T12:46:18Z","issue":"4","article_processing_charge":"No","isi":1,"oa":1,"external_id":{"isi":["000280546300003"]},"date_published":"2010-07-01T00:00:00Z","publication":"ACM Transactions on Computational Logic (TOCL)","extern":"1","file":[{"creator":"system","file_name":"IST-2012-57-v1+1_Quantitative_languages.pdf","relation":"main_file","file_size":169136,"date_created":"2018-12-12T10:16:41Z","checksum":"f2e50bbd6871fba0aec30bd9625a1ee7","content_type":"application/pdf","date_updated":"2020-07-14T12:46:18Z","access_level":"open_access","file_id":"5230"}],"publist_id":"2318","date_created":"2018-12-11T12:05:34Z","article_number":"23","oa_version":"Submitted Version","_id":"3862","project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"}],"status":"public","date_updated":"2025-09-30T09:32:49Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","ec_funded":1,"day":"01","title":"Quantitative languages","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}]},{"date_published":"2010-10-01T00:00:00Z","oa":1,"external_id":{"isi":["000281830300007"]},"date_created":"2018-12-11T12:05:35Z","oa_version":"Submitted Version","_id":"3863","project":[{"name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"}],"publication":"Information and Computation","file":[{"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:46:18Z","file_id":"5300","file_name":"IST-2012-58-v1+1_Strategy_construction_for_parity_games_with_imperfect_information.pdf","creator":"system","file_size":287496,"checksum":"29d146e4f8049dbb7f80bbf7ea3700ed","date_created":"2018-12-12T10:17:44Z","relation":"main_file"}],"publist_id":"2319","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","date_updated":"2026-05-29T09:53:31Z","title":"Strategy construction for parity games with imperfect information","author":[{"full_name":"Berwanger, Dietmar","last_name":"Berwanger","first_name":"Dietmar"},{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"De Wulf, Martin","first_name":"Martin","last_name":"De Wulf"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"ec_funded":1,"day":"01","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"scopus_import":"1","doi":"10.1016/j.ic.2009.09.006","related_material":{"record":[{"relation":"earlier_version","id":"3880","status":"public"}]},"citation":{"chicago":"Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, and Thomas A Henzinger. “Strategy Construction for Parity Games with Imperfect Information.” <i>Information and Computation</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.ic.2009.09.006\">https://doi.org/10.1016/j.ic.2009.09.006</a>.","ieee":"D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and T. A. Henzinger, “Strategy construction for parity games with imperfect information,” <i>Information and Computation</i>, vol. 208, no. 10. Elsevier, pp. 1206–1220, 2010.","ista":"Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. 2010. Strategy construction for parity games with imperfect information. Information and Computation. 208(10), 1206–1220.","ama":"Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. Strategy construction for parity games with imperfect information. <i>Information and Computation</i>. 2010;208(10):1206-1220. doi:<a href=\"https://doi.org/10.1016/j.ic.2009.09.006\">10.1016/j.ic.2009.09.006</a>","short":"D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, Information and Computation 208 (2010) 1206–1220.","apa":"Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., &#38; Henzinger, T. A. (2010). Strategy construction for parity games with imperfect information. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2009.09.006\">https://doi.org/10.1016/j.ic.2009.09.006</a>","mla":"Berwanger, Dietmar, et al. “Strategy Construction for Parity Games with Imperfect Information.” <i>Information and Computation</i>, vol. 208, no. 10, Elsevier, 2010, pp. 1206–20, doi:<a href=\"https://doi.org/10.1016/j.ic.2009.09.006\">10.1016/j.ic.2009.09.006</a>."},"abstract":[{"lang":"eng","text":"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."}],"publication_status":"published","type":"journal_article","publisher":"Elsevier","has_accepted_license":"1","intvolume":"       208","pubrep_id":"58","quality_controlled":"1","year":"2010","ddc":["005"],"language":[{"iso":"eng"}],"volume":208,"article_processing_charge":"No","isi":1,"month":"10","file_date_updated":"2020-07-14T12:46:18Z","page":"1206 - 1220","issue":"10"},{"date_published":"2010-07-09T00:00:00Z","arxiv":1,"external_id":{"arxiv":["1004.0739"]},"oa":1,"oa_version":"Preprint","date_created":"2018-12-11T12:05:35Z","_id":"3864","publist_id":"2313","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_updated":"2025-09-23T09:33:01Z","alternative_title":["LNCS"],"title":"Measuring and synthesizing systems in probabilistic environments","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"},{"last_name":"Singh","first_name":"Rohit","full_name":"Singh, Rohit"}],"main_file_link":[{"url":"http://arxiv.org/abs/1004.0739","open_access":"1"}],"acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"day":"09","scopus_import":"1","related_material":{"record":[{"id":"1856","relation":"later_version","status":"public"}]},"doi":"10.1007/978-3-642-14295-6_34","citation":{"apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Singh, R. (2010). Measuring and synthesizing systems in probabilistic environments (Vol. 6174, pp. 380–395). Presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_34\">https://doi.org/10.1007/978-3-642-14295-6_34</a>","mla":"Chatterjee, Krishnendu, et al. <i>Measuring and Synthesizing Systems in Probabilistic Environments</i>. Vol. 6174, Springer, 2010, pp. 380–95, doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_34\">10.1007/978-3-642-14295-6_34</a>.","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom, 2010, vol. 6174, pp. 380–395.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments,” 6174:380–95. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_34\">https://doi.org/10.1007/978-3-642-14295-6_34</a>.","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2010. Measuring and synthesizing systems in probabilistic environments. CAV: Computer Aided Verification, LNCS, vol. 6174, 380–395.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2010, pp. 380–395.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing systems in probabilistic environments. In: Vol 6174. Springer; 2010:380-395. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_34\">10.1007/978-3-642-14295-6_34</a>"},"abstract":[{"text":"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.","lang":"eng"}],"publication_status":"published","type":"conference","corr_author":"1","publisher":"Springer","intvolume":"      6174","quality_controlled":"1","year":"2010","conference":{"end_date":"2010-07-19","name":"CAV: Computer Aided Verification","location":"Edinburgh, United Kingdom","start_date":"201-07-15"},"language":[{"iso":"eng"}],"volume":6174,"article_processing_charge":"No","month":"07","page":"380 - 395"},{"date_updated":"2025-05-20T06:36:30Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"21","department":[{"_id":"KrCh"}],"title":"Analyzing the impact of change in multi-threaded programs","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"De Alfaro","first_name":"Luca","full_name":"De Alfaro, Luca"},{"first_name":"Vishwanath","last_name":"Raman","full_name":"Raman, Vishwanath"},{"full_name":"Sánchez, César","last_name":"Sánchez","first_name":"César"}],"alternative_title":["LNCS"],"publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783642120299"]},"OA_type":"closed access","date_published":"2010-04-21T00:00:00Z","publist_id":"2315","publication":"13th International Conference on Fundamental Approaches to Software Engineering","_id":"3865","date_created":"2018-12-11T12:05:35Z","oa_version":"None","volume":6013,"language":[{"iso":"eng"}],"year":"2010","conference":{"start_date":"2010-03-20","location":"Paphos, Cyprus","name":"FASE: Fundamental Approaches To Software Engineering","end_date":"2010-03-28"},"quality_controlled":"1","page":"293 - 307","month":"04","article_processing_charge":"No","abstract":[{"text":"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.","lang":"eng"}],"citation":{"ista":"Chatterjee K, De Alfaro L, Raman V, Sánchez C. 2010. Analyzing the impact of change in multi-threaded programs. 13th International Conference on Fundamental Approaches to Software Engineering. FASE: Fundamental Approaches To Software Engineering, LNCS, vol. 6013, 293–307.","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, Vishwanath Raman, and César Sánchez. “Analyzing the Impact of Change in Multi-Threaded Programs.” In <i>13th International Conference on Fundamental Approaches to Software Engineering</i>, 6013:293–307. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_21\">https://doi.org/10.1007/978-3-642-12029-9_21</a>.","ieee":"K. Chatterjee, L. De Alfaro, V. Raman, and C. Sánchez, “Analyzing the impact of change in multi-threaded programs,” in <i>13th International Conference on Fundamental Approaches to Software Engineering</i>, Paphos, Cyprus, 2010, vol. 6013, pp. 293–307.","short":"K. Chatterjee, L. De Alfaro, V. Raman, C. Sánchez, in:, 13th International Conference on Fundamental Approaches to Software Engineering, Springer, 2010, pp. 293–307.","ama":"Chatterjee K, De Alfaro L, Raman V, Sánchez C. Analyzing the impact of change in multi-threaded programs. In: <i>13th International Conference on Fundamental Approaches to Software Engineering</i>. Vol 6013. Springer; 2010:293-307. doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_21\">10.1007/978-3-642-12029-9_21</a>","apa":"Chatterjee, K., De Alfaro, L., Raman, V., &#38; Sánchez, C. (2010). Analyzing the impact of change in multi-threaded programs. In <i>13th International Conference on Fundamental Approaches to Software Engineering</i> (Vol. 6013, pp. 293–307). Paphos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_21\">https://doi.org/10.1007/978-3-642-12029-9_21</a>","mla":"Chatterjee, Krishnendu, et al. “Analyzing the Impact of Change in Multi-Threaded Programs.” <i>13th International Conference on Fundamental Approaches to Software Engineering</i>, vol. 6013, Springer, 2010, pp. 293–307, doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_21\">10.1007/978-3-642-12029-9_21</a>."},"doi":"10.1007/978-3-642-12029-9_21","scopus_import":"1","intvolume":"      6013","publisher":"Springer","type":"conference","publication_status":"published"},{"oa":1,"date_published":"2010-07-01T00:00:00Z","publist_id":"2310","file":[{"file_id":"5243","date_updated":"2020-07-14T12:46:19Z","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:16:52Z","checksum":"9d204611c8d7855bed8134f8708a0010","file_size":213083,"creator":"system","file_name":"IST-2012-54-v1+1_Robustness_in_the_presence_of_liveness.pdf"}],"project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems","call_identifier":"FP7"}],"_id":"3866","oa_version":"Submitted Version","date_created":"2018-12-11T12:05:36Z","date_updated":"2021-01-12T07:52:47Z","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"day":"01","ec_funded":1,"alternative_title":["LNCS"],"title":"Robustness in the presence of liveness","author":[{"full_name":"Bloem, Roderick","last_name":"Bloem","first_name":"Roderick"},{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Greimel","first_name":"Karin","full_name":"Greimel, Karin"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jobstmann","first_name":"Barbara","full_name":"Jobstmann, Barbara"}],"abstract":[{"lang":"eng","text":"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."}],"citation":{"apa":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., &#38; Jobstmann, B. (2010). Robustness in the presence of liveness. In T. Touili, B. Cook, &#38; P. Jackson (Eds.) (Vol. 6174, pp. 410–424). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">https://doi.org/10.1007/978-3-642-14295-6_36</a>","mla":"Bloem, Roderick, et al. <i>Robustness in the Presence of Liveness</i>. Edited by Tayssir Touili et al., vol. 6174, Springer, 2010, pp. 410–24, doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">10.1007/978-3-642-14295-6_36</a>.","ista":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2010. Robustness in the presence of liveness. CAV: Computer Aided Verification, LNCS, vol. 6174, 410–424.","ieee":"R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Robustness in the presence of liveness,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 410–424.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Robustness in the Presence of Liveness.” edited by Tayssir Touili, Byron Cook, and Paul Jackson, 6174:410–24. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">https://doi.org/10.1007/978-3-642-14295-6_36</a>.","ama":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. Robustness in the presence of liveness. In: Touili T, Cook B, Jackson P, eds. Vol 6174. Springer; 2010:410-424. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">10.1007/978-3-642-14295-6_36</a>","short":"R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, T. Touili, B. Cook, P. Jackson (Eds.), Springer, 2010, pp. 410–424."},"doi":"10.1007/978-3-642-14295-6_36","scopus_import":1,"intvolume":"      6174","pubrep_id":"54","has_accepted_license":"1","publisher":"Springer","type":"conference","publication_status":"published","volume":6174,"language":[{"iso":"eng"}],"conference":{"start_date":"2010-07-15","location":"Edinburgh, UK","name":"CAV: Computer Aided Verification","end_date":"2010-07-19"},"ddc":["004"],"year":"2010","quality_controlled":"1","page":"410 - 424","editor":[{"first_name":"Tayssir","last_name":"Touili","full_name":"Touili, Tayssir"},{"full_name":"Cook, Byron","last_name":"Cook","first_name":"Byron"},{"first_name":"Paul","last_name":"Jackson","full_name":"Jackson, Paul"}],"file_date_updated":"2020-07-14T12:46:19Z","month":"07"},{"status":"public","language":[{"iso":"eng"}],"volume":69,"date_updated":"2021-12-21T12:26:50Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","quality_controlled":"1","year":"2010","month":"01","day":"15","page":"XII, 241","article_processing_charge":"No","title":"Computational Topology: An Introduction","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"first_name":"John","last_name":"Harer","full_name":"Harer, John"}],"main_file_link":[{"url":"https://www.ams.org/books/mbk/069/"}],"citation":{"short":"H. Edelsbrunner, J. Harer, Computational Topology: An Introduction, American Mathematical Society, 2010.","ama":"Edelsbrunner H, Harer J. <i>Computational Topology: An Introduction</i>. Vol 69. American Mathematical Society; 2010. doi:<a href=\"https://doi.org/10.1090/mbk/069\">10.1090/mbk/069</a>","ieee":"H. Edelsbrunner and J. Harer, <i>Computational Topology: An Introduction</i>, vol. 69. American Mathematical Society, 2010.","chicago":"Edelsbrunner, Herbert, and John Harer. <i>Computational Topology: An Introduction</i>. Vol. 69. American Mathematical Society, 2010. <a href=\"https://doi.org/10.1090/mbk/069\">https://doi.org/10.1090/mbk/069</a>.","ista":"Edelsbrunner H, Harer J. 2010. Computational Topology: An Introduction, American Mathematical Society, XII, 241p.","apa":"Edelsbrunner, H., &#38; Harer, J. (2010). <i>Computational Topology: An Introduction</i> (Vol. 69). American Mathematical Society. <a href=\"https://doi.org/10.1090/mbk/069\">https://doi.org/10.1090/mbk/069</a>","mla":"Edelsbrunner, Herbert, and John Harer. <i>Computational Topology: An Introduction</i>. Vol. 69, American Mathematical Society, 2010, doi:<a href=\"https://doi.org/10.1090/mbk/069\">10.1090/mbk/069</a>."},"abstract":[{"text":"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.","lang":"eng"}],"date_published":"2010-01-15T00:00:00Z","publication_identifier":{"eisbn":["978-1-4704-1208-1"],"isbn":["978-0-8218-4925-5"]},"related_material":{"link":[{"description":"available via catalog IST BookList","relation":"other","url":"https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=3289"}]},"doi":"10.1090/mbk/069","extern":"1","publist_id":"2258","intvolume":"        69","publication_status":"published","oa_version":"None","date_created":"2018-12-11T12:05:46Z","type":"book","_id":"3899","publisher":"American Mathematical Society"},{"citation":{"apa":"Bendich, P., Edelsbrunner, H., &#38; Kerber, M. (2010). Computing robustness and persistence for images. <i>IEEE Transactions of Visualization and Computer Graphics</i>. IEEE. <a href=\"https://doi.org/10.1109/TVCG.2010.139\">https://doi.org/10.1109/TVCG.2010.139</a>","mla":"Bendich, Paul, et al. “Computing Robustness and Persistence for Images.” <i>IEEE Transactions of Visualization and Computer Graphics</i>, vol. 16, no. 6, IEEE, 2010, pp. 1251–60, doi:<a href=\"https://doi.org/10.1109/TVCG.2010.139\">10.1109/TVCG.2010.139</a>.","ista":"Bendich P, Edelsbrunner H, Kerber M. 2010. Computing robustness and persistence for images. IEEE Transactions of Visualization and Computer Graphics. 16(6), 1251–1260.","chicago":"Bendich, Paul, Herbert Edelsbrunner, and Michael Kerber. “Computing Robustness and Persistence for Images.” <i>IEEE Transactions of Visualization and Computer Graphics</i>. IEEE, 2010. <a href=\"https://doi.org/10.1109/TVCG.2010.139\">https://doi.org/10.1109/TVCG.2010.139</a>.","ieee":"P. Bendich, H. Edelsbrunner, and M. Kerber, “Computing robustness and persistence for images,” <i>IEEE Transactions of Visualization and Computer Graphics</i>, vol. 16, no. 6. IEEE, pp. 1251–1260, 2010.","short":"P. Bendich, H. Edelsbrunner, M. Kerber, IEEE Transactions of Visualization and Computer Graphics 16 (2010) 1251–1260.","ama":"Bendich P, Edelsbrunner H, Kerber M. Computing robustness and persistence for images. <i>IEEE Transactions of Visualization and Computer Graphics</i>. 2010;16(6):1251-1260. doi:<a href=\"https://doi.org/10.1109/TVCG.2010.139\">10.1109/TVCG.2010.139</a>"},"abstract":[{"lang":"eng","text":"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."}],"scopus_import":"1","doi":"10.1109/TVCG.2010.139","has_accepted_license":"1","pubrep_id":"536","intvolume":"        16","publication_status":"published","corr_author":"1","type":"journal_article","publisher":"IEEE","language":[{"iso":"eng"}],"volume":16,"quality_controlled":"1","year":"2010","ddc":["000"],"month":"10","issue":"6","page":"1251 - 1260","file_date_updated":"2020-07-14T12:46:21Z","article_processing_charge":"No","isi":1,"external_id":{"isi":["000283758600045"]},"oa":1,"date_published":"2010-10-28T00:00:00Z","publication":"IEEE Transactions of Visualization and Computer Graphics","publist_id":"2253","file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:46:21Z","access_level":"open_access","file_id":"5262","creator":"system","file_name":"IST-2016-536-v1+1_2010-J-02-PersistenceforImages.pdf","relation":"main_file","file_size":721994,"date_created":"2018-12-12T10:17:10Z","checksum":"f6d813c04f4b46023cec6b9a17f15472"}],"oa_version":"Submitted Version","date_created":"2018-12-11T12:05:47Z","_id":"3901","status":"public","date_updated":"2025-09-30T09:30:22Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"HeEd"}],"day":"28","title":"Computing robustness and persistence for images","author":[{"full_name":"Bendich, Paul","first_name":"Paul","last_name":"Bendich","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"id":"36E4574A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael","first_name":"Michael","last_name":"Kerber"}]},{"publist_id":"2251","intvolume":"       277","publication":"Proceedings of the Royal Society of London Series B Biological Sciences","extern":"1","_id":"3904","publisher":"Royal Society, The","corr_author":"1","type":"journal_article","oa_version":"None","publication_status":"published","date_created":"2018-12-11T12:05:48Z","abstract":[{"text":"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.","lang":"eng"}],"citation":{"chicago":"Ugelvig, Line V, Daniel Kronauer, Alexandra Schrempf, Jürgen Heinze, and Sylvia Cremer. “Rapid Anti-Pathogen Response in Ant Societies Relies on High Genetic Diversity.” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. Royal Society, The, 2010. <a href=\"https://doi.org/10.1098/rspb.2010.0644\">https://doi.org/10.1098/rspb.2010.0644</a>.","ieee":"L. V. Ugelvig, D. Kronauer, A. Schrempf, J. Heinze, and S. Cremer, “Rapid anti-pathogen response in ant societies relies on high genetic diversity,” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>, vol. 277, no. 1695. Royal Society, The, pp. 2821–2828, 2010.","ista":"Ugelvig LV, Kronauer D, Schrempf A, Heinze J, Cremer S. 2010. Rapid anti-pathogen response in ant societies relies on high genetic diversity. Proceedings of the Royal Society of London Series B Biological Sciences. 277(1695), 2821–2828.","short":"L.V. Ugelvig, D. Kronauer, A. Schrempf, J. Heinze, S. Cremer, Proceedings of the Royal Society of London Series B Biological Sciences 277 (2010) 2821–2828.","ama":"Ugelvig LV, Kronauer D, Schrempf A, Heinze J, Cremer S. Rapid anti-pathogen response in ant societies relies on high genetic diversity. <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. 2010;277(1695):2821-2828. doi:<a href=\"https://doi.org/10.1098/rspb.2010.0644\">10.1098/rspb.2010.0644</a>","apa":"Ugelvig, L. V., Kronauer, D., Schrempf, A., Heinze, J., &#38; Cremer, S. (2010). Rapid anti-pathogen response in ant societies relies on high genetic diversity. <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. Royal Society, The. <a href=\"https://doi.org/10.1098/rspb.2010.0644\">https://doi.org/10.1098/rspb.2010.0644</a>","mla":"Ugelvig, Line V., et al. “Rapid Anti-Pathogen Response in Ant Societies Relies on High Genetic Diversity.” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>, vol. 277, no. 1695, Royal Society, The, 2010, pp. 2821–28, doi:<a href=\"https://doi.org/10.1098/rspb.2010.0644\">10.1098/rspb.2010.0644</a>."},"oa":1,"doi":"10.1098/rspb.2010.0644","date_published":"2010-05-05T00:00:00Z","page":"2821 - 2828","day":"05","issue":"1695","month":"05","author":[{"id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","full_name":"Ugelvig, Line V","orcid":"0000-0003-1832-8883","first_name":"Line V","last_name":"Ugelvig"},{"first_name":"Daniel","last_name":"Kronauer","full_name":"Kronauer, Daniel"},{"last_name":"Schrempf","first_name":"Alexandra","full_name":"Schrempf, Alexandra"},{"full_name":"Heinze, Jürgen","last_name":"Heinze","first_name":"Jürgen"},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia","first_name":"Sylvia","last_name":"Cremer"}],"title":"Rapid anti-pathogen response in ant societies relies on high genetic diversity","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2981995/"}],"volume":277,"date_updated":"2024-10-09T20:54:57Z","status":"public","language":[{"iso":"eng"}],"year":"2010","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publisher":"Nature Publishing Group","_id":"3956","type":"journal_article","date_created":"2018-12-11T12:06:06Z","publication_status":"published","publist_id":"2170","intvolume":"        11","extern":1,"publication":"Nature Reviews Molecular Cell Biology","doi":"10.1038/nrm2889","date_published":"2010-05-01T00:00:00Z","abstract":[{"text":"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.","lang":"eng"}],"citation":{"ama":"Nourshargh S, Hordijk P, Sixt MK. Breaching multiple barriers: leukocyte motility through venular walls and the interstitium. <i>Nature Reviews Molecular Cell Biology</i>. 2010;11(5):366-378. doi:<a href=\"https://doi.org/10.1038/nrm2889\">10.1038/nrm2889</a>","short":"S. Nourshargh, P. Hordijk, M.K. Sixt, Nature Reviews Molecular Cell Biology 11 (2010) 366–378.","ista":"Nourshargh S, Hordijk P, Sixt MK. 2010. Breaching multiple barriers: leukocyte motility through venular walls and the interstitium. Nature Reviews Molecular Cell Biology. 11(5), 366–378.","chicago":"Nourshargh, Sussan, Peter Hordijk, and Michael K Sixt. “Breaching Multiple Barriers: Leukocyte Motility through Venular Walls and the Interstitium.” <i>Nature Reviews Molecular Cell Biology</i>. Nature Publishing Group, 2010. <a href=\"https://doi.org/10.1038/nrm2889\">https://doi.org/10.1038/nrm2889</a>.","ieee":"S. Nourshargh, P. Hordijk, and M. K. Sixt, “Breaching multiple barriers: leukocyte motility through venular walls and the interstitium,” <i>Nature Reviews Molecular Cell Biology</i>, vol. 11, no. 5. Nature Publishing Group, pp. 366–378, 2010.","mla":"Nourshargh, Sussan, et al. “Breaching Multiple Barriers: Leukocyte Motility through Venular Walls and the Interstitium.” <i>Nature Reviews Molecular Cell Biology</i>, vol. 11, no. 5, Nature Publishing Group, 2010, pp. 366–78, doi:<a href=\"https://doi.org/10.1038/nrm2889\">10.1038/nrm2889</a>.","apa":"Nourshargh, S., Hordijk, P., &#38; Sixt, M. K. (2010). Breaching multiple barriers: leukocyte motility through venular walls and the interstitium. <i>Nature Reviews Molecular Cell Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nrm2889\">https://doi.org/10.1038/nrm2889</a>"},"title":"Breaching multiple barriers: leukocyte motility through venular walls and the interstitium","author":[{"last_name":"Nourshargh","first_name":"Sussan","full_name":"Nourshargh, Sussan"},{"full_name":"Hordijk, Peter L","first_name":"Peter","last_name":"Hordijk"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","last_name":"Sixt","full_name":"Michael Sixt","orcid":"0000-0002-6620-9179"}],"page":"366 - 378","day":"01","issue":"5","month":"05","year":"2010","quality_controlled":0,"date_updated":"2021-01-12T07:53:27Z","volume":11,"status":"public"},{"quality_controlled":0,"year":"2010","status":"public","volume":7,"date_updated":"2021-01-12T07:53:28Z","title":"Lifeact mice for studying F-actin dynamics","author":[{"full_name":"Riedl, Julia","last_name":"Riedl","first_name":"Julia"},{"last_name":"Flynn","first_name":"Kevin","full_name":"Flynn, Kevin C"},{"full_name":"Raducanu, Aurelia","first_name":"Aurelia","last_name":"Raducanu"},{"id":"397A88EE-F248-11E8-B48F-1D18A9856A87","full_name":"Florian Gärtner","orcid":"0000-0001-6120-3723","first_name":"Florian R","last_name":"Gärtner"},{"full_name":"Beck, Gisela","last_name":"Beck","first_name":"Gisela"},{"last_name":"Bosl","first_name":"Michael","full_name":"Bosl, Michael"},{"full_name":"Bradke, Frank","last_name":"Bradke","first_name":"Frank"},{"last_name":"Massberg","first_name":"Steffen","full_name":"Massberg, Steffen"},{"last_name":"Aszodi","first_name":"Attila","full_name":"Aszodi, Attila"},{"last_name":"Sixt","first_name":"Michael K","full_name":"Michael Sixt","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Roland","last_name":"Wedlich Söldner","full_name":"Wedlich-Söldner, Roland"}],"month":"03","page":"168 - 169","day":"01","issue":"3","date_published":"2010-03-01T00:00:00Z","doi":"10.1038/nmeth0310-168","citation":{"short":"J. Riedl, K. Flynn, A. Raducanu, F.R. Gärtner, G. Beck, M. Bosl, F. Bradke, S. Massberg, A. Aszodi, M.K. Sixt, R. Wedlich Söldner, Nature Methods 7 (2010) 168–169.","ama":"Riedl J, Flynn K, Raducanu A, et al. Lifeact mice for studying F-actin dynamics. <i>Nature Methods</i>. 2010;7(3):168-169. doi:<a href=\"https://doi.org/10.1038/nmeth0310-168\">10.1038/nmeth0310-168</a>","ieee":"J. Riedl <i>et al.</i>, “Lifeact mice for studying F-actin dynamics,” <i>Nature Methods</i>, vol. 7, no. 3. Nature Publishing Group, pp. 168–169, 2010.","chicago":"Riedl, Julia, Kevin Flynn, Aurelia Raducanu, Florian R Gärtner, Gisela Beck, Michael Bosl, Frank Bradke, et al. “Lifeact Mice for Studying F-Actin Dynamics.” <i>Nature Methods</i>. Nature Publishing Group, 2010. <a href=\"https://doi.org/10.1038/nmeth0310-168\">https://doi.org/10.1038/nmeth0310-168</a>.","ista":"Riedl J, Flynn K, Raducanu A, Gärtner FR, Beck G, Bosl M, Bradke F, Massberg S, Aszodi A, Sixt MK, Wedlich Söldner R. 2010. Lifeact mice for studying F-actin dynamics. Nature Methods. 7(3), 168–169.","apa":"Riedl, J., Flynn, K., Raducanu, A., Gärtner, F. R., Beck, G., Bosl, M., … Wedlich Söldner, R. (2010). Lifeact mice for studying F-actin dynamics. <i>Nature Methods</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nmeth0310-168\">https://doi.org/10.1038/nmeth0310-168</a>","mla":"Riedl, Julia, et al. “Lifeact Mice for Studying F-Actin Dynamics.” <i>Nature Methods</i>, vol. 7, no. 3, Nature Publishing Group, 2010, pp. 168–69, doi:<a href=\"https://doi.org/10.1038/nmeth0310-168\">10.1038/nmeth0310-168</a>."},"publication_status":"published","date_created":"2018-12-11T12:06:06Z","type":"journal_article","_id":"3957","publisher":"Nature Publishing Group","publication":"Nature Methods","extern":1,"intvolume":"         7","publist_id":"2171"},{"author":[{"full_name":"Mohan, Hema","first_name":"Hema","last_name":"Mohan"},{"full_name":"Krumbholz, Markus","last_name":"Krumbholz","first_name":"Markus"},{"last_name":"Sharma","first_name":"Rakhi","full_name":"Sharma, Rakhi"},{"first_name":"Sylvia","last_name":"Eisele","full_name":"Eisele, Sylvia"},{"full_name":"Junker, Andreas","first_name":"Andreas","last_name":"Junker"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","first_name":"Michael K","full_name":"Michael Sixt","orcid":"0000-0002-6620-9179"},{"full_name":"Newcombe, Jia","first_name":"Jia","last_name":"Newcombe"},{"full_name":"Wekerle, Hartmut","first_name":"Hartmut","last_name":"Wekerle"},{"first_name":"Reinhard","last_name":"Hohlfeld","full_name":"Hohlfeld, Reinhard"},{"full_name":"Lassmann, Hans","last_name":"Lassmann","first_name":"Hans"},{"last_name":"Meinl","first_name":"Edgar","full_name":"Meinl, Edgar"}],"title":"Extracellular matrix in multiple sclerosis lesions: fibrillar collagens, biglycan and decorin are upregulated and associated with infiltrating immune cells","month":"09","day":"01","page":"966 - 975","issue":"5","quality_controlled":0,"year":"2010","status":"public","date_updated":"2021-01-12T07:53:28Z","volume":20,"date_created":"2018-12-11T12:06:07Z","publication_status":"published","_id":"3958","publisher":"Wiley-Blackwell","type":"journal_article","publication":"Brain Pathology","extern":1,"publist_id":"2169","intvolume":"        20","date_published":"2010-09-01T00:00:00Z","doi":"10.1111/j.1750-3639.2010.00399.x","citation":{"mla":"Mohan, Hema, et al. “Extracellular Matrix in Multiple Sclerosis Lesions: Fibrillar Collagens, Biglycan and Decorin Are Upregulated and Associated with Infiltrating Immune Cells.” <i>Brain Pathology</i>, vol. 20, no. 5, Wiley-Blackwell, 2010, pp. 966–75, doi:<a href=\"https://doi.org/10.1111/j.1750-3639.2010.00399.x\">10.1111/j.1750-3639.2010.00399.x</a>.","apa":"Mohan, H., Krumbholz, M., Sharma, R., Eisele, S., Junker, A., Sixt, M. K., … Meinl, E. (2010). Extracellular matrix in multiple sclerosis lesions: fibrillar collagens, biglycan and decorin are upregulated and associated with infiltrating immune cells. <i>Brain Pathology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1750-3639.2010.00399.x\">https://doi.org/10.1111/j.1750-3639.2010.00399.x</a>","chicago":"Mohan, Hema, Markus Krumbholz, Rakhi Sharma, Sylvia Eisele, Andreas Junker, Michael K Sixt, Jia Newcombe, et al. “Extracellular Matrix in Multiple Sclerosis Lesions: Fibrillar Collagens, Biglycan and Decorin Are Upregulated and Associated with Infiltrating Immune Cells.” <i>Brain Pathology</i>. Wiley-Blackwell, 2010. <a href=\"https://doi.org/10.1111/j.1750-3639.2010.00399.x\">https://doi.org/10.1111/j.1750-3639.2010.00399.x</a>.","ieee":"H. Mohan <i>et al.</i>, “Extracellular matrix in multiple sclerosis lesions: fibrillar collagens, biglycan and decorin are upregulated and associated with infiltrating immune cells,” <i>Brain Pathology</i>, vol. 20, no. 5. Wiley-Blackwell, pp. 966–975, 2010.","ista":"Mohan H, Krumbholz M, Sharma R, Eisele S, Junker A, Sixt MK, Newcombe J, Wekerle H, Hohlfeld R, Lassmann H, Meinl E. 2010. Extracellular matrix in multiple sclerosis lesions: fibrillar collagens, biglycan and decorin are upregulated and associated with infiltrating immune cells. Brain Pathology. 20(5), 966–975.","ama":"Mohan H, Krumbholz M, Sharma R, et al. Extracellular matrix in multiple sclerosis lesions: fibrillar collagens, biglycan and decorin are upregulated and associated with infiltrating immune cells. <i>Brain Pathology</i>. 2010;20(5):966-975. doi:<a href=\"https://doi.org/10.1111/j.1750-3639.2010.00399.x\">10.1111/j.1750-3639.2010.00399.x</a>","short":"H. Mohan, M. Krumbholz, R. Sharma, S. Eisele, A. Junker, M.K. Sixt, J. Newcombe, H. Wekerle, R. Hohlfeld, H. Lassmann, E. Meinl, Brain Pathology 20 (2010) 966–975."},"abstract":[{"text":"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.","lang":"eng"}]},{"year":"2010","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":32,"date_updated":"2021-01-12T07:53:29Z","language":[{"iso":"eng"}],"status":"public","title":"Immobilized chemokine fields and soluble chemokine gradients cooperatively shape migration patterns of dendritic cells","author":[{"id":"F44D762E-4F9D-11E9-B64C-9EB26CEFFB5F","full_name":"Schumann, Kathrin","last_name":"Schumann","first_name":"Kathrin"},{"full_name":"Lämmermann, Tim","last_name":"Lämmermann","first_name":"Tim"},{"full_name":"Bruckner, Markus","last_name":"Bruckner","first_name":"Markus"},{"full_name":"Legler, Daniel","last_name":"Legler","first_name":"Daniel"},{"full_name":"Polleux, Julien","first_name":"Julien","last_name":"Polleux"},{"last_name":"Spatz","first_name":"Joachim","full_name":"Spatz, Joachim"},{"first_name":"Gerold","last_name":"Schuler","full_name":"Schuler, Gerold"},{"full_name":"Förster, Reinhold","first_name":"Reinhold","last_name":"Förster"},{"last_name":"Lutz","first_name":"Manfred","full_name":"Lutz, Manfred"},{"first_name":"Lydia","last_name":"Sorokin","full_name":"Sorokin, Lydia"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","last_name":"Sixt","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K"}],"day":"28","issue":"5","page":"703 - 713","month":"05","doi":"10.1016/j.immuni.2010.04.017","date_published":"2010-05-28T00:00:00Z","abstract":[{"lang":"eng","text":"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."}],"citation":{"apa":"Schumann, K., Lämmermann, T., Bruckner, M., Legler, D., Polleux, J., Spatz, J., … Sixt, M. K. (2010). Immobilized chemokine fields and soluble chemokine gradients cooperatively shape migration patterns of dendritic cells. <i>Immunity</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.immuni.2010.04.017\">https://doi.org/10.1016/j.immuni.2010.04.017</a>","mla":"Schumann, Kathrin, et al. “Immobilized Chemokine Fields and Soluble Chemokine Gradients Cooperatively Shape Migration Patterns of Dendritic Cells.” <i>Immunity</i>, vol. 32, no. 5, Cell Press, 2010, pp. 703–13, doi:<a href=\"https://doi.org/10.1016/j.immuni.2010.04.017\">10.1016/j.immuni.2010.04.017</a>.","short":"K. Schumann, T. Lämmermann, M. Bruckner, D. Legler, J. Polleux, J. Spatz, G. Schuler, R. Förster, M. Lutz, L. Sorokin, M.K. Sixt, Immunity 32 (2010) 703–713.","ama":"Schumann K, Lämmermann T, Bruckner M, et al. Immobilized chemokine fields and soluble chemokine gradients cooperatively shape migration patterns of dendritic cells. <i>Immunity</i>. 2010;32(5):703-713. doi:<a href=\"https://doi.org/10.1016/j.immuni.2010.04.017\">10.1016/j.immuni.2010.04.017</a>","chicago":"Schumann, Kathrin, Tim Lämmermann, Markus Bruckner, Daniel Legler, Julien Polleux, Joachim Spatz, Gerold Schuler, et al. “Immobilized Chemokine Fields and Soluble Chemokine Gradients Cooperatively Shape Migration Patterns of Dendritic Cells.” <i>Immunity</i>. Cell Press, 2010. <a href=\"https://doi.org/10.1016/j.immuni.2010.04.017\">https://doi.org/10.1016/j.immuni.2010.04.017</a>.","ista":"Schumann K, Lämmermann T, Bruckner M, Legler D, Polleux J, Spatz J, Schuler G, Förster R, Lutz M, Sorokin L, Sixt MK. 2010. Immobilized chemokine fields and soluble chemokine gradients cooperatively shape migration patterns of dendritic cells. Immunity. 32(5), 703–713.","ieee":"K. Schumann <i>et al.</i>, “Immobilized chemokine fields and soluble chemokine gradients cooperatively shape migration patterns of dendritic cells,” <i>Immunity</i>, vol. 32, no. 5. Cell Press, pp. 703–713, 2010."},"publisher":"Cell Press","_id":"3959","type":"journal_article","oa_version":"None","publication_status":"published","date_created":"2018-12-11T12:06:07Z","publist_id":"2168","intvolume":"        32","extern":"1","publication":"Immunity"},{"title":"MEK signalling tunes actin treadmilling for interstitial lymphocyte migration","author":[{"first_name":"Michele","last_name":"Weber","full_name":"Michele Weber","id":"3A3FC708-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-6620-9179","full_name":"Michael Sixt","last_name":"Sixt","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"}],"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/issues/190105/","open_access":"1"}],"month":"09","day":"01","page":"2861 - 2863","issue":"17","quality_controlled":0,"year":"2010","status":"public","volume":29,"date_updated":"2021-01-12T07:53:29Z","publication_status":"published","date_created":"2018-12-11T12:06:07Z","type":"journal_article","_id":"3960","publisher":"Wiley-Blackwell","publication":"EMBO Journal","extern":1,"publist_id":"2167","intvolume":"        29","date_published":"2010-09-01T00:00:00Z","doi":"10.1038/emboj.2010.183","citation":{"ista":"Weber M, Sixt MK. 2010. MEK signalling tunes actin treadmilling for interstitial lymphocyte migration. EMBO Journal. 29(17), 2861–2863.","ieee":"M. Weber and M. K. Sixt, “MEK signalling tunes actin treadmilling for interstitial lymphocyte migration,” <i>EMBO Journal</i>, vol. 29, no. 17. Wiley-Blackwell, pp. 2861–2863, 2010.","chicago":"Weber, Michele, and Michael K Sixt. “MEK Signalling Tunes Actin Treadmilling for Interstitial Lymphocyte Migration.” <i>EMBO Journal</i>. Wiley-Blackwell, 2010. <a href=\"https://doi.org/10.1038/emboj.2010.183\">https://doi.org/10.1038/emboj.2010.183</a>.","ama":"Weber M, Sixt MK. MEK signalling tunes actin treadmilling for interstitial lymphocyte migration. <i>EMBO Journal</i>. 2010;29(17):2861-2863. doi:<a href=\"https://doi.org/10.1038/emboj.2010.183\">10.1038/emboj.2010.183</a>","short":"M. Weber, M.K. Sixt, EMBO Journal 29 (2010) 2861–2863.","mla":"Weber, Michele, and Michael K. Sixt. “MEK Signalling Tunes Actin Treadmilling for Interstitial Lymphocyte Migration.” <i>EMBO Journal</i>, vol. 29, no. 17, Wiley-Blackwell, 2010, pp. 2861–63, doi:<a href=\"https://doi.org/10.1038/emboj.2010.183\">10.1038/emboj.2010.183</a>.","apa":"Weber, M., &#38; Sixt, M. K. (2010). MEK signalling tunes actin treadmilling for interstitial lymphocyte migration. <i>EMBO Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1038/emboj.2010.183\">https://doi.org/10.1038/emboj.2010.183</a>"},"oa":1,"abstract":[{"lang":"eng","text":"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."}]}]