[{"alternative_title":["EPTCS"],"title":"Discounting in games across time scales","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"EPTCS","file":[{"file_size":74598,"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"2bdf1e9103710555c6251ca4153cb5e9","file_id":"4937","creator":"system","date_created":"2018-12-12T10:12:19Z","file_name":"IST-2016-491-v1+1_1006.1403v1.pdf","date_updated":"2020-07-14T12:46:17Z"}],"author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Ritankar","last_name":"Majumdar","full_name":"Majumdar, Ritankar"}],"day":"08","quality_controlled":"1","volume":25,"external_id":{"arxiv":["1006.1403"]},"article_processing_charge":"No","pubrep_id":"491","publist_id":"2329","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"type":"conference","date_created":"2018-12-11T12:05:31Z","page":"22 - 29","has_accepted_license":"1","month":"06","oa":1,"status":"public","_id":"3852","year":"2010","arxiv":1,"abstract":[{"text":"We introduce two-level discounted games played by two players on a perfect-information stochastic game graph. The upper level game is a discounted game and the lower level game is an undiscounted reachability game. Two-level games model hierarchical and sequential decision making under uncertainty across different time scales. We show the existence of pure memoryless optimal strategies for both players and an ordered field property for such games. We show that if there is only one player (Markov decision processes), then the values can be computed in polynomial time. It follows that whether the value of a player is equal to a given rational constant in two-level discounted games can be decided in NP intersected coNP. We also give an alternate strategy improvement algorithm to compute the value. ","lang":"eng"}],"date_updated":"2023-09-04T11:47:04Z","citation":{"mla":"Chatterjee, Krishnendu, and Ritankar Majumdar. <i>Discounting in Games across Time Scales</i>. Vol. 25, EPTCS, 2010, pp. 22–29, doi:<a href=\"https://doi.org/10.4204/EPTCS.25.6\">10.4204/EPTCS.25.6</a>.","apa":"Chatterjee, K., &#38; Majumdar, R. (2010). Discounting in games across time scales (Vol. 25, pp. 22–29). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. <a href=\"https://doi.org/10.4204/EPTCS.25.6\">https://doi.org/10.4204/EPTCS.25.6</a>","ista":"Chatterjee K, Majumdar R. 2010. Discounting in games across time scales. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 22–29.","chicago":"Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting in Games across Time Scales,” 25:22–29. EPTCS, 2010. <a href=\"https://doi.org/10.4204/EPTCS.25.6\">https://doi.org/10.4204/EPTCS.25.6</a>.","short":"K. Chatterjee, R. Majumdar, in:, EPTCS, 2010, pp. 22–29.","ieee":"K. Chatterjee and R. Majumdar, “Discounting in games across time scales,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2010, vol. 25, pp. 22–29.","ama":"Chatterjee K, Majumdar R. Discounting in games across time scales. In: Vol 25. EPTCS; 2010:22-29. doi:<a href=\"https://doi.org/10.4204/EPTCS.25.6\">10.4204/EPTCS.25.6</a>"},"intvolume":"        25","ddc":["000"],"file_date_updated":"2020-07-14T12:46:17Z","scopus_import":"1","date_published":"2010-06-08T00:00:00Z","oa_version":"Published Version","doi":"10.4204/EPTCS.25.6","conference":{"start_date":"2010-06-17","name":"GandALF: Games, Automata, Logic, and Formal Verification","end_date":"2010-06-18","location":"Minori, Italy"},"publication_status":"published"},{"alternative_title":["LNCS"],"title":"Mean-payoff automaton expressions","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"5163","checksum":"4f753ae99d076553fb8733e2c8b390e2","creator":"system","access_level":"open_access","date_updated":"2020-07-14T12:46:17Z","file_name":"IST-2012-62-v1+1_Mean-payoff_automaton_expressions.pdf","date_created":"2018-12-12T10:15:41Z","relation":"main_file","content_type":"application/pdf","file_size":233260}],"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","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Rannou","first_name":"Philippe","full_name":"Rannou, Philippe"}],"day":"18","volume":6269,"quality_controlled":"1","publist_id":"2328","pubrep_id":"62","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"},{"_id":"HeEd"},{"_id":"ToHe"}],"type":"conference","date_created":"2018-12-11T12:05:31Z","page":"269 - 283","has_accepted_license":"1","ec_funded":1,"month":"11","oa":1,"status":"public","_id":"3853","year":"2010","date_updated":"2021-01-12T07:52:40Z","abstract":[{"lang":"eng","text":"Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on transitions that assign to each infinite path the long-run average of the transition weights. When the mode of branching of the automaton is deterministic, nondeterministic, or alternating, the corresponding class of quantitative languages is not robust as it is not closed under the pointwise operations of max, min, sum, and numerical complement. Nondeterministic and alternating mean-payoff automata are not decidable either, as the quantitative generalization of the problems of universality and language inclusion is undecidable. We introduce a new class of quantitative languages, defined by mean-payoff automaton expressions, which is robust and decidable: it is closed under the four pointwise operations, and we show that all decision problems are decidable for this class. Mean-payoff automaton expressions subsume deterministic meanpayoff automata, and we show that they have expressive power incomparable to nondeterministic and alternating mean-payoff automata. We also present for the first time an algorithm to compute distance between two quantitative languages, and in our case the quantitative languages are given as mean-payoff automaton expressions."}],"intvolume":"      6269","citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, Herbert Edelsbrunner, Thomas A Henzinger, and Philippe Rannou. “Mean-Payoff Automaton Expressions,” 6269:269–83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">https://doi.org/10.1007/978-3-642-15375-4_19</a>.","ista":"Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.","mla":"Chatterjee, Krishnendu, et al. <i>Mean-Payoff Automaton Expressions</i>. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–83, doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">10.1007/978-3-642-15375-4_19</a>.","apa":"Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T. A., &#38; Rannou, P. (2010). Mean-payoff automaton expressions (Vol. 6269, pp. 269–283). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">https://doi.org/10.1007/978-3-642-15375-4_19</a>","short":"K. Chatterjee, L. Doyen, H. Edelsbrunner, T.A. Henzinger, P. Rannou, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–283.","ama":"Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. Mean-payoff automaton expressions. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:269-283. doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">10.1007/978-3-642-15375-4_19</a>","ieee":"K. Chatterjee, L. Doyen, H. Edelsbrunner, T. A. Henzinger, and P. Rannou, “Mean-payoff automaton expressions,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 269–283."},"ddc":["000","005"],"file_date_updated":"2020-07-14T12:46:17Z","scopus_import":1,"date_published":"2010-11-18T00:00:00Z","oa_version":"Submitted Version","publication_status":"published","conference":{"start_date":"2010-08-31","name":"CONCUR: Concurrency Theory","end_date":"2010-09-03","location":"Paris, France"},"doi":"10.1007/978-3-642-15375-4_19"},{"_id":"3855","year":"2010","date_updated":"2023-02-23T12:24:22Z","abstract":[{"lang":"eng","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."}],"ec_funded":1,"month":"08","oa":1,"status":"public","date_published":"2010-08-01T00:00:00Z","oa_version":"Submitted Version","conference":{"start_date":"2010-08-23","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2010-08-27","location":"Brno, Czech Republic"},"publication_status":"published","doi":"10.1007/978-3-642-15155-2_24","intvolume":"      6281","citation":{"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>.","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>.","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.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2010, pp. 258–269.","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>","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."},"ddc":["004"],"file_date_updated":"2020-07-14T12:46:17Z","scopus_import":1,"file":[{"file_size":173948,"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_id":"5038","checksum":"b6c82ec82f194e5b0ab7c1c3800e4580","creator":"system","date_created":"2018-12-12T10:13:51Z","date_updated":"2020-07-14T12:46:17Z","file_name":"IST-2012-61-v1+1_Qualitative_analysis_of_partially-observable_Markov_Decision_Processes.pdf"}],"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","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373"}],"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"}],"day":"01","alternative_title":["LNCS"],"title":"Qualitative analysis of partially-observable Markov Decision Processes","publisher":"Springer","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"type":"conference","date_created":"2018-12-11T12:05:32Z","page":"258 - 269","has_accepted_license":"1","related_material":{"record":[{"id":"5395","status":"public","relation":"earlier_version"}]},"volume":6281,"quality_controlled":"1","publist_id":"2326","pubrep_id":"61"},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1006.0673v1"}],"scopus_import":1,"intvolume":"      6281","citation":{"short":"K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, in:, Springer, 2010, 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>","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.","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.","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>"},"publication_status":"published","conference":{"name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2010-08-23","location":"Brno, Czech Republic","end_date":"2010-08-27"},"doi":"10.1007/978-3-642-15155-2_23","oa_version":"Preprint","date_published":"2010-09-06T00:00:00Z","status":"public","oa":1,"month":"09","ec_funded":1,"date_updated":"2023-02-23T10:12:00Z","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. "}],"year":"2010","_id":"3856","publist_id":"2325","pubrep_id":"60","quality_controlled":"1","volume":6281,"related_material":{"record":[{"id":"1731","relation":"later_version","status":"public"}]},"page":"246 - 257","date_created":"2018-12-11T12:05:32Z","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"Springer","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Randomness for free","alternative_title":["LNCS"],"acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","day":"06","project":[{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"},{"call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"last_name":"Gimbert","first_name":"Hugo","full_name":"Gimbert, Hugo"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}]},{"abstract":[{"lang":"eng","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."}],"date_updated":"2021-01-12T07:52:43Z","year":"2010","_id":"3858","status":"public","oa":1,"month":"12","doi":"10.1007/978-3-642-16242-8_1","publication_status":"published","conference":{"end_date":"2010-10-15","location":"Yogyakarta, Indonesia","start_date":"2010-10-10","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning"},"oa_version":"Submitted Version","date_published":"2010-12-09T00:00:00Z","scopus_import":1,"file_date_updated":"2020-07-14T12:46:18Z","ddc":["000"],"citation":{"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>.","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>","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>.","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.","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.","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."},"intvolume":"      6397","day":"09","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"}],"file":[{"date_created":"2020-05-19T16:29:04Z","file_name":"2010_LPAR_Chatterjee.pdf","date_updated":"2020-07-14T12:46:18Z","access_level":"open_access","checksum":"770e86e5d78c56fddb4786a8da7ef126","creator":"dernst","file_id":"7872","file_size":142836,"content_type":"application/pdf","relation":"main_file"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","title":"The complexity of partial-observation parity games","alternative_title":["LNCS"],"has_accepted_license":"1","date_created":"2018-12-11T12:05:33Z","page":"1 - 14","type":"conference","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"article_processing_charge":"No","publist_id":"2323","volume":6397,"quality_controlled":"1"},{"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"language":[{"iso":"eng"}],"type":"conference","date_created":"2018-12-11T12:05:34Z","page":"505 - 516","has_accepted_license":"1","quality_controlled":"1","volume":8,"article_processing_charge":"No","pubrep_id":"59","publist_id":"2321","file":[{"date_created":"2018-12-12T10:15:27Z","file_name":"IST-2012-59-v1+1_Generalized_mean-payoff_and_energy_games.pdf","date_updated":"2020-07-14T12:46:18Z","access_level":"open_access","file_id":"5147","creator":"system","checksum":"1caabd6319b979927208117a41192637","file_size":178278,"relation":"main_file","content_type":"application/pdf"},{"creator":"system","file_id":"5148","checksum":"3a59759ceeacdb5b578f3803d5e6769b","access_level":"open_access","date_updated":"2020-07-14T12:46:18Z","file_name":"IST-2016-59-v2+1_2_1_.pdf","date_created":"2018-12-12T10:15:28Z","relation":"main_file","content_type":"application/pdf","file_size":477976}],"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Raskin, Jean","last_name":"Raskin","first_name":"Jean"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"day":"13","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","alternative_title":["LIPIcs"],"title":"Generalized mean-payoff and energy games","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2010-12-13T00:00:00Z","oa_version":"Submitted Version","doi":"10.4230/LIPIcs.FSTTCS.2010.505","publication_status":"published","conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","start_date":"2010-12-15","location":"Chennai, India","end_date":"2010-12-18"},"intvolume":"         8","citation":{"short":"K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–516.","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.","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>","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>.","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.","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>","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>."},"ddc":["005"],"scopus_import":1,"file_date_updated":"2020-07-14T12:46:18Z","_id":"3860","year":"2010","abstract":[{"lang":"eng","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."}],"date_updated":"2021-01-12T07:52:44Z","month":"12","oa":1,"status":"public"},{"day":"01","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"last_name":"Piterman","first_name":"Nir","full_name":"Piterman, Nir"}],"file":[{"file_size":189120,"content_type":"application/pdf","relation":"main_file","access_level":"open_access","creator":"system","file_id":"4911","checksum":"13bff93f3c2a014e2908145a4517f177","date_created":"2018-12-12T10:11:54Z","date_updated":"2020-07-14T12:46:18Z","file_name":"IST-2012-56-v1+1_Strategy_logic.pdf"}],"publisher":"Elsevier","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","title":"Strategy logic","has_accepted_license":"1","date_created":"2018-12-11T12:05:34Z","page":"677 - 693","publication":"Information and Computation","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publist_id":"2317","pubrep_id":"56","volume":208,"quality_controlled":"1","related_material":{"record":[{"id":"3884","status":"public","relation":"earlier_version"}]},"date_updated":"2023-02-23T11:46:57Z","abstract":[{"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).","lang":"eng"}],"issue":"6","year":"2010","_id":"3861","status":"public","oa":1,"month":"06","publication_status":"published","doi":"10.1016/j.ic.2009.07.004","oa_version":"Submitted Version","date_published":"2010-06-01T00:00:00Z","scopus_import":1,"file_date_updated":"2020-07-14T12:46:18Z","ddc":["000","004"],"citation":{"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>.","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>.","ista":"Chatterjee K, Henzinger TA, Piterman N. 2010. Strategy logic. Information and Computation. 208(6), 677–693.","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.","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>","short":"K. Chatterjee, T.A. Henzinger, N. Piterman, Information and Computation 208 (2010) 677–693."},"intvolume":"       208"},{"language":[{"iso":"eng"}],"type":"journal_article","date_created":"2018-12-11T12:05:34Z","publication":"ACM Transactions on Computational Logic (TOCL)","has_accepted_license":"1","quality_controlled":"1","volume":11,"publist_id":"2318","article_processing_charge":"No","pubrep_id":"57","file":[{"file_size":169136,"relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:16:41Z","file_name":"IST-2012-57-v1+1_Quantitative_languages.pdf","date_updated":"2020-07-14T12:46:18Z","access_level":"open_access","checksum":"f2e50bbd6871fba0aec30bd9625a1ee7","file_id":"5230","creator":"system"}],"project":[{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"}],"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"}],"day":"01","extern":"1","title":"Quantitative languages","publisher":"ACM","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2010-07-01T00:00:00Z","oa_version":"Submitted Version","publication_status":"published","doi":"10.1145/1805950.1805953","intvolume":"        11","citation":{"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>.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2010. Quantitative languages. ACM Transactions on Computational Logic (TOCL). 11(4), 23.","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>","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>.","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>","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."},"ddc":["004"],"scopus_import":"1","file_date_updated":"2020-07-14T12:46:18Z","_id":"3862","article_number":"23","year":"2010","date_updated":"2022-03-21T08:20:03Z","abstract":[{"text":"Quantitative generalizations of classical languages, which assign to each word a real number instead of a Boolean value, have applications in modeling resource-constrained computation. We use weighted automata (finite automata with transition weights) to define several natural classes of quantitative languages over finite and infinite words; in particular, the real value of an infinite run is computed as the maximum, limsup, liminf, limit average, or discounted sum of the transition weights. We define the classical decision problems of automata theory (emptiness, universality, language inclusion, and language equivalence) in the quantitative setting and study their computational complexity. As the decidability of 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.","lang":"eng"}],"issue":"4","ec_funded":1,"month":"07","oa":1,"status":"public"},{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publisher":"Elsevier","title":"Strategy construction for parity games with imperfect information","day":"01","author":[{"first_name":"Dietmar","last_name":"Berwanger","full_name":"Berwanger, Dietmar"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"De Wulf","first_name":"Martin","full_name":"De Wulf, Martin"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"project":[{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"}],"file":[{"file_size":287496,"content_type":"application/pdf","relation":"main_file","date_created":"2018-12-12T10:17:44Z","file_name":"IST-2012-58-v1+1_Strategy_construction_for_parity_games_with_imperfect_information.pdf","date_updated":"2020-07-14T12:46:18Z","access_level":"open_access","file_id":"5300","creator":"system","checksum":"29d146e4f8049dbb7f80bbf7ea3700ed"}],"pubrep_id":"58","publist_id":"2319","quality_controlled":"1","volume":208,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3880"}]},"has_accepted_license":"1","publication":"Information and Computation","page":"1206 - 1220","date_created":"2018-12-11T12:05:35Z","type":"journal_article","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"language":[{"iso":"eng"}],"status":"public","oa":1,"month":"10","ec_funded":1,"issue":"10","abstract":[{"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.","lang":"eng"}],"date_updated":"2023-02-23T11:46:47Z","year":"2010","_id":"3863","file_date_updated":"2020-07-14T12:46:18Z","scopus_import":1,"ddc":["005"],"citation":{"short":"D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, Information and Computation 208 (2010) 1206–1220.","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.","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>","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>.","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>.","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."},"intvolume":"       208","doi":"10.1016/j.ic.2009.09.006","publication_status":"published","oa_version":"Submitted Version","date_published":"2010-10-01T00:00:00Z"},{"title":"Measuring and synthesizing systems in probabilistic environments","publisher":"Springer","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"day":"09","acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"full_name":"Jobstmann, Barbara","first_name":"Barbara","last_name":"Jobstmann"},{"last_name":"Singh","first_name":"Rohit","full_name":"Singh, Rohit"}],"publist_id":"2313","related_material":{"record":[{"relation":"later_version","status":"public","id":"1856"}]},"quality_controlled":"1","volume":6174,"page":"380 - 395","date_created":"2018-12-11T12:05:35Z","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"type":"conference","oa":1,"status":"public","month":"07","year":"2010","date_updated":"2023-02-23T10:17:28Z","abstract":[{"lang":"eng","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."}],"_id":"3864","scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1004.0739","open_access":"1"}],"intvolume":"      6174","citation":{"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>.","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>.","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>","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.","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.","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>"},"publication_status":"published","conference":{"name":"CAV: Computer Aided Verification","start_date":"201-07-15","location":"Edinburgh, United Kingdom","end_date":"2010-07-19"},"doi":"10.1007/978-3-642-14295-6_34","date_published":"2010-07-09T00:00:00Z","oa_version":"Preprint"},{"day":"01","file":[{"date_updated":"2020-07-14T12:46:19Z","file_name":"IST-2012-54-v1+1_Robustness_in_the_presence_of_liveness.pdf","date_created":"2018-12-12T10:16:52Z","checksum":"9d204611c8d7855bed8134f8708a0010","file_id":"5243","creator":"system","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_size":213083}],"author":[{"last_name":"Bloem","first_name":"Roderick","full_name":"Bloem, Roderick"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Greimel, Karin","last_name":"Greimel","first_name":"Karin"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"}],"project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems"}],"title":"Robustness in the presence of liveness","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","alternative_title":["LNCS"],"page":"410 - 424","date_created":"2018-12-11T12:05:36Z","has_accepted_license":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"language":[{"iso":"eng"}],"type":"conference","pubrep_id":"54","publist_id":"2310","editor":[{"full_name":"Touili, Tayssir","last_name":"Touili","first_name":"Tayssir"},{"first_name":"Byron","last_name":"Cook","full_name":"Cook, Byron"},{"full_name":"Jackson, Paul","first_name":"Paul","last_name":"Jackson"}],"volume":6174,"quality_controlled":"1","year":"2010","abstract":[{"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.","lang":"eng"}],"date_updated":"2021-01-12T07:52:47Z","_id":"3866","oa":1,"status":"public","ec_funded":1,"month":"07","doi":"10.1007/978-3-642-14295-6_36","publication_status":"published","conference":{"location":"Edinburgh, UK","end_date":"2010-07-19","name":"CAV: Computer Aided Verification","start_date":"2010-07-15"},"date_published":"2010-07-01T00:00:00Z","oa_version":"Submitted Version","ddc":["004"],"scopus_import":1,"file_date_updated":"2020-07-14T12:46:19Z","intvolume":"      6174","citation":{"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.","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.","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>","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>.","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>.","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>","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."}},{"day":"30","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)"},"project":[{"call_identifier":"FP7","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373"},{"name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"file":[{"access_level":"open_access","creator":"system","checksum":"0243da726476817f2ea33b48b78be696","file_id":"5312","date_created":"2018-12-12T10:17:54Z","file_name":"IST-2012-55-v1+1_Expressiveness_Closure_Properties_Quantitative_Languages.pdf","date_updated":"2020-07-14T12:46:19Z","file_size":216598,"content_type":"application/pdf","relation":"main_file"},{"file_size":302416,"relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:17:55Z","date_updated":"2020-07-14T12:46:19Z","file_name":"IST-2016-55-v2+1_1007.4018.pdf","access_level":"open_access","file_id":"5313","creator":"system","checksum":"5e512b8503a9cb263de26331c4ee9cf2"}],"publisher":"International Federation of Computational Logic","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","title":"Expressiveness and closure properties for quantitative languages","has_accepted_license":"1","page":"1 - 23","date_created":"2018-12-11T12:05:36Z","publication":"Logical Methods in Computer Science","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publist_id":"2311","pubrep_id":"504","quality_controlled":"1","volume":6,"related_material":{"record":[{"id":"4540","relation":"earlier_version","status":"public"}]},"date_updated":"2023-02-23T12:15:42Z","issue":"3","abstract":[{"lang":"eng","text":"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."}],"year":"2010","_id":"3867","status":"public","oa":1,"month":"08","ec_funded":1,"publication_status":"published","doi":"10.2168/LMCS-6(3:10)2010","oa_version":"Published Version","date_published":"2010-08-30T00:00:00Z","file_date_updated":"2020-07-14T12:46:19Z","scopus_import":1,"ddc":["000","004"],"intvolume":"         6","citation":{"short":"K. Chatterjee, L. Doyen, T.A. Henzinger, Logical Methods in Computer Science 6 (2010) 1–23.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure properties for quantitative languages,” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3. International Federation of Computational Logic, pp. 1–23, 2010.","ama":"Chatterjee K, Doyen L, Henzinger TA. Expressiveness and closure properties for quantitative languages. <i>Logical Methods in Computer Science</i>. 2010;6(3):1-23. doi:<a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">10.2168/LMCS-6(3:10)2010</a>","mla":"Chatterjee, Krishnendu, et al. “Expressiveness and Closure Properties for Quantitative Languages.” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3, International Federation of Computational Logic, 2010, pp. 1–23, doi:<a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">10.2168/LMCS-6(3:10)2010</a>.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2010). Expressiveness and closure properties for quantitative languages. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">https://doi.org/10.2168/LMCS-6(3:10)2010</a>","ista":"Chatterjee K, Doyen L, Henzinger TA. 2010. Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. 6(3), 1–23.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2010. <a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">https://doi.org/10.2168/LMCS-6(3:10)2010</a>."}},{"volume":6,"quality_controlled":"1","related_material":{"record":[{"id":"3504","relation":"earlier_version","status":"public"}]},"pubrep_id":"370","publist_id":"2312","type":"journal_article","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","publication":"Logical Methods in Computer Science","page":"1 - 27","date_created":"2018-12-11T12:05:36Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"International Federation of Computational Logic","title":"Algorithms for game metrics","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"full_name":"De Alfaro, Luca","first_name":"Luca","last_name":"De Alfaro"},{"full_name":"Majumdar, Ritankar","first_name":"Ritankar","last_name":"Majumdar"},{"full_name":"Raman, Vishwanath","last_name":"Raman","first_name":"Vishwanath"}],"file":[{"date_updated":"2020-07-14T12:46:19Z","file_name":"IST-2015-370-v1+1_0809.4326.pdf","date_created":"2018-12-12T10:08:11Z","creator":"system","file_id":"4671","checksum":"a18988135fef3016c93808ecb15b55f5","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_size":346527}],"day":"01","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)"},"intvolume":"         6","citation":{"short":"K. Chatterjee, L. De Alfaro, R. Majumdar, V. Raman, Logical Methods in Computer Science 6 (2010) 1–27.","ama":"Chatterjee K, De Alfaro L, Majumdar R, Raman V. Algorithms for game metrics. <i>Logical Methods in Computer Science</i>. 2010;6(3):1-27. doi:<a href=\"https://doi.org/10.2168/LMCS-6(3:13)2010\">10.2168/LMCS-6(3:13)2010</a>","ieee":"K. Chatterjee, L. De Alfaro, R. Majumdar, and V. Raman, “Algorithms for game metrics,” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3. International Federation of Computational Logic, pp. 1–27, 2010.","ista":"Chatterjee K, De Alfaro L, Majumdar R, Raman V. 2010. Algorithms for game metrics. Logical Methods in Computer Science. 6(3), 1–27.","mla":"Chatterjee, Krishnendu, et al. “Algorithms for Game Metrics.” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3, International Federation of Computational Logic, 2010, pp. 1–27, doi:<a href=\"https://doi.org/10.2168/LMCS-6(3:13)2010\">10.2168/LMCS-6(3:13)2010</a>.","apa":"Chatterjee, K., De Alfaro, L., Majumdar, R., &#38; Raman, V. (2010). Algorithms for game metrics. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-6(3:13)2010\">https://doi.org/10.2168/LMCS-6(3:13)2010</a>","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, Ritankar Majumdar, and Vishwanath Raman. “Algorithms for Game Metrics.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2010. <a href=\"https://doi.org/10.2168/LMCS-6(3:13)2010\">https://doi.org/10.2168/LMCS-6(3:13)2010</a>."},"file_date_updated":"2020-07-14T12:46:19Z","scopus_import":1,"ddc":["000"],"oa_version":"Published Version","date_published":"2010-09-01T00:00:00Z","doi":"10.2168/LMCS-6(3:13)2010","publication_status":"published","month":"09","status":"public","oa":1,"_id":"3868","abstract":[{"lang":"eng","text":"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"}],"issue":"3","date_updated":"2023-02-23T11:30:18Z","year":"2010"},{"author":[{"last_name":"Bendich","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","first_name":"Paul","full_name":"Bendich, Paul"},{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"full_name":"Kerber, Michael","first_name":"Michael","orcid":"0000-0002-8030-9299","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","last_name":"Kerber"}],"file":[{"relation":"main_file","content_type":"application/pdf","file_size":721994,"file_id":"5262","checksum":"f6d813c04f4b46023cec6b9a17f15472","creator":"system","access_level":"open_access","file_name":"IST-2016-536-v1+1_2010-J-02-PersistenceforImages.pdf","date_updated":"2020-07-14T12:46:21Z","date_created":"2018-12-12T10:17:10Z"}],"day":"28","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE","title":"Computing robustness and persistence for images","type":"journal_article","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","publication":"IEEE Transactions of Visualization and Computer Graphics","page":"1251 - 1260","date_created":"2018-12-11T12:05:47Z","quality_controlled":"1","volume":16,"pubrep_id":"536","publist_id":"2253","_id":"3901","issue":"6","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."}],"date_updated":"2021-01-12T07:53:04Z","year":"2010","month":"10","status":"public","oa":1,"oa_version":"Submitted Version","date_published":"2010-10-28T00:00:00Z","doi":"10.1109/TVCG.2010.139","publication_status":"published","intvolume":"        16","citation":{"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>","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.","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>.","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>.","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>","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."},"scopus_import":1,"file_date_updated":"2020-07-14T12:46:21Z","ddc":["000"]},{"doi":"10.1098/rspb.2010.0644","publication_status":"published","publication":"Proceedings of the Royal Society of London Series B Biological Sciences","page":"2821 - 2828","date_created":"2018-12-11T12:05:48Z","type":"journal_article","oa_version":"None","date_published":"2010-05-05T00:00:00Z","language":[{"iso":"eng"}],"publist_id":"2251","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2981995/","open_access":"1"}],"intvolume":"       277","volume":277,"citation":{"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>.","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.","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>.","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.","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.","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>"},"issue":"1695","abstract":[{"lang":"eng","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."}],"date_updated":"2021-01-12T07:53:05Z","extern":"1","year":"2010","day":"05","author":[{"full_name":"Ugelvig, Line V","first_name":"Line V","orcid":"0000-0003-1832-8883","last_name":"Ugelvig","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kronauer","first_name":"Daniel","full_name":"Kronauer, Daniel"},{"first_name":"Alexandra","last_name":"Schrempf","full_name":"Schrempf, Alexandra"},{"last_name":"Heinze","first_name":"Jürgen","full_name":"Heinze, Jürgen"},{"full_name":"Cremer, Sylvia","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia","orcid":"0000-0002-2193-3868"}],"_id":"3904","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Royal Society, The","status":"public","oa":1,"title":"Rapid anti-pathogen response in ant societies relies on high genetic diversity","month":"05"},{"_id":"3960","author":[{"id":"3A3FC708-F248-11E8-B48F-1D18A9856A87","last_name":"Weber","first_name":"Michele","full_name":"Michele Weber"},{"last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","orcid":"0000-0002-6620-9179","full_name":"Michael Sixt"}],"extern":1,"year":"2010","day":"01","abstract":[{"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.","lang":"eng"}],"issue":"17","date_updated":"2021-01-12T07:53:29Z","month":"09","oa":1,"title":"MEK signalling tunes actin treadmilling for interstitial lymphocyte migration","status":"public","publisher":"Wiley-Blackwell","date_published":"2010-09-01T00:00:00Z","type":"journal_article","publication":"EMBO Journal","date_created":"2018-12-11T12:06:07Z","page":"2861 - 2863","doi":"10.1038/emboj.2010.183","publication_status":"published","volume":29,"intvolume":"        29","quality_controlled":0,"citation":{"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>","ista":"Weber M, Sixt MK. 2010. MEK signalling tunes actin treadmilling for interstitial lymphocyte migration. EMBO Journal. 29(17), 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>.","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>.","short":"M. Weber, M.K. Sixt, EMBO Journal 29 (2010) 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.","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>"},"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/issues/190105/"}],"publist_id":"2167"},{"author":[{"first_name":"Ekaterina","id":"41DB591E-F248-11E8-B48F-1D18A9856A87","last_name":"Papusheva","full_name":"Papusheva, Ekaterina"},{"full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg"}],"pmid":1,"day":"18","publisher":"Wiley-Blackwell","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Spatial organization of adhesion: force-dependent regulation and function in tissue morphogenesis","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"Bio"},{"_id":"CaHe"}],"date_created":"2018-12-11T12:07:17Z","page":"2753 - 2768","publication":"EMBO Journal","external_id":{"pmid":["20717145"]},"volume":29,"quality_controlled":"1","publist_id":"1962","acknowledged_ssus":[{"_id":"Bio"}],"_id":"4157","date_updated":"2021-01-12T07:54:55Z","issue":"16","abstract":[{"lang":"eng","text":"Integrin- and cadherin-mediated adhesion is central for cell and tissue morphogenesis, allowing cells and tissues to change shape without loosing integrity. Studies predominantly in cell culture showed that mechanosensation through adhesion structures is achieved by force-mediated modulation of their molecular composition. The specific molecular composition of adhesion sites in turn determines their signalling activity and dynamic reorganization. Here, we will review how adhesion sites respond to mecanical stimuli, and how spatially and temporally regulated signalling from different adhesion sites controls cell migration and tissue morphogenesis."}],"year":"2010","month":"08","status":"public","oa":1,"oa_version":"Submitted Version","date_published":"2010-08-18T00:00:00Z","publication_status":"published","doi":"10.1038/emboj.2010.182","citation":{"ieee":"E. Papusheva and C.-P. J. Heisenberg, “Spatial organization of adhesion: force-dependent regulation and function in tissue morphogenesis,” <i>EMBO Journal</i>, vol. 29, no. 16. Wiley-Blackwell, pp. 2753–2768, 2010.","ama":"Papusheva E, Heisenberg C-PJ. Spatial organization of adhesion: force-dependent regulation and function in tissue morphogenesis. <i>EMBO Journal</i>. 2010;29(16):2753-2768. doi:<a href=\"https://doi.org/10.1038/emboj.2010.182\">10.1038/emboj.2010.182</a>","short":"E. Papusheva, C.-P.J. Heisenberg, EMBO Journal 29 (2010) 2753–2768.","apa":"Papusheva, E., &#38; Heisenberg, C.-P. J. (2010). Spatial organization of adhesion: force-dependent regulation and function in tissue morphogenesis. <i>EMBO Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1038/emboj.2010.182\">https://doi.org/10.1038/emboj.2010.182</a>","ista":"Papusheva E, Heisenberg C-PJ. 2010. Spatial organization of adhesion: force-dependent regulation and function in tissue morphogenesis. EMBO Journal. 29(16), 2753–2768.","mla":"Papusheva, Ekaterina, and Carl-Philipp J. Heisenberg. “Spatial Organization of Adhesion: Force-Dependent Regulation and Function in Tissue Morphogenesis.” <i>EMBO Journal</i>, vol. 29, no. 16, Wiley-Blackwell, 2010, pp. 2753–68, doi:<a href=\"https://doi.org/10.1038/emboj.2010.182\">10.1038/emboj.2010.182</a>.","chicago":"Papusheva, Ekaterina, and Carl-Philipp J Heisenberg. “Spatial Organization of Adhesion: Force-Dependent Regulation and Function in Tissue Morphogenesis.” <i>EMBO Journal</i>. Wiley-Blackwell, 2010. <a href=\"https://doi.org/10.1038/emboj.2010.182\">https://doi.org/10.1038/emboj.2010.182</a>."},"intvolume":"        29","scopus_import":1,"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2924654/","open_access":"1"}]},{"department":[{"_id":"NiBa"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Electronic Journal of Probability","date_created":"2018-12-11T12:07:48Z","page":"162 - 216","has_accepted_license":"1","quality_controlled":"1","volume":15,"pubrep_id":"369","publist_id":"1863","file":[{"access_level":"open_access","file_id":"5140","checksum":"bab577546dd4e8f882e9a9dd645cd01e","creator":"system","date_created":"2018-12-12T10:15:21Z","file_name":"IST-2015-369-v1+1_741-2535-1-PB.pdf","date_updated":"2020-07-14T12:46:26Z","file_size":450171,"relation":"main_file","content_type":"application/pdf"}],"author":[{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Etheridge, Alison","last_name":"Etheridge","first_name":"Alison"},{"last_name":"Véber","first_name":"Amandine","full_name":"Véber, Amandine"}],"day":"03","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"A new model for evolution in a spatial continuum","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Institute of Mathematical Statistics","date_published":"2010-02-03T00:00:00Z","oa_version":"Published Version","doi":"10.1214/EJP.v15-741","publication_status":"published","citation":{"mla":"Barton, Nicholas H., et al. “A New Model for Evolution in a Spatial Continuum.” <i>Electronic Journal of Probability</i>, vol. 15, no. 7, Institute of Mathematical Statistics, 2010, pp. 162–216, doi:<a href=\"https://doi.org/10.1214/EJP.v15-741\">10.1214/EJP.v15-741</a>.","apa":"Barton, N. H., Etheridge, A., &#38; Véber, A. (2010). A new model for evolution in a spatial continuum. <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/EJP.v15-741\">https://doi.org/10.1214/EJP.v15-741</a>","ista":"Barton NH, Etheridge A, Véber A. 2010. A new model for evolution in a spatial continuum. Electronic Journal of Probability. 15(7), 162–216.","chicago":"Barton, Nicholas H, Alison Etheridge, and Amandine Véber. “A New Model for Evolution in a Spatial Continuum.” <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics, 2010. <a href=\"https://doi.org/10.1214/EJP.v15-741\">https://doi.org/10.1214/EJP.v15-741</a>.","ieee":"N. H. Barton, A. Etheridge, and A. Véber, “A new model for evolution in a spatial continuum,” <i>Electronic Journal of Probability</i>, vol. 15, no. 7. Institute of Mathematical Statistics, pp. 162–216, 2010.","ama":"Barton NH, Etheridge A, Véber A. A new model for evolution in a spatial continuum. <i>Electronic Journal of Probability</i>. 2010;15(7):162-216. doi:<a href=\"https://doi.org/10.1214/EJP.v15-741\">10.1214/EJP.v15-741</a>","short":"N.H. Barton, A. Etheridge, A. Véber, Electronic Journal of Probability 15 (2010) 162–216."},"intvolume":"        15","ddc":["576"],"scopus_import":1,"file_date_updated":"2020-07-14T12:46:26Z","_id":"4243","year":"2010","abstract":[{"lang":"eng","text":"We investigate a new model for populations evolving in a spatial continuum. This model can be thought of as a spatial version of the Lambda-Fleming-Viot process. It explicitly incorporates both small scale reproduction events and large scale extinction-recolonisation events. The lineages ancestral to a sample from a population evolving according to this model can be described in terms of a spatial version of the Lambda-coalescent. Using a technique of Evans (1997), we prove existence and uniqueness in law for the model. We then investigate the asymptotic behaviour of the genealogy of a finite number of individuals sampled uniformly at random (or more generally `far enough apart') from a two-dimensional torus of sidelength L as L tends to infinity. Under appropriate conditions (and on a suitable timescale) we can obtain as limiting genealogical processes a Kingman coalescent, a more general Lambda-coalescent or a system of coalescing Brownian motions (with a non-local coalescence mechanism)."}],"issue":"7","date_updated":"2021-01-12T07:55:34Z","month":"02","oa":1,"status":"public"},{"ddc":["020"],"file_date_updated":"2020-07-14T12:46:27Z","citation":{"chicago":"Bergmann, Julia, and Patrick Danowski. “Ist Bibliothek 2.0 Überhaupt Noch Relevant? – Eine Einleitung in Das Handbuch.” In <i>Handbuch Bibliothek 2.0</i>, edited by Julia Bergmann and Patrick Danowski, 5–20. Bibliotheks- Und Informationspraxis 41. De Gruyter, 2010. <a href=\"https://doi.org/10.1515/9783110232103\">https://doi.org/10.1515/9783110232103</a>.","apa":"Bergmann, J., &#38; Danowski, P. (2010). Ist Bibliothek 2.0 überhaupt noch relevant? – Eine Einleitung in das Handbuch. In J. Bergmann &#38; P. Danowski (Eds.), <i>Handbuch Bibliothek 2.0</i> (pp. 5–20). De Gruyter. <a href=\"https://doi.org/10.1515/9783110232103\">https://doi.org/10.1515/9783110232103</a>","ista":"Bergmann J, Danowski P. 2010.Ist Bibliothek 2.0 überhaupt noch relevant? – Eine Einleitung in das Handbuch. In: Handbuch Bibliothek 2.0. , 5–20.","mla":"Bergmann, Julia, and Patrick Danowski. “Ist Bibliothek 2.0 Überhaupt Noch Relevant? – Eine Einleitung in Das Handbuch.” <i>Handbuch Bibliothek 2.0</i>, edited by Julia Bergmann and Patrick Danowski, De Gruyter, 2010, pp. 5–20, doi:<a href=\"https://doi.org/10.1515/9783110232103\">10.1515/9783110232103</a>.","ieee":"J. Bergmann and P. Danowski, “Ist Bibliothek 2.0 überhaupt noch relevant? – Eine Einleitung in das Handbuch,” in <i>Handbuch Bibliothek 2.0</i>, J. Bergmann and P. Danowski, Eds. De Gruyter, 2010, pp. 5–20.","ama":"Bergmann J, Danowski P. Ist Bibliothek 2.0 überhaupt noch relevant? – Eine Einleitung in das Handbuch. In: Bergmann J, Danowski P, eds. <i>Handbuch Bibliothek 2.0</i>. Bibliotheks- und Informationspraxis 41. De Gruyter; 2010:5-20. doi:<a href=\"https://doi.org/10.1515/9783110232103\">10.1515/9783110232103</a>","short":"J. Bergmann, P. Danowski, in:, J. Bergmann, P. Danowski (Eds.), Handbuch Bibliothek 2.0, De Gruyter, 2010, pp. 5–20."},"doi":"10.1515/9783110232103","publication_status":"published","date_published":"2010-09-23T00:00:00Z","oa_version":"Published Version","oa":1,"status":"public","month":"09","year":"2010","abstract":[{"lang":"ger","text":"Mit diesem Buch möchten wir einen Überblick der aktuellen Diskussion zum Thema Bibliothek 2.0 geben und den Stand der tatsächlichen Umsetzung der Web 2.0-Ansätze in deutschsprachigen Bibliotheken beleuchten. An dieser Stelle ist die Frage erlaubt, warum es zu einer Zeit, in der es bereits die ersten \"Web 3.0\"- Konferenzen gibt, eines Handbuches der Bibliothek 2.0 noch bedarf. Und warum es überhaupt ein deutschsprachiges Handbuch zur Bibliothek 2.0 braucht, wo es doch bereits verschiedenste Publikationen zu diesem Thema aus anderen Ländern, insbesondere des angloamerikanischen Raums gibt. Ist dazu nicht bereits alles gesagt?"}],"date_updated":"2021-01-12T07:56:15Z","_id":"4339","pubrep_id":"12","publist_id":"1235","quality_controlled":"1","editor":[{"full_name":"Bergmann, Julia","first_name":"Julia","last_name":"Bergmann"},{"last_name":"Danowski","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6026-4409","first_name":"Patrick","full_name":"Danowski, Patrick"}],"publication":"Handbuch Bibliothek 2.0","date_created":"2018-12-11T12:08:21Z","page":"5 - 20","has_accepted_license":"1","department":[{"_id":"E-Lib"}],"language":[{"iso":"eng"}],"type":"book_chapter","title":"Ist Bibliothek 2.0 überhaupt noch relevant? – Eine Einleitung in das Handbuch","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publisher":"De Gruyter","series_title":"Bibliotheks- und Informationspraxis 41","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"23","file":[{"file_size":567580,"relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:15:06Z","date_updated":"2020-07-14T12:46:27Z","file_name":"IST-2012-12-v1+1_9783110232103.5.pdf","access_level":"open_access","checksum":"d42cedd48fffa85d75046f396a309fc3","creator":"system","file_id":"5123"}],"author":[{"full_name":"Bergmann, Julia","first_name":"Julia","last_name":"Bergmann"},{"last_name":"Danowski","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6026-4409","first_name":"Patrick","full_name":"Danowski, Patrick"}]},{"month":"06","oa":1,"title":"Open bibliographic data","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Elsevier","status":"public","_id":"4340","file":[{"file_size":94982,"content_type":"application/pdf","relation":"main_file","date_created":"2018-12-12T10:15:01Z","file_name":"IST-2012-51-v1+1_149-danowski-en.pdf","date_updated":"2020-07-14T12:46:27Z","access_level":"open_access","creator":"system","checksum":"7061756135333d73b26a84526fa654f5","file_id":"5118"}],"author":[{"full_name":"Danowski, Patrick","first_name":"Patrick","orcid":"0000-0002-6026-4409","last_name":"Danowski","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87"}],"year":"2010","extern":"1","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"10","abstract":[{"text":"More and more libraries starting semantic web projects. The question about the license of the data\r\nis not discussed or the discussion is deferred to the end of project. in this paper is discussed why\r\nthe question of the license is so important in context of the semantic web that is should be one of the\r\nfirst aspects in a semantic web project. Also it will be shown why a public domain weaver is the\r\nonly solution that fulfill the the special requirements of the semantic web and that guaranties the\r\nreuseablitly of semantic library data for a sustainability of the projects. ","lang":"eng"}],"date_updated":"2020-07-14T23:07:19Z","citation":{"chicago":"Danowski, Patrick. <i>Open Bibliographic Data</i>. <i>European Library Automation Group (ELAG) 2010</i>. Elsevier, 2010.","ista":"Danowski P. 2010. Open bibliographic data, Elsevier,p.","apa":"Danowski, P. (2010). <i>Open bibliographic data</i>. <i>European Library Automation Group (ELAG) 2010</i>. Elsevier.","mla":"Danowski, Patrick. “Open Bibliographic Data.” <i>European Library Automation Group (ELAG) 2010</i>, Elsevier, 2010.","ieee":"P. Danowski, <i>Open bibliographic data</i>. Elsevier, 2010.","ama":"Danowski P. <i>Open Bibliographic Data</i>. Elsevier; 2010.","short":"P. Danowski, Open Bibliographic Data, Elsevier, 2010."},"ddc":["020"],"main_file_link":[{"url":"http://www.slideshare.net/PatrickD/open-bibliographic-data-elag2010","open_access":"1"}],"publist_id":"1234","file_date_updated":"2020-07-14T12:46:27Z","date_published":"2010-06-10T00:00:00Z","language":[{"iso":"eng"}],"oa_version":"None","type":"other_academic_publication","publication":"European Library Automation Group (ELAG) 2010","date_created":"2018-12-11T12:08:21Z","publication_status":"published","has_accepted_license":"1","conference":{"name":"ELAG: European Library Automation Group"}}]