[{"volume":25,"file":[{"relation":"main_file","checksum":"2bdf1e9103710555c6251ca4153cb5e9","file_size":74598,"creator":"system","file_name":"IST-2016-491-v1+1_1006.1403v1.pdf","date_created":"2018-12-12T10:12:19Z","content_type":"application/pdf","file_id":"4937","access_level":"open_access","date_updated":"2020-07-14T12:46:17Z"}],"date_updated":"2023-09-04T11:47:04Z","page":"22 - 29","quality_controlled":"1","date_created":"2018-12-11T12:05:31Z","year":"2010","scopus_import":"1","article_processing_charge":"No","file_date_updated":"2020-07-14T12:46:17Z","type":"conference","arxiv":1,"language":[{"iso":"eng"}],"publisher":"EPTCS","doi":"10.4204/EPTCS.25.6","ddc":["000"],"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Majumdar","full_name":"Majumdar, Ritankar","first_name":"Ritankar"}],"publist_id":"2329","date_published":"2010-06-08T00:00:00Z","oa_version":"Published Version","external_id":{"arxiv":["1006.1403"]},"conference":{"end_date":"2010-06-18","location":"Minori, Italy","start_date":"2010-06-17","name":"GandALF: Games, Automata, Logic, and Formal Verification"},"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"}],"status":"public","citation":{"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>","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.","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>.","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>.","ista":"Chatterjee K, Majumdar R. 2010. Discounting in games across time scales. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 22–29.","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>"},"intvolume":"        25","has_accepted_license":"1","day":"08","oa":1,"title":"Discounting in games across time scales","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","_id":"3852","pubrep_id":"491","alternative_title":["EPTCS"],"department":[{"_id":"KrCh"}]},{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"3853","month":"11","title":"Mean-payoff automaton expressions","oa":1,"publication_status":"published","department":[{"_id":"KrCh"},{"_id":"HeEd"},{"_id":"ToHe"}],"alternative_title":["LNCS"],"pubrep_id":"62","ec_funded":1,"status":"public","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."}],"day":"18","has_accepted_license":"1","intvolume":"      6269","citation":{"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>","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.","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>","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.","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>."},"doi":"10.1007/978-3-642-15375-4_19","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:17Z","type":"conference","oa_version":"Submitted Version","conference":{"start_date":"2010-08-31","name":"CONCUR: Concurrency Theory","end_date":"2010-09-03","location":"Paris, France"},"date_published":"2010-11-18T00:00:00Z","publist_id":"2328","ddc":["000","005"],"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rannou","full_name":"Rannou, Philippe","first_name":"Philippe"}],"page":"269 - 283","quality_controlled":"1","date_created":"2018-12-11T12:05:31Z","year":"2010","date_updated":"2021-01-12T07:52:40Z","project":[{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems","call_identifier":"FP7"}],"volume":6269,"file":[{"file_id":"5163","content_type":"application/pdf","date_created":"2018-12-12T10:15:41Z","access_level":"open_access","date_updated":"2020-07-14T12:46:17Z","file_name":"IST-2012-62-v1+1_Mean-payoff_automaton_expressions.pdf","file_size":233260,"creator":"system","relation":"main_file","checksum":"4f753ae99d076553fb8733e2c8b390e2"}],"scopus_import":1},{"status":"public","abstract":[{"lang":"eng","text":"Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the environment. The evolution of the system depends on the decisions of both players. The specification for the system is usually given as an ω-regular language L over paths and Eve’s goal is to ensure that the play belongs to L irrespective of Adam’s behaviour. The classical notion of winning strategies fails to capture several interesting scenarios. For example, strong fairness (Streett) conditions are specified by a number of request-grant pairs and require every pair that is requested infinitely often to be granted infinitely often: Eve might win just by preventing Adam from making any new request, but a “better” strategy would allow Adam to make as many requests as possible and still ensure fairness. To address such questions, we introduce the notion of obliging games, where Eve has to ensure a strong condition Φ, while always allowing Adam to satisfy a weak condition Ψ. We present a linear time reduction of obliging games with two Muller conditions Φ and Ψ to classical Muller games. We consider obliging Streett games and show they are co-NP complete, and show a natural quantitative optimisation problem for obliging Streett games is in FNP. We also show how obliging games can provide new and interesting semantics for multi-player games."}],"volume":6269,"quality_controlled":"1","page":"284 - 296","year":"2010","date_created":"2018-12-11T12:05:32Z","date_updated":"2021-01-12T07:52:41Z","scopus_import":1,"intvolume":"      6269","citation":{"short":"K. Chatterjee, F. Horn, C. Löding, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 284–296.","ama":"Chatterjee K, Horn F, Löding C. Obliging games. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:284-296. doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_20\">10.1007/978-3-642-15375-4_20</a>","ista":"Chatterjee K, Horn F, Löding C. 2010. Obliging games. CONCUR: Concurrency Theory, LNCS, vol. 6269, 284–296.","apa":"Chatterjee, K., Horn, F., &#38; Löding, C. (2010). Obliging games (Vol. 6269, pp. 284–296). 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_20\">https://doi.org/10.1007/978-3-642-15375-4_20</a>","chicago":"Chatterjee, Krishnendu, Florian Horn, and Christof Löding. “Obliging Games,” 6269:284–96. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_20\">https://doi.org/10.1007/978-3-642-15375-4_20</a>.","ieee":"K. Chatterjee, F. Horn, and C. Löding, “Obliging games,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 284–296.","mla":"Chatterjee, Krishnendu, et al. <i>Obliging Games</i>. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 284–96, doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_20\">10.1007/978-3-642-15375-4_20</a>."},"day":"08","title":"Obliging games","language":[{"iso":"eng"}],"publication_status":"published","type":"conference","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","month":"09","_id":"3854","doi":"10.1007/978-3-642-15375-4_20","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","alternative_title":["LNCS"],"publist_id":"2327","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Horn, Florian","first_name":"Florian","last_name":"Horn","id":"37327ACE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Christof","full_name":"Löding, Christof","last_name":"Löding"}],"conference":{"start_date":"2010-08-31","name":"CONCUR: Concurrency Theory","end_date":"2010-09-03","location":"Paris, France"},"oa_version":"None","date_published":"2010-09-08T00:00:00Z","department":[{"_id":"KrCh"}]},{"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"ddc":["004"],"publist_id":"2326","date_published":"2010-08-01T00:00:00Z","conference":{"location":"Brno, Czech Republic","end_date":"2010-08-27","name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2010-08-23"},"oa_version":"Submitted Version","type":"conference","file_date_updated":"2020-07-14T12:46:17Z","language":[{"iso":"eng"}],"publisher":"Springer","doi":"10.1007/978-3-642-15155-2_24","scopus_import":1,"file":[{"access_level":"open_access","date_updated":"2020-07-14T12:46:17Z","date_created":"2018-12-12T10:13:51Z","file_id":"5038","content_type":"application/pdf","file_name":"IST-2012-61-v1+1_Qualitative_analysis_of_partially-observable_Markov_Decision_Processes.pdf","creator":"system","file_size":173948,"checksum":"b6c82ec82f194e5b0ab7c1c3800e4580","relation":"main_file"}],"volume":6281,"project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","grant_number":"214373","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"date_updated":"2023-02-23T12:24:22Z","year":"2010","date_created":"2018-12-11T12:05:32Z","quality_controlled":"1","page":"258 - 269","pubrep_id":"61","alternative_title":["LNCS"],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","title":"Qualitative analysis of partially-observable Markov Decision Processes","related_material":{"record":[{"id":"5395","relation":"earlier_version","status":"public"}]},"oa":1,"_id":"3855","month":"08","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","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>","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.","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>.","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.","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>"},"intvolume":"      6281","has_accepted_license":"1","day":"01","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"}],"status":"public","ec_funded":1},{"publist_id":"2325","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"full_name":"Gimbert, Hugo","first_name":"Hugo","last_name":"Gimbert"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"}],"oa_version":"Preprint","conference":{"name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2010-08-23","location":"Brno, Czech Republic","end_date":"2010-08-27"},"date_published":"2010-09-06T00:00:00Z","language":[{"iso":"eng"}],"type":"conference","doi":"10.1007/978-3-642-15155-2_23","publisher":"Springer","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1006.0673v1"}],"scopus_import":1,"volume":6281,"date_created":"2018-12-11T12:05:32Z","year":"2010","quality_controlled":"1","page":"246 - 257","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","call_identifier":"FP7"},{"call_identifier":"FP7","grant_number":"214373","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"date_updated":"2023-02-23T10:12:00Z","pubrep_id":"60","alternative_title":["LNCS"],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","publication_status":"published","related_material":{"record":[{"status":"public","relation":"later_version","id":"1731"}]},"title":"Randomness for free","oa":1,"month":"09","_id":"3856","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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>.","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.","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>","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."},"intvolume":"      6281","day":"06","status":"public","abstract":[{"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. ","lang":"eng"}],"ec_funded":1},{"scopus_import":1,"date_created":"2018-12-11T12:05:33Z","year":"2010","quality_controlled":"1","page":"1 - 16","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","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"}],"date_updated":"2023-02-23T12:24:14Z","volume":6252,"conference":{"start_date":"2010-09-21","name":"ATVA: Automated Technology for Verification and Analysis","end_date":"2010-09-24","location":"Singapore, Singapore"},"oa_version":"None","date_published":"2010-10-12T00:00:00Z","publist_id":"2324","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"}],"doi":"10.1007/978-3-642-15643-4_1","publisher":"Springer","language":[{"iso":"eng"}],"type":"conference","day":"12","citation":{"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>.","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.","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>","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>.","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.","short":"K. Chatterjee, T.A. Henzinger, in:, Springer, 2010, pp. 1–16.","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>"},"intvolume":"      6252","ec_funded":1,"status":"public","abstract":[{"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.","lang":"eng"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"pubrep_id":"28","alternative_title":["LNCS"],"_id":"3857","month":"10","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publication_status":"published","title":"Probabilistic Automata on infinite words: decidability and undecidability results","related_material":{"record":[{"id":"5392","relation":"earlier_version","status":"public"}]}},{"publisher":"Springer","doi":"10.1007/978-3-642-16242-8_1","type":"conference","file_date_updated":"2020-07-14T12:46:18Z","language":[{"iso":"eng"}],"date_published":"2010-12-09T00:00:00Z","oa_version":"Submitted Version","conference":{"end_date":"2010-10-15","location":"Yogyakarta, Indonesia","start_date":"2010-10-10","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning"},"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"}],"ddc":["000"],"publist_id":"2323","date_updated":"2021-01-12T07:52:43Z","date_created":"2018-12-11T12:05:33Z","year":"2010","quality_controlled":"1","page":"1 - 14","file":[{"relation":"main_file","checksum":"770e86e5d78c56fddb4786a8da7ef126","file_size":142836,"creator":"dernst","file_name":"2010_LPAR_Chatterjee.pdf","file_id":"7872","content_type":"application/pdf","date_created":"2020-05-19T16:29:04Z","access_level":"open_access","date_updated":"2020-07-14T12:46:18Z"}],"volume":6397,"article_processing_charge":"No","scopus_import":1,"_id":"3858","month":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","title":"The complexity of partial-observation parity games","oa":1,"department":[{"_id":"KrCh"}],"alternative_title":["LNCS"],"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"}],"status":"public","has_accepted_license":"1","day":"09","intvolume":"      6397","citation":{"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.","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.","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>.","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.","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>"}},{"conference":{"location":"Klosterneuburg, Austria","end_date":"2010-09-10","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","start_date":"2010-09-08"},"oa_version":"None","date_published":"2010-09-20T00:00:00Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publist_id":"2322","alternative_title":["LNCS"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"09","_id":"3859","doi":"10.1007/978-3-642-15297-9","publisher":"Springer","related_material":{"link":[{"relation":"other","url":"https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=12721","description":"eBook available via IST BookList"}]},"title":"Formal modeling and analysis of timed systems","publication_status":"published","language":[{"iso":"eng"}],"type":"conference_editor","day":"20","intvolume":"      6246","citation":{"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>","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.","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>.","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>"},"quality_controlled":"1","year":"2010","date_created":"2018-12-11T12:05:33Z","date_updated":"2019-11-14T08:42:42Z","editor":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"status":"public","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."}],"volume":6246},{"has_accepted_license":"1","day":"13","citation":{"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>.","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>","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.","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>.","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.","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>"},"intvolume":"         8","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."}],"status":"public","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"pubrep_id":"59","alternative_title":["LIPIcs"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3860","month":"12","title":"Generalized mean-payoff and energy games","oa":1,"publication_status":"published","tmp":{"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)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)"},"article_processing_charge":"No","scopus_import":1,"date_updated":"2021-01-12T07:52:44Z","page":"505 - 516","quality_controlled":"1","date_created":"2018-12-11T12:05:34Z","year":"2010","volume":8,"file":[{"date_updated":"2020-07-14T12:46:18Z","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:15:27Z","file_id":"5147","file_name":"IST-2012-59-v1+1_Generalized_mean-payoff_and_energy_games.pdf","creator":"system","file_size":178278,"checksum":"1caabd6319b979927208117a41192637","relation":"main_file"},{"relation":"main_file","checksum":"3a59759ceeacdb5b578f3803d5e6769b","file_size":477976,"creator":"system","file_name":"IST-2016-59-v2+1_2_1_.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:15:28Z","file_id":"5148","date_updated":"2020-07-14T12:46:18Z","access_level":"open_access"}],"date_published":"2010-12-13T00:00:00Z","oa_version":"Submitted Version","conference":{"start_date":"2010-12-15","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","end_date":"2010-12-18","location":"Chennai, India"},"ddc":["005"],"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"last_name":"Raskin","full_name":"Raskin, Jean","first_name":"Jean"}],"publist_id":"2321","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","doi":"10.4230/LIPIcs.FSTTCS.2010.505","file_date_updated":"2020-07-14T12:46:18Z","type":"conference","language":[{"iso":"eng"}]},{"intvolume":"       208","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>.","ista":"Chatterjee K, Henzinger TA, Piterman N. 2010. Strategy logic. Information and Computation. 208(6), 677–693.","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>","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.","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>"},"has_accepted_license":"1","day":"01","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)."}],"status":"public","pubrep_id":"56","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","related_material":{"record":[{"id":"3884","relation":"earlier_version","status":"public"}]},"oa":1,"title":"Strategy logic","_id":"3861","month":"06","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"file":[{"file_size":189120,"creator":"system","relation":"main_file","checksum":"13bff93f3c2a014e2908145a4517f177","file_id":"4911","date_created":"2018-12-12T10:11:54Z","content_type":"application/pdf","date_updated":"2020-07-14T12:46:18Z","access_level":"open_access","file_name":"IST-2012-56-v1+1_Strategy_logic.pdf"}],"volume":208,"date_updated":"2023-02-23T11:46:57Z","year":"2010","date_created":"2018-12-11T12:05:34Z","quality_controlled":"1","page":"677 - 693","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"last_name":"Piterman","full_name":"Piterman, Nir","first_name":"Nir"}],"ddc":["000","004"],"publist_id":"2317","issue":"6","publication":"Information and Computation","date_published":"2010-06-01T00:00:00Z","oa_version":"Submitted Version","type":"journal_article","file_date_updated":"2020-07-14T12:46:18Z","language":[{"iso":"eng"}],"publisher":"Elsevier","doi":"10.1016/j.ic.2009.07.004"},{"day":"01","has_accepted_license":"1","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>.","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.","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>.","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.","short":"D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, Information and Computation 208 (2010) 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>"},"intvolume":"       208","ec_funded":1,"status":"public","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."}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"pubrep_id":"58","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","month":"10","_id":"3863","oa":1,"related_material":{"record":[{"id":"3880","relation":"earlier_version","status":"public"}]},"title":"Strategy construction for parity games with imperfect information","publication_status":"published","scopus_import":1,"quality_controlled":"1","page":"1206 - 1220","date_created":"2018-12-11T12:05:35Z","year":"2010","date_updated":"2023-02-23T11:46:47Z","project":[{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"}],"volume":208,"file":[{"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","date_created":"2018-12-12T10:17:44Z","content_type":"application/pdf","checksum":"29d146e4f8049dbb7f80bbf7ea3700ed","relation":"main_file","creator":"system","file_size":287496}],"oa_version":"Submitted Version","date_published":"2010-10-01T00:00:00Z","publication":"Information and Computation","publist_id":"2319","issue":"10","ddc":["005"],"author":[{"first_name":"Dietmar","full_name":"Berwanger, Dietmar","last_name":"Berwanger"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"De Wulf","full_name":"De Wulf, Martin","first_name":"Martin"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"}],"doi":"10.1016/j.ic.2009.09.006","publisher":"Elsevier","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:18Z","type":"journal_article"},{"date_updated":"2023-02-23T10:17:28Z","date_created":"2018-12-11T12:05:35Z","year":"2010","quality_controlled":"1","page":"380 - 395","volume":6174,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1004.0739"}],"scopus_import":1,"publisher":"Springer","doi":"10.1007/978-3-642-14295-6_34","type":"conference","language":[{"iso":"eng"}],"date_published":"2010-07-09T00:00:00Z","conference":{"name":"CAV: Computer Aided Verification","start_date":"201-07-15","location":"Edinburgh, United Kingdom","end_date":"2010-07-19"},"oa_version":"Preprint","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"last_name":"Jobstmann","full_name":"Jobstmann, Barbara","first_name":"Barbara"},{"full_name":"Singh, Rohit","first_name":"Rohit","last_name":"Singh"}],"publist_id":"2313","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"}],"status":"public","day":"09","intvolume":"      6174","citation":{"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.","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.","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>.","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>","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2010, pp. 380–395."},"month":"07","_id":"3864","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","related_material":{"record":[{"id":"1856","status":"public","relation":"later_version"}]},"oa":1,"title":"Measuring and synthesizing systems in probabilistic environments","acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"alternative_title":["LNCS"]},{"status":"public","volume":6013,"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"}],"year":"2010","date_created":"2018-12-11T12:05:35Z","page":"293 - 307","quality_controlled":"1","editor":[{"first_name":"David","full_name":"Rosenblum, David","last_name":"Rosenblum"},{"first_name":"Gabriele","full_name":"Taenzer, Gabriele","last_name":"Taenzer"}],"date_updated":"2021-01-12T07:52:47Z","intvolume":"      6013","citation":{"ieee":"K. Chatterjee, L. De Alfaro, V. Raman, and C. Sánchez, “Analyzing the impact of change in multi-threaded programs,” presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus, 2010, vol. 6013, pp. 293–307.","mla":"Chatterjee, Krishnendu, et al. <i>Analyzing the Impact of Change in Multi-Threaded Programs</i>. Edited by David Rosenblum and Gabriele Taenzer, 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>.","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, Vishwanath Raman, and César Sánchez. “Analyzing the Impact of Change in Multi-Threaded Programs.” edited by David Rosenblum and Gabriele Taenzer, 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>.","ista":"Chatterjee K, De Alfaro L, Raman V, Sánchez C. 2010. Analyzing the impact of change in multi-threaded programs. FASE: Fundamental Approaches To Software Engineering, LNCS, vol. 6013, 293–307.","apa":"Chatterjee, K., De Alfaro, L., Raman, V., &#38; Sánchez, C. (2010). Analyzing the impact of change in multi-threaded programs. In D. Rosenblum &#38; G. Taenzer (Eds.) (Vol. 6013, pp. 293–307). Presented at the FASE: Fundamental Approaches To Software Engineering, 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>","ama":"Chatterjee K, De Alfaro L, Raman V, Sánchez C. Analyzing the impact of change in multi-threaded programs. In: Rosenblum D, Taenzer G, eds. 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>","short":"K. Chatterjee, L. De Alfaro, V. Raman, C. Sánchez, in:, D. Rosenblum, G. Taenzer (Eds.), Springer, 2010, pp. 293–307."},"scopus_import":1,"day":"21","publication_status":"published","language":[{"iso":"eng"}],"title":"Analyzing the impact of change in multi-threaded programs","type":"conference","_id":"3865","doi":"10.1007/978-3-642-12029-9_21","month":"04","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","publist_id":"2315","alternative_title":["LNCS"],"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Luca","full_name":"De Alfaro, Luca","last_name":"De Alfaro"},{"first_name":"Vishwanath","full_name":"Raman, Vishwanath","last_name":"Raman"},{"full_name":"Sánchez, César","first_name":"César","last_name":"Sánchez"}],"conference":{"end_date":"2010-03-28","location":"Paphos, Cyprus","start_date":"2010-03-20","name":"FASE: Fundamental Approaches To Software Engineering"},"oa_version":"None","department":[{"_id":"KrCh"}],"date_published":"2010-04-21T00:00:00Z"},{"citation":{"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.","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.","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>.","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>.","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."},"intvolume":"      6174","day":"01","has_accepted_license":"1","status":"public","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"}],"editor":[{"last_name":"Touili","first_name":"Tayssir","full_name":"Touili, Tayssir"},{"first_name":"Byron","full_name":"Cook, Byron","last_name":"Cook"},{"last_name":"Jackson","full_name":"Jackson, Paul","first_name":"Paul"}],"ec_funded":1,"pubrep_id":"54","alternative_title":["LNCS"],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","oa":1,"title":"Robustness in the presence of liveness","month":"07","_id":"3866","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"file":[{"file_name":"IST-2012-54-v1+1_Robustness_in_the_presence_of_liveness.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:19Z","file_id":"5243","content_type":"application/pdf","date_created":"2018-12-12T10:16:52Z","checksum":"9d204611c8d7855bed8134f8708a0010","relation":"main_file","creator":"system","file_size":213083}],"volume":6174,"year":"2010","date_created":"2018-12-11T12:05:36Z","quality_controlled":"1","page":"410 - 424","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems"}],"date_updated":"2021-01-12T07:52:47Z","publist_id":"2310","author":[{"full_name":"Bloem, Roderick","first_name":"Roderick","last_name":"Bloem"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Greimel","first_name":"Karin","full_name":"Greimel, Karin"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Jobstmann","first_name":"Barbara","full_name":"Jobstmann, Barbara"}],"ddc":["004"],"conference":{"end_date":"2010-07-19","location":"Edinburgh, UK","start_date":"2010-07-15","name":"CAV: Computer Aided Verification"},"oa_version":"Submitted Version","date_published":"2010-07-01T00:00:00Z","language":[{"iso":"eng"}],"type":"conference","file_date_updated":"2020-07-14T12:46:19Z","doi":"10.1007/978-3-642-14295-6_36","publisher":"Springer"},{"citation":{"short":"K. Chatterjee, L. Doyen, T.A. Henzinger, Logical Methods in Computer Science 6 (2010) 1–23.","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>","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>.","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>.","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."},"intvolume":"         6","day":"30","has_accepted_license":"1","status":"public","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."}],"ec_funded":1,"pubrep_id":"504","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","related_material":{"record":[{"id":"4540","relation":"earlier_version","status":"public"}]},"title":"Expressiveness and closure properties for quantitative languages","oa":1,"month":"08","_id":"3867","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"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)"},"file":[{"file_name":"IST-2012-55-v1+1_Expressiveness_Closure_Properties_Quantitative_Languages.pdf","date_created":"2018-12-12T10:17:54Z","content_type":"application/pdf","file_id":"5312","date_updated":"2020-07-14T12:46:19Z","access_level":"open_access","relation":"main_file","checksum":"0243da726476817f2ea33b48b78be696","file_size":216598,"creator":"system"},{"file_size":302416,"creator":"system","relation":"main_file","checksum":"5e512b8503a9cb263de26331c4ee9cf2","file_id":"5313","content_type":"application/pdf","date_created":"2018-12-12T10:17:55Z","date_updated":"2020-07-14T12:46:19Z","access_level":"open_access","file_name":"IST-2016-55-v2+1_1007.4018.pdf"}],"volume":6,"date_created":"2018-12-11T12:05:36Z","year":"2010","quality_controlled":"1","page":"1 - 23","project":[{"call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"}],"date_updated":"2023-02-23T12:15:42Z","publication":"Logical Methods in Computer Science","publist_id":"2311","issue":"3","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"}],"ddc":["000","004"],"oa_version":"Published Version","date_published":"2010-08-30T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","file_date_updated":"2020-07-14T12:46:19Z","doi":"10.2168/LMCS-6(3:10)2010","publisher":"International Federation of Computational Logic"},{"publisher":"International Federation of Computational Logic","doi":"10.2168/LMCS-6(3:13)2010","type":"journal_article","file_date_updated":"2020-07-14T12:46:19Z","language":[{"iso":"eng"}],"date_published":"2010-09-01T00:00:00Z","oa_version":"Published Version","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"full_name":"De Alfaro, Luca","first_name":"Luca","last_name":"De Alfaro"},{"first_name":"Ritankar","full_name":"Majumdar, Ritankar","last_name":"Majumdar"},{"last_name":"Raman","full_name":"Raman, Vishwanath","first_name":"Vishwanath"}],"ddc":["000"],"publication":"Logical Methods in Computer Science","publist_id":"2312","issue":"3","date_updated":"2023-02-23T11:30:18Z","date_created":"2018-12-11T12:05:36Z","year":"2010","quality_controlled":"1","page":"1 - 27","file":[{"creator":"system","file_size":346527,"checksum":"a18988135fef3016c93808ecb15b55f5","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:46:19Z","file_id":"4671","content_type":"application/pdf","date_created":"2018-12-12T10:08:11Z","file_name":"IST-2015-370-v1+1_0809.4326.pdf"}],"volume":6,"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)"},"scopus_import":1,"_id":"3868","month":"09","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","oa":1,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3504"}]},"title":"Algorithms for game metrics","department":[{"_id":"KrCh"}],"pubrep_id":"370","abstract":[{"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","lang":"eng"}],"status":"public","has_accepted_license":"1","day":"01","intvolume":"         6","citation":{"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>.","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>","ista":"Chatterjee K, De Alfaro L, Majumdar R, Raman V. 2010. Algorithms for game metrics. Logical Methods in Computer Science. 6(3), 1–27.","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.","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>.","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>"}},{"department":[{"_id":"HeEd"}],"pubrep_id":"536","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","month":"10","_id":"3901","oa":1,"title":"Computing robustness and persistence for images","publication_status":"published","has_accepted_license":"1","day":"28","intvolume":"        16","citation":{"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>.","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.","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>.","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>","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>","short":"P. Bendich, H. Edelsbrunner, M. Kerber, IEEE Transactions of Visualization and Computer Graphics 16 (2010) 1251–1260."},"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."}],"status":"public","date_published":"2010-10-28T00:00:00Z","oa_version":"Submitted Version","ddc":["000"],"author":[{"first_name":"Paul","full_name":"Bendich, Paul","last_name":"Bendich","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"id":"36E4574A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8030-9299","last_name":"Kerber","first_name":"Michael","full_name":"Kerber, Michael"}],"publist_id":"2253","publication":"IEEE Transactions of Visualization and Computer Graphics","issue":"6","publisher":"IEEE","doi":"10.1109/TVCG.2010.139","file_date_updated":"2020-07-14T12:46:21Z","type":"journal_article","language":[{"iso":"eng"}],"scopus_import":1,"date_updated":"2021-01-12T07:53:04Z","quality_controlled":"1","page":"1251 - 1260","date_created":"2018-12-11T12:05:47Z","year":"2010","volume":16,"file":[{"checksum":"f6d813c04f4b46023cec6b9a17f15472","relation":"main_file","creator":"system","file_size":721994,"file_name":"IST-2016-536-v1+1_2010-J-02-PersistenceforImages.pdf","date_updated":"2020-07-14T12:46:21Z","access_level":"open_access","file_id":"5262","date_created":"2018-12-12T10:17:10Z","content_type":"application/pdf"}]},{"date_updated":"2023-09-07T11:28:47Z","year":"2010","degree_awarded":"PhD","date_created":"2018-12-11T12:06:08Z","status":"public","article_processing_charge":"No","day":"01","citation":{"short":"H. Pflicke,   Dendritic Cell Migration across Basement Membranes in the Skin, Institute of Science and Technology Austria, 2010.","ama":"Pflicke H.   Dendritic cell migration across basement membranes in the skin. 2010.","apa":"Pflicke, H. (2010). <i>  Dendritic cell migration across basement membranes in the skin</i>. Institute of Science and Technology Austria.","chicago":"Pflicke, Holger. “  Dendritic Cell Migration across Basement Membranes in the Skin.” Institute of Science and Technology Austria, 2010.","ista":"Pflicke H. 2010.   Dendritic cell migration across basement membranes in the skin. Institute of Science and Technology Austria.","mla":"Pflicke, Holger. <i>  Dendritic Cell Migration across Basement Membranes in the Skin</i>. Institute of Science and Technology Austria, 2010.","ieee":"H. Pflicke, “  Dendritic cell migration across basement membranes in the skin,” Institute of Science and Technology Austria, 2010."},"supervisor":[{"id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg"}],"publication_identifier":{"issn":["2663-337X"]},"publisher":"Institute of Science and Technology Austria","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"3962","month":"07","type":"dissertation","title":"Dendritic cell migration across basement membranes in the skin","language":[{"iso":"eng"}],"publication_status":"published","date_published":"2010-07-01T00:00:00Z","department":[{"_id":"CaHe"},{"_id":"GradSch"}],"oa_version":"None","author":[{"id":"CAA57A9A-5B61-11E9-B130-E0C1E1F2C83D","full_name":"Pflicke, Holger","first_name":"Holger","last_name":"Pflicke"}],"alternative_title":["ISTA Thesis"],"publist_id":"2165"},{"date_updated":"2021-01-12T07:54:45Z","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","page":"485 - 494","date_created":"2018-12-11T12:07:08Z","year":"2010","volume":13,"scopus_import":1,"publisher":"Wiley-Blackwell","doi":"10.1111/j.1461-0248.2010.01442.x","type":"journal_article","language":[{"iso":"eng"}],"date_published":"2010-03-15T00:00:00Z","oa_version":"None","author":[{"full_name":"Bridle, Jon","first_name":"Jon","last_name":"Bridle"},{"orcid":"0000-0003-0951-3112","id":"3BBFB084-F248-11E8-B48F-1D18A9856A87","first_name":"Jitka","full_name":"Polechova, Jitka","last_name":"Polechova"},{"last_name":"Kawata","first_name":"Masakado","full_name":"Kawata, Masakado"},{"first_name":"Roger","full_name":"Butlin, Roger","last_name":"Butlin"}],"issue":"4","publist_id":"1987","publication":"Ecology Letters","ec_funded":1,"abstract":[{"lang":"eng","text":"All species are restricted in their distribution. Currently, ecological models can only explain such limits if patches vary in quality, leading to asymmetrical dispersal, or if genetic variation is too low at the margins for adaptation. However, population genetic models suggest that the increase in genetic variance resulting from dispersal should allow adaptation to almost any ecological gradient. Clearly therefore, these models miss something that prevents evolution in natural populations. We developed an individual-based simulation to explore stochastic effects in these models. At high carrying capacities, our simulations largely agree with deterministic predictions. However, when carrying capacity is low, the population fails to establish for a wide range of parameter values where adaptation was expected from previous models. Stochastic or transient effects appear critical around the boundaries in parameter space between simulation behaviours. Dispersal, gradient steepness, and population density emerge as key factors determining adaptation on an ecological gradient. "}],"status":"public","day":"15","citation":{"ama":"Bridle J, Polechova J, Kawata M, Butlin R. Why is adaptation prevented at ecological margins? New insights from individual-based simulations. <i>Ecology Letters</i>. 2010;13(4):485-494. doi:<a href=\"https://doi.org/10.1111/j.1461-0248.2010.01442.x\">10.1111/j.1461-0248.2010.01442.x</a>","short":"J. Bridle, J. Polechova, M. Kawata, R. Butlin, Ecology Letters 13 (2010) 485–494.","ieee":"J. Bridle, J. Polechova, M. Kawata, and R. Butlin, “Why is adaptation prevented at ecological margins? New insights from individual-based simulations,” <i>Ecology Letters</i>, vol. 13, no. 4. Wiley-Blackwell, pp. 485–494, 2010.","mla":"Bridle, Jon, et al. “Why Is Adaptation Prevented at Ecological Margins? New Insights from Individual-Based Simulations.” <i>Ecology Letters</i>, vol. 13, no. 4, Wiley-Blackwell, 2010, pp. 485–94, doi:<a href=\"https://doi.org/10.1111/j.1461-0248.2010.01442.x\">10.1111/j.1461-0248.2010.01442.x</a>.","chicago":"Bridle, Jon, Jitka Polechova, Masakado Kawata, and Roger Butlin. “Why Is Adaptation Prevented at Ecological Margins? New Insights from Individual-Based Simulations.” <i>Ecology Letters</i>. Wiley-Blackwell, 2010. <a href=\"https://doi.org/10.1111/j.1461-0248.2010.01442.x\">https://doi.org/10.1111/j.1461-0248.2010.01442.x</a>.","apa":"Bridle, J., Polechova, J., Kawata, M., &#38; Butlin, R. (2010). Why is adaptation prevented at ecological margins? New insights from individual-based simulations. <i>Ecology Letters</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1461-0248.2010.01442.x\">https://doi.org/10.1111/j.1461-0248.2010.01442.x</a>","ista":"Bridle J, Polechova J, Kawata M, Butlin R. 2010. Why is adaptation prevented at ecological margins? New insights from individual-based simulations. Ecology Letters. 13(4), 485–494."},"intvolume":"        13","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"4134","month":"03","title":"Why is adaptation prevented at ecological margins? New insights from individual-based simulations","publication_status":"published","department":[{"_id":"NiBa"}],"acknowledgement":"We are very grateful to Nick Barton."},{"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2924654/","open_access":"1"}],"pmid":1,"scopus_import":1,"volume":29,"year":"2010","date_created":"2018-12-11T12:07:17Z","page":"2753 - 2768","quality_controlled":"1","acknowledged_ssus":[{"_id":"Bio"}],"date_updated":"2021-01-12T07:54:55Z","issue":"16","publication":"EMBO Journal","publist_id":"1962","author":[{"full_name":"Papusheva, Ekaterina","first_name":"Ekaterina","last_name":"Papusheva","id":"41DB591E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Heisenberg","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Submitted Version","external_id":{"pmid":["20717145"]},"date_published":"2010-08-18T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","doi":"10.1038/emboj.2010.182","publisher":"Wiley-Blackwell","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.","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>.","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.","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>","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."},"intvolume":"        29","day":"18","status":"public","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."}],"department":[{"_id":"Bio"},{"_id":"CaHe"}],"publication_status":"published","title":"Spatial organization of adhesion: force-dependent regulation and function in tissue morphogenesis","oa":1,"month":"08","_id":"4157","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}]