[{"external_id":{"arxiv":["1104.3348"]},"abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with ω-regular specifications given as parity objectives. We consider the problem of computing the set of almost-sure winning states from where the objective can be ensured with probability 1. The algorithms for the computation of the almost-sure winning set for parity objectives iteratively use the solutions for the almost-sure winning set for Büchi objectives (a special case of parity objectives). Our contributions are as follows: First, we present the first subquadratic symbolic algorithm to compute the almost-sure winning set for MDPs with Büchi objectives; our algorithm takes O(nm)  symbolic steps as compared to the previous known algorithm that takes O(n 2) symbolic steps, where n is the number of states and m is the number of edges of the MDP. In practice MDPs often have constant out-degree, and then our symbolic algorithm takes O(nn)  symbolic steps, as compared to the previous known O(n 2) symbolic steps algorithm. Second, we present a new algorithm, namely win-lose algorithm, with the following two properties: (a) the algorithm iteratively computes subsets of the almost-sure winning set and its complement, as compared to all previous algorithms that discover the almost-sure winning set upon termination; and (b) requires O(nK)  symbolic steps, where K is the maximal number of edges of strongly connected components (scc’s) of the MDP. The win-lose algorithm requires symbolic computation of scc’s. Third, we improve the algorithm for symbolic scc computation; the previous known algorithm takes linear symbolic steps, and our new algorithm improves the constants associated with the linear number of steps. In the worst case the previous known algorithm takes 5·n symbolic steps, whereas our new algorithm takes 4 ·n symbolic steps."}],"publication_status":"published","publisher":"Springer","date_published":"2011-08-11T00:00:00Z","page":"260 - 276","department":[{"_id":"KrCh"}],"volume":6806,"quality_controlled":"1","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"related_material":{"record":[{"id":"2831","relation":"later_version","status":"public"}]},"year":"2011","date_created":"2018-12-11T12:02:47Z","citation":{"apa":"Chatterjee, K., Henzinger, M. H., Joglekar, M., &#38; Nisarg, S. (2011). Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In G. Gopalakrishnan &#38; S. Qadeer (Eds.) (Vol. 6806, pp. 260–276). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-22110-1_21\">https://doi.org/10.1007/978-3-642-22110-1_21</a>","mla":"Chatterjee, Krishnendu, et al. <i>Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives</i>. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 260–76, doi:<a href=\"https://doi.org/10.1007/978-3-642-22110-1_21\">10.1007/978-3-642-22110-1_21</a>.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Manas Joglekar, and Shah Nisarg. “Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:260–76. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22110-1_21\">https://doi.org/10.1007/978-3-642-22110-1_21</a>.","ista":"Chatterjee K, Henzinger MH, Joglekar M, Nisarg S. 2011. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. CAV: Computer Aided Verification, LNCS, vol. 6806, 260–276.","ieee":"K. Chatterjee, M. H. Henzinger, M. Joglekar, and S. Nisarg, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 260–276.","ama":"Chatterjee K, Henzinger MH, Joglekar M, Nisarg S. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In: Gopalakrishnan G, Qadeer S, eds. Vol 6806. Springer; 2011:260-276. doi:<a href=\"https://doi.org/10.1007/978-3-642-22110-1_21\">10.1007/978-3-642-22110-1_21</a>","short":"K. Chatterjee, M.H. Henzinger, M. Joglekar, S. Nisarg, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 260–276."},"publist_id":"3282","doi":"10.1007/978-3-642-22110-1_21","_id":"3342","conference":{"name":"CAV: Computer Aided Verification","start_date":"2011-07-14","location":"Snowbird, USA","end_date":"2011-07-20"},"month":"08","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.3348"}],"oa_version":"Preprint","day":"11","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H"},{"last_name":"Joglekar","full_name":"Joglekar, Manas","first_name":"Manas"},{"last_name":"Nisarg","first_name":"Shah","full_name":"Nisarg, Shah"}],"arxiv":1,"alternative_title":["LNCS"],"type":"conference","status":"public","editor":[{"last_name":"Gopalakrishnan","full_name":"Gopalakrishnan, Ganesh","first_name":"Ganesh"},{"last_name":"Qadeer","first_name":"Shaz","full_name":"Qadeer, Shaz"}],"intvolume":"      6806","oa":1,"date_updated":"2023-02-23T11:00:13Z","article_processing_charge":"No","title":"Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives","language":[{"iso":"eng"}]},{"date_published":"2011-01-01T00:00:00Z","status":"public","type":"conference","publisher":"SIAM","quality_controlled":"1","department":[{"_id":"KrCh"}],"page":"1318 - 1336","month":"01","conference":{"end_date":"2011-01-25","location":"San Francisco, SA, United States","start_date":"2011-01-23","name":"SODA: Symposium on Discrete Algorithms"},"abstract":[{"text":"We present faster and dynamic algorithms for the following problems arising in probabilistic verification: Computation of the maximal end-component (mec) decomposition of Markov decision processes (MDPs), and of the almost sure winning set for reachability and parity objectives in MDPs. We achieve the following running time for static algorithms in MDPs with graphs of n vertices and m edges: (1) O(m · min{ √m, n2/3 }) for the mec decomposition, improving the longstanding O(m·n) bound; (2) O(m·n2/3) for reachability objectives, improving the previous O(m · √m) bound for m &gt; n4/3; and (3) O(m · min{ √m, n2/3 } · log(d)) for parity objectives with d priorities, improving the previous O(m · √m · d) bound. We also give incremental and decremental algorithms in linear time for mec decomposition and reachability objectives and O(m · log d) time for parity ob jectives.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","main_file_link":[{"url":"https://eprints.cs.univie.ac.at/21/","open_access":"1"}],"day":"01","publication_status":"published","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Monika H","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"}],"doi":"10.1137/1.9781611973082.101","_id":"3343","language":[{"iso":"eng"}],"scopus_import":"1","article_processing_charge":"No","year":"2011","date_updated":"2023-02-14T10:36:10Z","oa":1,"citation":{"apa":"Chatterjee, K., &#38; Henzinger, M. H. (2011). Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification (pp. 1318–1336). Presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States: SIAM. <a href=\"https://doi.org/10.1137/1.9781611973082.101\">https://doi.org/10.1137/1.9781611973082.101</a>","ama":"Chatterjee K, Henzinger MH. Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. In: SIAM; 2011:1318-1336. doi:<a href=\"https://doi.org/10.1137/1.9781611973082.101\">10.1137/1.9781611973082.101</a>","ieee":"K. Chatterjee and M. H. Henzinger, “Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification,” presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States, 2011, pp. 1318–1336.","short":"K. Chatterjee, M.H. Henzinger, in:, SIAM, 2011, pp. 1318–1336.","mla":"Chatterjee, Krishnendu, and Monika H. Henzinger. <i>Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification</i>. SIAM, 2011, pp. 1318–36, doi:<a href=\"https://doi.org/10.1137/1.9781611973082.101\">10.1137/1.9781611973082.101</a>.","ista":"Chatterjee K, Henzinger MH. 2011. Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. SODA: Symposium on Discrete Algorithms, 1318–1336.","chicago":"Chatterjee, Krishnendu, and Monika H Henzinger. “Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification,” 1318–36. SIAM, 2011. <a href=\"https://doi.org/10.1137/1.9781611973082.101\">https://doi.org/10.1137/1.9781611973082.101</a>."},"publist_id":"3278","title":"Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification","date_created":"2018-12-11T12:02:47Z"},{"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"}],"publication_status":"published","day":"15","oa_version":"None","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Games played on graphs provide the mathematical framework to analyze several important problems in computer science as well as mathematics, such as the synthesis problem of Church, model checking of open reactive systems and many others. On the basis of mode of interaction of the players these games can be classified as follows: (a) turn-based (players make moves in turns); and (b) concurrent (players make moves simultaneously). On the basis of the information available to the players these games can be classified as follows: (a) perfect-information (players have perfect view of the game); and (b) partial-information (players have partial view of the game). In this talk we will consider all these classes of games with reachability objectives, where the goal of one player is to reach a set of target vertices of the graph, and the goal of the opponent player is to prevent the player from reaching the target. We will survey the results for various classes of games, and the results range from linear time decision algorithms to EXPTIME-complete problems to undecidable problems."}],"conference":{"location":"Genoa, Italy","end_date":"2011-09-30","name":"RP: Reachability Problems","start_date":"2011-09-28"},"month":"10","page":"1 - 1","department":[{"_id":"KrCh"}],"quality_controlled":"1","volume":6945,"publisher":"Springer","alternative_title":["LNCS"],"type":"conference","date_published":"2011-10-15T00:00:00Z","status":"public","citation":{"apa":"Chatterjee, K. (2011). Graph games with reachability objectives. In G. Delzanno &#38; I. Potapov (Eds.) (Vol. 6945, pp. 1–1). Presented at the RP: Reachability Problems, Genoa, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-642-24288-5_1\">https://doi.org/10.1007/978-3-642-24288-5_1</a>","ama":"Chatterjee K. Graph games with reachability objectives. In: Delzanno G, Potapov I, eds. Vol 6945. Springer; 2011:1-1. doi:<a href=\"https://doi.org/10.1007/978-3-642-24288-5_1\">10.1007/978-3-642-24288-5_1</a>","ieee":"K. Chatterjee, “Graph games with reachability objectives,” presented at the RP: Reachability Problems, Genoa, Italy, 2011, vol. 6945, pp. 1–1.","short":"K. Chatterjee, in:, G. Delzanno, I. Potapov (Eds.), Springer, 2011, pp. 1–1.","mla":"Chatterjee, Krishnendu. <i>Graph Games with Reachability Objectives</i>. Edited by Giorgo Delzanno and Igor Potapov, vol. 6945, Springer, 2011, pp. 1–1, doi:<a href=\"https://doi.org/10.1007/978-3-642-24288-5_1\">10.1007/978-3-642-24288-5_1</a>.","chicago":"Chatterjee, Krishnendu. “Graph Games with Reachability Objectives.” edited by Giorgo Delzanno and Igor Potapov, 6945:1–1. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-24288-5_1\">https://doi.org/10.1007/978-3-642-24288-5_1</a>.","ista":"Chatterjee K. 2011. Graph games with reachability objectives. RP: Reachability Problems, LNCS, vol. 6945, 1–1."},"date_created":"2018-12-11T12:02:47Z","title":"Graph games with reachability objectives","publist_id":"3277","date_updated":"2021-01-12T07:42:48Z","year":"2011","intvolume":"      6945","editor":[{"full_name":"Delzanno, Giorgo","first_name":"Giorgo","last_name":"Delzanno"},{"full_name":"Potapov, Igor","first_name":"Igor","last_name":"Potapov"}],"language":[{"iso":"eng"}],"_id":"3344","doi":"10.1007/978-3-642-24288-5_1"},{"language":[{"iso":"eng"}],"title":"Energy and mean-payoff parity Markov Decision Processes","oa":1,"date_updated":"2023-02-23T12:23:59Z","scopus_import":1,"intvolume":"      6907","alternative_title":["LNCS"],"status":"public","type":"conference","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"}],"arxiv":1,"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.2909"}],"day":"28","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2011-08-22","location":"Warsaw, Poland","end_date":"2011-08-26"},"month":"09","_id":"3345","doi":"10.1007/978-3-642-22993-0_21","date_created":"2018-12-11T12:02:48Z","citation":{"ista":"Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6907, 206–218.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Energy and Mean-Payoff Parity Markov Decision Processes</i>. Vol. 6907, Springer, 2011, pp. 206–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-22993-0_21\">10.1007/978-3-642-22993-0_21</a>.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Energy and Mean-Payoff Parity Markov Decision Processes,” 6907:206–18. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22993-0_21\">https://doi.org/10.1007/978-3-642-22993-0_21</a>.","ieee":"K. Chatterjee and L. Doyen, “Energy and mean-payoff parity Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland, 2011, vol. 6907, pp. 206–218.","ama":"Chatterjee K, Doyen L. Energy and mean-payoff parity Markov Decision Processes. In: Vol 6907. Springer; 2011:206-218. doi:<a href=\"https://doi.org/10.1007/978-3-642-22993-0_21\">10.1007/978-3-642-22993-0_21</a>","short":"K. Chatterjee, L. Doyen, in:, Springer, 2011, pp. 206–218.","apa":"Chatterjee, K., &#38; Doyen, L. (2011). Energy and mean-payoff parity Markov Decision Processes (Vol. 6907, pp. 206–218). Presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland: Springer. <a href=\"https://doi.org/10.1007/978-3-642-22993-0_21\">https://doi.org/10.1007/978-3-642-22993-0_21</a>"},"publist_id":"3276","year":"2011","related_material":{"record":[{"status":"public","id":"5387","relation":"earlier_version"}]},"project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"page":"206 - 218","department":[{"_id":"KrCh"}],"volume":6907,"quality_controlled":"1","publisher":"Springer","date_published":"2011-09-28T00:00:00Z","publication_status":"published","external_id":{"arxiv":["1104.2909"]},"abstract":[{"lang":"eng","text":"We consider Markov Decision Processes (MDPs) with mean-payoff parity and energy parity objectives. In system design, the parity objective is used to encode ω-regular specifications, and the mean-payoff and energy objectives can be used to model quantitative resource constraints. The energy condition re- quires that the resource level never drops below 0, and the mean-payoff condi- tion requires that the limit-average value of the resource consumption is within a threshold. While these two (energy and mean-payoff) classical conditions are equivalent for two-player games, we show that they differ for MDPs. We show that the problem of deciding whether a state is almost-sure winning (i.e., winning with probability 1) in energy parity MDPs is in NP ∩ coNP, while for mean- payoff parity MDPs, the problem is solvable in polynomial time, improving a recent PSPACE bound."}]},{"ec_funded":1,"article_number":"5970225","scopus_import":1,"date_updated":"2021-01-12T07:42:49Z","oa":1,"year":"2011","citation":{"ista":"Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. 2011. Two views on multiple mean payoff objectives in Markov Decision Processes. LICS: Logic in Computer Science, 5970225.","mla":"Brázdil, Tomáš, et al. <i>Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes</i>. 5970225, IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/LICS.2011.10\">10.1109/LICS.2011.10</a>.","chicago":"Brázdil, Tomáš, Václav Brožek, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes.” IEEE, 2011. <a href=\"https://doi.org/10.1109/LICS.2011.10\">https://doi.org/10.1109/LICS.2011.10</a>.","short":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, in:, IEEE, 2011.","ama":"Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. Two views on multiple mean payoff objectives in Markov Decision Processes. In: IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/LICS.2011.10\">10.1109/LICS.2011.10</a>","ieee":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Two views on multiple mean payoff objectives in Markov Decision Processes,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.","apa":"Brázdil, T., Brožek, V., Chatterjee, K., Forejt, V., &#38; Kučera, A. (2011). Two views on multiple mean payoff objectives in Markov Decision Processes. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. <a href=\"https://doi.org/10.1109/LICS.2011.10\">https://doi.org/10.1109/LICS.2011.10</a>"},"publist_id":"3275","title":"Two views on multiple mean payoff objectives in Markov Decision Processes","date_created":"2018-12-11T12:02:48Z","doi":"10.1109/LICS.2011.10","_id":"3346","language":[{"iso":"eng"}],"conference":{"start_date":"2011-06-21","name":"LICS: Logic in Computer Science","end_date":"2011-06-24","location":"Toronto, Canada"},"month":"06","day":"21","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.3489"}],"oa_version":"Submitted Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We study Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) functions. We consider two different objectives, namely, expectation and satisfaction objectives. Given an MDP with k reward functions, in the expectation objective the goal is to maximize the expected limit-average value, and in the satisfaction objective the goal is to maximize the probability of runs such that the limit-average value stays above a given vector. We show that under the expectation objective, in contrast to the single-objective case, both randomization and memory are necessary for strategies, and that finite-memory randomized strategies are sufficient. Under the satisfaction objective, in contrast to the single-objective case, infinite memory is necessary for strategies, and that randomized memoryless strategies are sufficient for epsilon-approximation, for all epsilon&gt;;0. We further prove that the decision problems for both expectation and satisfaction objectives can be solved in polynomial time and the trade-off curve (Pareto curve) can be epsilon-approximated in time polynomial in the size of the MDP and 1/epsilon, and exponential in the number of reward functions, for all epsilon&gt;;0. Our results also reveal flaws in previous work for MDPs with multiple mean-payoff functions under the expectation objective, correct the flaws and obtain improved results."}],"author":[{"first_name":"Tomáš","full_name":"Brázdil, Tomáš","last_name":"Brázdil"},{"last_name":"Brožek","full_name":"Brožek, Václav","first_name":"Václav"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"first_name":"Vojtěch","full_name":"Forejt, Vojtěch","last_name":"Forejt"},{"last_name":"Kučera","first_name":"Antonín","full_name":"Kučera, Antonín"}],"publication_status":"published","publisher":"IEEE","type":"conference","date_published":"2011-06-21T00:00:00Z","status":"public","department":[{"_id":"KrCh"}],"quality_controlled":"1","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}]},{"alternative_title":["LNCS"],"status":"public","type":"conference","main_file_link":[{"url":"http://arxiv.org/abs/1101.1727","open_access":"1"}],"day":"16","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2011-05-31","location":"Tarragona, Spain","start_date":"2011-05-26","name":"LATA: Language and Automata Theory and Applications"},"month":"06","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Fijalkow, Nathanaël","first_name":"Nathanaël","id":"A1B5DD72-E997-11E9-8398-E808B6C6ADC0","last_name":"Fijalkow"}],"arxiv":1,"language":[{"iso":"eng"}],"intvolume":"      6638","scopus_import":1,"title":"Finitary languages","oa":1,"date_updated":"2021-01-12T07:42:50Z","page":"216 - 226","department":[{"_id":"KrCh"}],"quality_controlled":"1","volume":6638,"publisher":"Springer","date_published":"2011-06-16T00:00:00Z","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"external_id":{"arxiv":["1101.1727"]},"abstract":[{"text":"The class of omega-regular languages provides a robust specification language in verification. Every omega-regular condition can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens &quot;eventually&quot;. Finitary liveness was proposed by Alur and Henzinger as a stronger formulation of liveness. It requires that there exists an unknown, fixed bound b such that something good happens within b transitions. In this work we consider automata with finitary acceptance conditions defined by finitary Buchi, parity and Streett languages. We study languages expressible by such automata: we give their topological complexity and present a regular-expression characterization. We compare the expressive power of finitary automata and give optimal algorithms for classical decisions questions. We show that the finitary languages are Sigma 2-complete; we present a complete picture of the expressive power of various classes of automata with finitary and infinitary acceptance conditions; we show that the languages defined by finitary parity automata exactly characterize the star-free fragment of omega B-regular languages; and we show that emptiness is NLOGSPACE-complete and universality as well as language inclusion are PSPACE-complete for finitary parity and Streett automata.","lang":"eng"}],"publication_status":"published","doi":"10.1007/978-3-642-21254-3_16","_id":"3347","date_created":"2018-12-11T12:02:48Z","publist_id":"3274","citation":{"ista":"Chatterjee K, Fijalkow N. 2011. Finitary languages. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 216–226.","chicago":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Finitary Languages,” 6638:216–26. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-21254-3_16\">https://doi.org/10.1007/978-3-642-21254-3_16</a>.","mla":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. <i>Finitary Languages</i>. Vol. 6638, Springer, 2011, pp. 216–26, doi:<a href=\"https://doi.org/10.1007/978-3-642-21254-3_16\">10.1007/978-3-642-21254-3_16</a>.","short":"K. Chatterjee, N. Fijalkow, in:, Springer, 2011, pp. 216–226.","ama":"Chatterjee K, Fijalkow N. Finitary languages. In: Vol 6638. Springer; 2011:216-226. doi:<a href=\"https://doi.org/10.1007/978-3-642-21254-3_16\">10.1007/978-3-642-21254-3_16</a>","ieee":"K. Chatterjee and N. Fijalkow, “Finitary languages,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 216–226.","apa":"Chatterjee, K., &#38; Fijalkow, N. (2011). Finitary languages (Vol. 6638, pp. 216–226). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. <a href=\"https://doi.org/10.1007/978-3-642-21254-3_16\">https://doi.org/10.1007/978-3-642-21254-3_16</a>"},"year":"2011"},{"doi":"10.1145/1967701.1967734","language":[{"iso":"eng"}],"_id":"3348","scopus_import":1,"publist_id":"3273","title":"Synthesis of memory efficient real time controllers for safety objectives","citation":{"apa":"Chatterjee, K., &#38; Prabhu, V. (2011). Synthesis of memory efficient real time controllers for safety objectives (pp. 221–230). Presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA: Springer. <a href=\"https://doi.org/10.1145/1967701.1967734\">https://doi.org/10.1145/1967701.1967734</a>","mla":"Chatterjee, Krishnendu, and Vinayak Prabhu. <i>Synthesis of Memory Efficient Real Time Controllers for Safety Objectives</i>. Springer, 2011, pp. 221–30, doi:<a href=\"https://doi.org/10.1145/1967701.1967734\">10.1145/1967701.1967734</a>.","chicago":"Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory Efficient Real Time Controllers for Safety Objectives,” 221–30. Springer, 2011. <a href=\"https://doi.org/10.1145/1967701.1967734\">https://doi.org/10.1145/1967701.1967734</a>.","ista":"Chatterjee K, Prabhu V. 2011. Synthesis of memory efficient real time controllers for safety objectives. HSCC: Hybrid Systems - Computation and Control, 221–230.","ama":"Chatterjee K, Prabhu V. Synthesis of memory efficient real time controllers for safety objectives. In: Springer; 2011:221-230. doi:<a href=\"https://doi.org/10.1145/1967701.1967734\">10.1145/1967701.1967734</a>","ieee":"K. Chatterjee and V. Prabhu, “Synthesis of memory efficient real time controllers for safety objectives,” presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA, 2011, pp. 221–230.","short":"K. Chatterjee, V. Prabhu, in:, Springer, 2011, pp. 221–230."},"date_created":"2018-12-11T12:02:49Z","date_updated":"2021-01-12T07:42:50Z","oa":1,"year":"2011","page":"221 - 230","department":[{"_id":"KrCh"}],"quality_controlled":"1","publisher":"Springer","date_published":"2011-01-31T00:00:00Z","type":"conference","status":"public","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"day":"31","main_file_link":[{"url":"http://arxiv.org/abs/1101.5842","open_access":"1"}],"oa_version":"Submitted Version","abstract":[{"text":"We study synthesis of controllers for real-time systems, where the objective is to stay in a given safe set. The problem is solved by obtaining winning strategies in the setting of concurrent two-player timed automaton games with safety objectives. To prevent a player from winning by blocking time, we restrict each player to strategies that ensure that the player cannot be responsible for causing a zeno run. We construct winning strategies for the controller which require access only to (1) the system clocks (thus, controllers which require their own internal infinitely precise clocks are not necessary), and (2) a linear (in the number of clocks) number of memory bits. Precisely, we show that for safety objectives, a memory of size (3 · |C|+lg(|C|+1)) bits suffices for winning controller strategies, where C is the set of clocks of the timed automaton game, significantly improving the previous known exponential bound. We also settle the open question of whether winning region controller strategies require memory for safety objectives by showing with an example the necessity of memory for region strategies to win for safety objectives.","lang":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","conference":{"name":"HSCC: Hybrid Systems - Computation and Control","start_date":"2011-04-12","location":"Chicago, USA","end_date":"2011-04-14"},"month":"01","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"full_name":"Prabhu, Vinayak","first_name":"Vinayak","last_name":"Prabhu"}],"publication_status":"published"},{"scopus_import":1,"intvolume":"        54","year":"2011","oa":1,"date_updated":"2021-01-12T07:42:51Z","date_created":"2018-12-11T12:02:49Z","publist_id":"3272","title":"A reduction from parity games to simple stochastic games","citation":{"apa":"Chatterjee, K., &#38; Fijalkow, N. (2011). A reduction from parity games to simple stochastic games (Vol. 54, pp. 74–86). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. <a href=\"https://doi.org/10.4204/EPTCS.54.6\">https://doi.org/10.4204/EPTCS.54.6</a>","chicago":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “A Reduction from Parity Games to Simple Stochastic Games,” 54:74–86. EPTCS, 2011. <a href=\"https://doi.org/10.4204/EPTCS.54.6\">https://doi.org/10.4204/EPTCS.54.6</a>.","mla":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. <i>A Reduction from Parity Games to Simple Stochastic Games</i>. Vol. 54, EPTCS, 2011, pp. 74–86, doi:<a href=\"https://doi.org/10.4204/EPTCS.54.6\">10.4204/EPTCS.54.6</a>.","ista":"Chatterjee K, Fijalkow N. 2011. A reduction from parity games to simple stochastic games. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 54, 74–86.","ieee":"K. Chatterjee and N. Fijalkow, “A reduction from parity games to simple stochastic games,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2011, vol. 54, pp. 74–86.","ama":"Chatterjee K, Fijalkow N. A reduction from parity games to simple stochastic games. In: Vol 54. EPTCS; 2011:74-86. doi:<a href=\"https://doi.org/10.4204/EPTCS.54.6\">10.4204/EPTCS.54.6</a>","short":"K. Chatterjee, N. Fijalkow, in:, EPTCS, 2011, pp. 74–86."},"doi":"10.4204/EPTCS.54.6","language":[{"iso":"eng"}],"_id":"3349","month":"06","conference":{"end_date":"2011-06-17","location":"Minori, Italy","start_date":"2011-06-15","name":"GandALF: Games, Automata, Logic, and Formal Verification"},"abstract":[{"text":"Games on graphs provide a natural model for reactive non-terminating systems. In such games, the interaction of two players on an arena results in an infinite path that describes a run of the system. Different settings are used to model various open systems in computer science, as for instance turn-based or concurrent moves, and deterministic or stochastic transitions. In this paper, we are interested in turn-based games, and specifically in deterministic parity games and stochastic reachability games (also known as simple stochastic games). We present a simple, direct and efficient reduction from deterministic parity games to simple stochastic games: it yields an arena whose size is linear up to a logarithmic factor in size of the original arena.","lang":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","day":"04","main_file_link":[{"url":"http://arxiv.org/abs/1106.1232","open_access":"1"}],"publication_status":"published","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Nathanaël","full_name":"Fijalkow, Nathanaël","last_name":"Fijalkow"}],"type":"conference","date_published":"2011-06-04T00:00:00Z","status":"public","alternative_title":["EPTCS"],"publisher":"EPTCS","volume":54,"page":"74 - 86","department":[{"_id":"KrCh"}],"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}]},{"date_updated":"2021-01-12T07:42:51Z","year":"2011","date_created":"2018-12-11T12:02:49Z","title":"Minimum attention controller synthesis for omega regular objectives","publist_id":"3271","citation":{"apa":"Chatterjee, K., &#38; Majumdar, R. (2011). Minimum attention controller synthesis for omega regular objectives. In U. Fahrenberg &#38; S. Tripakis (Eds.) (Vol. 6919, pp. 145–159). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark: Springer. <a href=\"https://doi.org/10.1007/978-3-642-24310-3_11\">https://doi.org/10.1007/978-3-642-24310-3_11</a>","chicago":"Chatterjee, Krishnendu, and Ritankar Majumdar. “Minimum Attention Controller Synthesis for Omega Regular Objectives.” edited by Uli Fahrenberg and Stavros Tripakis, 6919:145–59. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-24310-3_11\">https://doi.org/10.1007/978-3-642-24310-3_11</a>.","mla":"Chatterjee, Krishnendu, and Ritankar Majumdar. <i>Minimum Attention Controller Synthesis for Omega Regular Objectives</i>. Edited by Uli Fahrenberg and Stavros Tripakis, vol. 6919, Springer, 2011, pp. 145–59, doi:<a href=\"https://doi.org/10.1007/978-3-642-24310-3_11\">10.1007/978-3-642-24310-3_11</a>.","ista":"Chatterjee K, Majumdar R. 2011. Minimum attention controller synthesis for omega regular objectives. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6919, 145–159.","short":"K. Chatterjee, R. Majumdar, in:, U. Fahrenberg, S. Tripakis (Eds.), Springer, 2011, pp. 145–159.","ieee":"K. Chatterjee and R. Majumdar, “Minimum attention controller synthesis for omega regular objectives,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark, 2011, vol. 6919, pp. 145–159.","ama":"Chatterjee K, Majumdar R. Minimum attention controller synthesis for omega regular objectives. In: Fahrenberg U, Tripakis S, eds. Vol 6919. Springer; 2011:145-159. doi:<a href=\"https://doi.org/10.1007/978-3-642-24310-3_11\">10.1007/978-3-642-24310-3_11</a>"},"editor":[{"first_name":"Uli","full_name":"Fahrenberg, Uli","last_name":"Fahrenberg"},{"first_name":"Stavros","full_name":"Tripakis, Stavros","last_name":"Tripakis"}],"intvolume":"      6919","scopus_import":1,"_id":"3350","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-24310-3_11","publication_status":"published","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Majumdar","full_name":"Majumdar, Ritankar","first_name":"Ritankar"}],"conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems","start_date":"2011-09-21","location":"Aalborg, Denmark","end_date":"2011-09-23"},"month":"01","oa_version":"None","day":"01","abstract":[{"text":"A controller for a discrete game with ω-regular objectives requires attention if, intuitively, it requires measuring the state and switching from the current control action. Minimum attention controllers are preferable in modern shared implementations of cyber-physical systems because they produce the least burden on system resources such as processor time or communication bandwidth. We give algorithms to compute minimum attention controllers for ω-regular objectives in imperfect information discrete two-player games. We show a polynomial-time reduction from minimum attention controller synthesis to synthesis of controllers for mean-payoff parity objectives in games of incomplete information. This gives an optimal EXPTIME-complete synthesis algorithm. We show that the minimum attention controller problem is decidable for infinite state systems with finite bisimulation quotients. In particular, the problem is decidable for timed and rectangular automata.","lang":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"alternative_title":["LNCS"],"publisher":"Springer","date_published":"2011-01-01T00:00:00Z","type":"conference","status":"public","page":"145 - 159","department":[{"_id":"KrCh"}],"volume":6919,"quality_controlled":"1"},{"type":"conference","status":"public","alternative_title":["LNCS"],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.3211"}],"day":"16","month":"04","conference":{"location":"Oslo, Norway","end_date":"2011-08-25","name":"FCT: Fundamentals of Computation Theory","start_date":"2011-08-22"},"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"first_name":"Rohit","full_name":"Singh, Rohit","last_name":"Singh"}],"language":[{"iso":"eng"}],"intvolume":"      6914","scopus_import":1,"editor":[{"last_name":"Owe","first_name":"Olaf","full_name":"Owe, Olaf"},{"first_name":"Martin","full_name":"Steffen, Martin","last_name":"Steffen"},{"full_name":"Telle, Jan Arne","first_name":"Jan Arne","last_name":"Telle"}],"title":"On memoryless quantitative objectives","oa":1,"date_updated":"2021-01-12T07:42:52Z","volume":6914,"quality_controlled":"1","page":"148 - 159","department":[{"_id":"KrCh"}],"date_published":"2011-04-16T00:00:00Z","publisher":"Springer","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"abstract":[{"text":"In two-player games on graph, the players construct an infinite path through the game graph and get a reward computed by a payoff function over infinite paths. Over weighted graphs, the typical and most studied payoff functions compute the limit-average or the discounted sum of the rewards along the path. Besides their simple definition, these two payoff functions enjoy the property that memoryless optimal strategies always exist. In an attempt to construct other simple payoff functions, we define a class of payoff functions which compute an (infinite) weighted average of the rewards. This new class contains both the limit-average and the discounted sum functions, and we show that they are the only members of this class which induce memoryless optimal strategies, showing that there is essentially no other simple payoff functions.","lang":"eng"}],"publication_status":"published","doi":"10.1007/978-3-642-22953-4_13","_id":"3351","date_created":"2018-12-11T12:02:50Z","publist_id":"3270","citation":{"apa":"Chatterjee, K., Doyen, L., &#38; Singh, R. (2011). On memoryless quantitative objectives. In O. Owe, M. Steffen, &#38; J. A. Telle (Eds.) (Vol. 6914, pp. 148–159). Presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway: Springer. <a href=\"https://doi.org/10.1007/978-3-642-22953-4_13\">https://doi.org/10.1007/978-3-642-22953-4_13</a>","short":"K. Chatterjee, L. Doyen, R. Singh, in:, O. Owe, M. Steffen, J.A. Telle (Eds.), Springer, 2011, pp. 148–159.","ieee":"K. Chatterjee, L. Doyen, and R. Singh, “On memoryless quantitative objectives,” presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway, 2011, vol. 6914, pp. 148–159.","ama":"Chatterjee K, Doyen L, Singh R. On memoryless quantitative objectives. In: Owe O, Steffen M, Telle JA, eds. Vol 6914. Springer; 2011:148-159. doi:<a href=\"https://doi.org/10.1007/978-3-642-22953-4_13\">10.1007/978-3-642-22953-4_13</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Rohit Singh. “On Memoryless Quantitative Objectives.” edited by Olaf Owe, Martin Steffen, and Jan Arne Telle, 6914:148–59. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22953-4_13\">https://doi.org/10.1007/978-3-642-22953-4_13</a>.","ista":"Chatterjee K, Doyen L, Singh R. 2011. On memoryless quantitative objectives. FCT: Fundamentals of Computation Theory, LNCS, vol. 6914, 148–159.","mla":"Chatterjee, Krishnendu, et al. <i>On Memoryless Quantitative Objectives</i>. Edited by Olaf Owe et al., vol. 6914, Springer, 2011, pp. 148–59, doi:<a href=\"https://doi.org/10.1007/978-3-642-22953-4_13\">10.1007/978-3-642-22953-4_13</a>."},"year":"2011"},{"volume":12,"quality_controlled":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_published":"2011-07-04T00:00:00Z","type":"journal_article","status":"public","publisher":"ACM","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"abstract":[{"text":"We consider two-player games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. We consider ω-regular winning conditions specified as parity objectives. Both players are allowed to use randomization when choosing their moves. We study the computation of the limit-winning set of states, consisting of the states where the sup-inf value of the game for player 1 is 1: in other words, a state is limit-winning if player 1 can ensure a probability of winning arbitrarily close to 1. We show that the limit-winning set can be computed in O(n2d+2) time, where n is the size of the game structure and 2d is the number of priorities (or colors). The membership problem of whether a state belongs to the limit-winning set can be decided in NP ∩ coNP. While this complexity is the same as for the simpler class of turn-based parity games, where in each state only one of the two players has a choice of moves, our algorithms are considerably more involved than those for turn-based games. This is because concurrent games do not satisfy two of the most fundamental properties of turn-based parity games. First, in concurrent games limit-winning strategies require randomization; and second, they require infinite memory.","lang":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"04","oa_version":"None","month":"07","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"De Alfaro","first_name":"Luca","full_name":"De Alfaro, Luca"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"publication_status":"published","doi":"10.1145/1970398.1970404","publication":"ACM Transactions on Computational Logic (TOCL)","_id":"3354","language":[{"iso":"eng"}],"scopus_import":1,"related_material":{"record":[{"id":"2054","relation":"later_version","status":"public"}]},"intvolume":"        12","article_number":"28","publist_id":"3262","citation":{"apa":"Chatterjee, K., De Alfaro, L., &#38; Henzinger, T. A. (2011). Qualitative concurrent parity games. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/1970398.1970404\">https://doi.org/10.1145/1970398.1970404</a>","ista":"Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 12(4), 28.","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative Concurrent Parity Games.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2011. <a href=\"https://doi.org/10.1145/1970398.1970404\">https://doi.org/10.1145/1970398.1970404</a>.","mla":"Chatterjee, Krishnendu, et al. “Qualitative Concurrent Parity Games.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 12, no. 4, 28, ACM, 2011, doi:<a href=\"https://doi.org/10.1145/1970398.1970404\">10.1145/1970398.1970404</a>.","ieee":"K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 12, no. 4. ACM, 2011.","ama":"Chatterjee K, De Alfaro L, Henzinger TA. Qualitative concurrent parity games. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2011;12(4). doi:<a href=\"https://doi.org/10.1145/1970398.1970404\">10.1145/1970398.1970404</a>","short":"K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 12 (2011)."},"date_created":"2018-12-11T12:02:51Z","title":"Qualitative concurrent parity games","issue":"4","year":"2011","date_updated":"2023-02-23T10:26:18Z"},{"year":"2011","citation":{"ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” IEEE, 2011. <a href=\"https://doi.org/10.1109/LICS.2011.33\">https://doi.org/10.1109/LICS.2011.33</a>.","mla":"Boker, Udi, et al. <i>Temporal Specifications with Accumulative Values</i>. 5970226, IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/LICS.2011.33\">10.1109/LICS.2011.33</a>.","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. In: IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/LICS.2011.33\">10.1109/LICS.2011.33</a>","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. <a href=\"https://doi.org/10.1109/LICS.2011.33\">https://doi.org/10.1109/LICS.2011.33</a>"},"publist_id":"3259","date_created":"2018-12-11T12:02:52Z","ec_funded":1,"article_number":"5970226","related_material":{"record":[{"relation":"later_version","id":"2038","status":"public"},{"status":"public","relation":"earlier_version","id":"5385"}]},"file_date_updated":"2020-07-14T12:46:09Z","_id":"3356","doi":"10.1109/LICS.2011.33","publication_status":"published","ddc":["000","004"],"abstract":[{"text":"There is recently a significant effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions, aiming for a general and flexible framework for quantitative-oriented specifications. In the heart of quantitative objectives lies the accumulation of values along a computation. It is either the accumulated summation, as with the energy objectives, or the accumulated average, as with the mean-payoff objectives. We investigate the extension of temporal logics with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is a numeric variable of the system, c is a constant rational number, and Sum(v) and Avg(v) denote the accumulated sum and average of the values of v from the beginning of the computation up to the current point of time. We also allow the path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring to the average value along an entire computation. We study the border of decidability for extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by prefix-accumulation assertions and extending LTL with path-accumulation assertions, result in temporal logics whose model-checking problem is decidable. The extended logics allow to significantly extend the currently known energy and mean-payoff objectives. Moreover, the prefix-accumulation assertions may be refined with \"controlled-accumulation\", allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that the fragment we point to is, in a sense, the maximal logic whose extension with prefix-accumulation assertions permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, and in particular CTL and LTL, makes the problem undecidable.","lang":"eng"}],"project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"publisher":"IEEE","date_published":"2011-06-21T00:00:00Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"oa":1,"date_updated":"2023-02-23T12:23:54Z","pubrep_id":"83","title":"Temporal specifications with accumulative values","scopus_import":1,"has_accepted_license":"1","language":[{"iso":"eng"}],"author":[{"last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","first_name":"Udi"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"first_name":"Orna","full_name":"Kupferman, Orna","last_name":"Kupferman"}],"conference":{"start_date":"2011-06-21","name":"LICS: Logic in Computer Science","end_date":"2011-06-24","location":"Toronto, Canada"},"month":"06","oa_version":"Submitted Version","day":"21","file":[{"file_size":225426,"relation":"main_file","access_level":"open_access","content_type":"application/pdf","creator":"system","date_updated":"2020-07-14T12:46:09Z","date_created":"2018-12-12T10:12:42Z","file_id":"4960","file_name":"IST-2012-83-v1+1_Temporal_specifications_with_accumulative_values.pdf","checksum":"792128f5455f0f40f1105f0398e05fa9"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","type":"conference"},{"_id":"3357","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-21254-3_17","date_updated":"2021-01-12T07:42:54Z","year":"2011","date_created":"2018-12-11T12:02:52Z","title":"The complexity of request-response games","citation":{"apa":"Chatterjee, K., Henzinger, T. A., &#38; Horn, F. (2011). The complexity of request-response games. In A.-H. Dediu, S. Inenaga, &#38; C. Martín-Vide (Eds.) (Vol. 6638, pp. 227–237). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. <a href=\"https://doi.org/10.1007/978-3-642-21254-3_17\">https://doi.org/10.1007/978-3-642-21254-3_17</a>","ista":"Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 227–237.","mla":"Chatterjee, Krishnendu, et al. <i>The Complexity of Request-Response Games</i>. Edited by Adrian-Horia Dediu et al., vol. 6638, Springer, 2011, pp. 227–37, doi:<a href=\"https://doi.org/10.1007/978-3-642-21254-3_17\">10.1007/978-3-642-21254-3_17</a>.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “The Complexity of Request-Response Games.” edited by Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martín-Vide, 6638:227–37. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-21254-3_17\">https://doi.org/10.1007/978-3-642-21254-3_17</a>.","short":"K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 227–237.","ama":"Chatterjee K, Henzinger TA, Horn F. The complexity of request-response games. In: Dediu A-H, Inenaga S, Martín-Vide C, eds. Vol 6638. Springer; 2011:227-237. doi:<a href=\"https://doi.org/10.1007/978-3-642-21254-3_17\">10.1007/978-3-642-21254-3_17</a>","ieee":"K. Chatterjee, T. A. Henzinger, and F. Horn, “The complexity of request-response games,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 227–237."},"publist_id":"3258","editor":[{"first_name":"Adrian-Horia","full_name":"Dediu, Adrian-Horia","last_name":"Dediu"},{"first_name":"Shunsuke","full_name":"Inenaga, Shunsuke","last_name":"Inenaga"},{"last_name":"Martín-Vide","full_name":"Martín-Vide, Carlos","first_name":"Carlos"}],"intvolume":"      6638","scopus_import":1,"publisher":"Springer","alternative_title":["LNCS"],"date_published":"2011-01-01T00:00:00Z","status":"public","type":"conference","page":"227 - 237","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"quality_controlled":"1","volume":6638,"publication_status":"published","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Horn","id":"37327ACE-F248-11E8-B48F-1D18A9856A87","first_name":"Florian","full_name":"Horn, Florian"}],"conference":{"start_date":"2011-05-26","name":"LATA: Language and Automata Theory and Applications","end_date":"2011-05-31","location":"Tarragona, Spain"},"month":"01","day":"01","oa_version":"None","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We consider two-player graph games whose objectives are request-response condition, i.e conjunctions of conditions of the form \"if a state with property Rq is visited, then later a state with property Rp is visited\". The winner of such games can be decided in EXPTIME and the problem is known to be NP-hard. In this paper, we close this gap by showing that this problem is, in fact, EXPTIME-complete. We show that the problem becomes PSPACE-complete if we only consider games played on DAGs, and NP-complete or PTIME-complete if there is only one player (depending on whether he wants to enforce or spoil the request-response condition). We also present near-optimal bounds on the memory needed to design winning strategies for each player, in each case."}]},{"year":"2011","date_created":"2018-12-11T12:02:54Z","citation":{"apa":"Cerny, P., Chatterjee, K., &#38; Henzinger, T. A. (2011). The complexity of quantitative information flow problems (pp. 205–217). Presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France: IEEE. <a href=\"https://doi.org/10.1109/CSF.2011.21\">https://doi.org/10.1109/CSF.2011.21</a>","ama":"Cerny P, Chatterjee K, Henzinger TA. The complexity of quantitative information flow problems. In: IEEE; 2011:205-217. doi:<a href=\"https://doi.org/10.1109/CSF.2011.21\">10.1109/CSF.2011.21</a>","ieee":"P. Cerny, K. Chatterjee, and T. A. Henzinger, “The complexity of quantitative information flow problems,” presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France, 2011, pp. 205–217.","short":"P. Cerny, K. Chatterjee, T.A. Henzinger, in:, IEEE, 2011, pp. 205–217.","mla":"Cerny, Pavol, et al. <i>The Complexity of Quantitative Information Flow Problems</i>. IEEE, 2011, pp. 205–17, doi:<a href=\"https://doi.org/10.1109/CSF.2011.21\">10.1109/CSF.2011.21</a>.","ista":"Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217.","chicago":"Cerny, Pavol, Krishnendu Chatterjee, and Thomas A Henzinger. “The Complexity of Quantitative Information Flow Problems,” 205–17. IEEE, 2011. <a href=\"https://doi.org/10.1109/CSF.2011.21\">https://doi.org/10.1109/CSF.2011.21</a>."},"publist_id":"3254","ec_funded":1,"file_date_updated":"2020-07-14T12:46:10Z","_id":"3361","doi":"10.1109/CSF.2011.21","publication_status":"published","ddc":["000","005"],"abstract":[{"text":"In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (based on Shannon entropy)have been introduced to enable more fine-grained reasoning about programs in situations where limited information flow is acceptable. The QIF bounding problem asks whether the information flow in a given program is bounded by a constant $d$. Our first result is that the QIF bounding problem is PSPACE-complete. The QIF memoryless synthesis problem asks whether it is possible to resolve nondeterministic choices in a given partial program in such a way that in the resulting deterministic program, the quantitative information flow is bounded by a given constant $d$. Our second result is that the QIF memoryless synthesis problem is also EXPTIME-complete. The QIF memoryless synthesis problem generalizes to QIF general synthesis problem which does not impose the memoryless requirement (that is, by allowing the synthesized program to have more variables then the original partial program). Our third result is that the QIF general synthesis problem is EXPTIME-hard.","lang":"eng"}],"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"name":"Moderne Concurrency Paradigms","call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"publisher":"IEEE","date_published":"2011-06-27T00:00:00Z","page":"205 - 217","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"quality_controlled":"1","oa":1,"date_updated":"2021-01-12T07:42:56Z","pubrep_id":"81","title":"The complexity of quantitative information flow problems","scopus_import":1,"has_accepted_license":"1","language":[{"iso":"eng"}],"author":[{"first_name":"Pavol","full_name":"Cerny, Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"conference":{"end_date":"2011-06-29","location":"Cernay-la-Ville, France","start_date":"2011-06-27","name":"CSF: Computer Security Foundations"},"month":"06","day":"27","oa_version":"Submitted Version","file":[{"creator":"system","file_size":299069,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_name":"IST-2012-81-v1+1_The_complexity_of_quantitative_information_flow_problems.pdf","file_id":"4792","checksum":"1a25be0c62459fc7640db88af08ff63a","date_updated":"2020-07-14T12:46:10Z","date_created":"2018-12-12T10:10:07Z"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"conference","status":"public"},{"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mathieu","full_name":"Tracol, Mathieu","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87","last_name":"Tracol"}],"publication_status":"submitted","arxiv":1,"day":"01","main_file_link":[{"url":"https://arxiv.org/abs/1104.0127","open_access":"1"}],"external_id":{"arxiv":["1104.0127"]},"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi, and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present a complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words."}],"month":"04","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","call_identifier":"FP7"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"page":"19","publisher":"ArXiv","date_published":"2011-04-01T00:00:00Z","status":"public","type":"preprint","date_created":"2018-12-11T12:02:54Z","title":"The decidability frontier for probabilistic automata on infinite words","publist_id":"3251","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d.","mla":"Chatterjee, Krishnendu, et al. <i>The Decidability Frontier for Probabilistic Automata on Infinite Words</i>. ArXiv.","ista":"Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.","short":"K. Chatterjee, T.A. Henzinger, M. Tracol, (n.d.).","ieee":"K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.","ama":"Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv."},"date_updated":"2020-01-21T13:20:24Z","oa":1,"year":"2011","ec_funded":1,"_id":"3363","language":[{"iso":"eng"}]},{"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"page":"267 - 271","volume":6605,"quality_controlled":"1","publisher":"Springer","date_published":"2011-09-29T00:00:00Z","publication_status":"published","abstract":[{"text":"We present the tool Quasy, a quantitative synthesis tool. Quasy takes qualitative and quantitative specifications and automatically constructs a system that satisfies the qualitative specification and optimizes the quantitative specification, if such a system exists. The user can choose between a system that satisfies and optimizes the specifications (a) under all possible environment behaviors or (b) under the most-likely environment behaviors given as a probability distribution on the possible input sequences. Quasy solves these two quantitative synthesis problems by reduction to instances of 2-player games and Markov Decision Processes (MDPs) with quantitative winning objectives. Quasy can also be seen as a game solver for quantitative games. Most notable, it can solve lexicographic mean-payoff games with 2 players, MDPs with mean-payoff objectives, and ergodic MDPs with mean-payoff parity objectives.","lang":"eng"}],"ddc":["000","005"],"file_date_updated":"2020-07-14T12:46:10Z","_id":"3365","doi":"10.1007/978-3-642-19835-9_24","date_created":"2018-12-11T12:02:55Z","publist_id":"3248","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “QUASY: Quantitative Synthesis Tool,” 6605:267–71. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-19835-9_24\">https://doi.org/10.1007/978-3-642-19835-9_24</a>.","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2011. QUASY: quantitative synthesis tool. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 6605, 267–271.","mla":"Chatterjee, Krishnendu, et al. <i>QUASY: Quantitative Synthesis Tool</i>. Vol. 6605, Springer, 2011, pp. 267–71, doi:<a href=\"https://doi.org/10.1007/978-3-642-19835-9_24\">10.1007/978-3-642-19835-9_24</a>.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2011, pp. 267–271.","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “QUASY: quantitative synthesis tool,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany, 2011, vol. 6605, pp. 267–271.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. QUASY: quantitative synthesis tool. In: Vol 6605. Springer; 2011:267-271. doi:<a href=\"https://doi.org/10.1007/978-3-642-19835-9_24\">10.1007/978-3-642-19835-9_24</a>","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Singh, R. (2011). QUASY: quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-642-19835-9_24\">https://doi.org/10.1007/978-3-642-19835-9_24</a>"},"year":"2011","alternative_title":["LNCS"],"type":"conference","status":"public","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"last_name":"Jobstmann","full_name":"Jobstmann, Barbara","first_name":"Barbara"},{"last_name":"Singh","full_name":"Singh, Rohit","first_name":"Rohit"}],"day":"29","oa_version":"Submitted Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2018-12-12T10:13:37Z","date_updated":"2020-07-14T12:46:10Z","file_name":"IST-2012-77-v1+1_QUASY-_quantitative_synthesis_tool.pdf","file_id":"5022","checksum":"762e52eb296f6dbfbf2a75d98b8ebaee","access_level":"open_access","file_size":475661,"content_type":"application/pdf","relation":"main_file","creator":"system"}],"conference":{"end_date":"2011-04-03","location":"Saarbrucken, Germany","start_date":"2011-03-26","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"month":"09","language":[{"iso":"eng"}],"title":"QUASY: quantitative synthesis tool","oa":1,"pubrep_id":"77","date_updated":"2021-01-12T07:42:58Z","intvolume":"      6605","scopus_import":1,"has_accepted_license":"1"},{"type":"conference","status":"public","alternative_title":["LNCS"],"author":[{"last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","full_name":"Cerny, Pavol"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","first_name":"Arjun","full_name":"Radhakrishna, Arjun"},{"full_name":"Singh, Rohit","first_name":"Rohit","last_name":"Singh"}],"month":"04","conference":{"end_date":"2011-07-20","location":"Snowbird, USA","start_date":"2011-07-14","name":"CAV: Computer Aided Verification"},"file":[{"access_level":"open_access","relation":"main_file","file_size":508946,"content_type":"application/pdf","creator":"system","date_updated":"2020-07-14T12:46:10Z","date_created":"2018-12-12T10:15:51Z","file_id":"5174","checksum":"c033689355f45742dc7c99b5af13ce7a","file_name":"IST-2012-76-v1+1_Quantitative_synthesis_for_concurrent_programs.pdf"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"21","oa_version":"Submitted Version","language":[{"iso":"eng"}],"article_processing_charge":"No","date_updated":"2023-02-23T12:24:01Z","pubrep_id":"76","oa":1,"title":"Quantitative synthesis for concurrent programs","editor":[{"first_name":"Ganesh","full_name":"Gopalakrishnan, Ganesh","last_name":"Gopalakrishnan"},{"last_name":"Qadeer","first_name":"Shaz","full_name":"Qadeer, Shaz"}],"has_accepted_license":"1","intvolume":"      6806","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems"}],"date_published":"2011-04-21T00:00:00Z","publisher":"Springer","volume":6806,"quality_controlled":"1","page":"243 - 259","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publication_status":"published","ddc":["000","004"],"abstract":[{"lang":"eng","text":"We present an algorithmic method for the quantitative, performance-aware synthesis of concurrent programs. The input consists of a nondeterministic partial program and of a parametric performance model. The nondeterminism allows the programmer to omit which (if any) synchronization construct is used at a particular program location. The performance model, specified as a weighted automaton, can capture system architectures by assigning different costs to actions such as locking, context switching, and memory and cache accesses. The quantitative synthesis problem is to automatically resolve the nondeterminism of the partial program so that both correctness is guaranteed and performance is optimal. As is standard for shared memory concurrency, correctness is formalized &quot;specification free&quot;, in particular as race freedom or deadlock freedom. For worst-case (average-case) performance, we show that the problem can be reduced to 2-player graph games (with probabilistic transitions) with quantitative objectives. While we show, using game-theoretic methods, that the synthesis problem is Nexp-complete, we present an algorithmic method and an implementation that works efficiently for concurrent programs and performance models of practical interest. We have implemented a prototype tool and used it to synthesize finite-state concurrent programs that exhibit different programming patterns, for several performance models representing different architectures. "}],"_id":"3366","file_date_updated":"2020-07-14T12:46:10Z","doi":"10.1007/978-3-642-22110-1_20","year":"2011","date_created":"2018-12-11T12:02:55Z","publist_id":"3247","citation":{"short":"P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.","ama":"Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. Quantitative synthesis for concurrent programs. In: Gopalakrishnan G, Qadeer S, eds. Vol 6806. Springer; 2011:243-259. doi:<a href=\"https://doi.org/10.1007/978-3-642-22110-1_20\">10.1007/978-3-642-22110-1_20</a>","ieee":"P. Cerny, K. Chatterjee, T. A. Henzinger, A. Radhakrishna, and R. Singh, “Quantitative synthesis for concurrent programs,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 243–259.","chicago":"Cerny, Pavol, Krishnendu Chatterjee, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. “Quantitative Synthesis for Concurrent Programs.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:243–59. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22110-1_20\">https://doi.org/10.1007/978-3-642-22110-1_20</a>.","mla":"Cerny, Pavol, et al. <i>Quantitative Synthesis for Concurrent Programs</i>. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 243–59, doi:<a href=\"https://doi.org/10.1007/978-3-642-22110-1_20\">10.1007/978-3-642-22110-1_20</a>.","ista":"Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. 2011. Quantitative synthesis for concurrent programs. CAV: Computer Aided Verification, LNCS, vol. 6806, 243–259.","apa":"Cerny, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., &#38; Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan &#38; S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-22110-1_20\">https://doi.org/10.1007/978-3-642-22110-1_20</a>"},"related_material":{"record":[{"relation":"earlier_version","id":"5388","status":"public"}]},"ec_funded":1},{"has_accepted_license":"1","title":"An O(n2) time algorithm for alternating Büchi games","oa":1,"date_updated":"2023-02-23T11:15:12Z","pubrep_id":"15","article_processing_charge":"No","language":[{"iso":"eng"}],"day":"11","oa_version":"Published Version","file":[{"creator":"system","access_level":"open_access","content_type":"application/pdf","file_size":388665,"relation":"main_file","file_name":"IST-2011-0009_IST-2011-0009.pdf","checksum":"0b354264229045d982332fd2cb5b9a26","file_id":"5504","date_created":"2018-12-12T11:53:43Z","date_updated":"2020-07-14T12:46:39Z"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","month":"07","publication_identifier":{"issn":["2664-1690"]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"}],"alternative_title":["IST Austria Technical Report"],"status":"public","type":"technical_report","related_material":{"record":[{"id":"3165","relation":"later_version","status":"public"}]},"citation":{"apa":"Chatterjee, K., &#38; Henzinger, M. H. (2011). <i>An O(n2) time algorithm for alternating Büchi games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0009\">https://doi.org/10.15479/AT:IST-2011-0009</a>","chicago":"Chatterjee, Krishnendu, and Monika H Henzinger. <i>An O(N2) Time Algorithm for Alternating Büchi Games</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0009\">https://doi.org/10.15479/AT:IST-2011-0009</a>.","mla":"Chatterjee, Krishnendu, and Monika H. Henzinger. <i>An O(N2) Time Algorithm for Alternating Büchi Games</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0009\">10.15479/AT:IST-2011-0009</a>.","ista":"Chatterjee K, Henzinger MH. 2011. An O(n2) time algorithm for alternating Büchi games, IST Austria, 20p.","ieee":"K. Chatterjee and M. H. Henzinger, <i>An O(n2) time algorithm for alternating Büchi games</i>. IST Austria, 2011.","ama":"Chatterjee K, Henzinger MH. <i>An O(N2) Time Algorithm for Alternating Büchi Games</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0009\">10.15479/AT:IST-2011-0009</a>","short":"K. Chatterjee, M.H. Henzinger, An O(N2) Time Algorithm for Alternating Büchi Games, IST Austria, 2011."},"date_created":"2018-12-12T11:38:59Z","year":"2011","doi":"10.15479/AT:IST-2011-0009","file_date_updated":"2020-07-14T12:46:39Z","_id":"5379","abstract":[{"lang":"eng","text":"Computing the winning set for Büchi objectives in alternating games on graphs is a central problem in computer aided verification with a large number of applications. The long standing best known upper bound for solving the problem is ̃O(n·m), where n is the number of vertices and m is the number of edges in the graph. We are the first to break the ̃O(n·m) boundary by presenting a new technique that reduces the running time to O(n2). This bound also leads to O(n2) time algorithms for computing the set of almost-sure winning vertices for Büchi objectives (1) in alternating games with probabilistic transitions (improving an earlier bound of O(n·m)), (2) in concurrent graph games with constant actions (improving an earlier bound of O(n3)), and (3) in Markov decision processes (improving for m > n4/3 an earlier bound of O(min(m1.5, m·n2/3)). We also show that the same technique can be used to compute the maximal end-component decomposition of a graph in time O(n2), which is an improvement over earlier bounds for m > n4/3. Finally, we show how to maintain the winning set for Büchi objectives in alternating games under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per operation. This is the first dynamic algorithm for this problem."}],"ddc":["000","004"],"publication_status":"published","page":"20","department":[{"_id":"KrCh"}],"publisher":"IST Austria","date_published":"2011-07-11T00:00:00Z"},{"publication_status":"published","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"}],"publication_identifier":{"issn":["2664-1690"]},"month":"07","ddc":["000"],"file":[{"creator":"system","file_size":500399,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5544","checksum":"0fd38186409be819a911c4990fa79d1f","file_name":"IST-2011-0008_IST-2011-0008.pdf","date_updated":"2020-07-14T12:46:39Z","date_created":"2018-12-12T11:54:22Z"}],"abstract":[{"text":"We consider 2-player games played on a finite state space for an infinite number of rounds.  The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. We study concurrent games with ω-regular winning conditions specified as parity objectives.  We consider the qualitative analysis problems: the computation of the almost-sure and limit-sure winning set of states, where player 1 can ensure to win with probability 1 and with probability arbitrarily close to 1, respectively. In general the almost-sure and limit-sure winning strategies require both infinite-memory as well as infinite-precision (to describe probabilities). We study the bounded-rationality problem for qualitative analysis of concurrent parity games, where the strategy set for player 1 is restricted to bounded-resource strategies.  In terms of precision, strategies can be deterministic, uniform, finite-precision or infinite-precision;  and in terms of memory, strategies can be memoryless, finite-memory or infinite-memory. We present a precise and complete characterization of the qualitative winning sets for all combinations of classes of strategies. In particular, we show that uniform memoryless strategies are as powerful as finite-precision infinite-memory strategies, and infinite-precision memoryless strategies are as powerful as infinite-precision finite-memory strategies.  We show that the winning sets can be computed in O(n2d+3) time, where n is the size of the game structure and 2d is the number of priorities (or colors), and our algorithms are symbolic. The membership problem of whether a state belongs to a winning set can be decided in NP ∩ coNP. While this complexity is the same as for the simpler class of turn-based parity games, where in each state only one of the two players has a choice of moves, our algorithms,that are obtained by characterization of the winning sets as μ-calculus formulas, are considerably more involved than those for turn-based games.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"11","oa_version":"Published Version","type":"technical_report","status":"public","date_published":"2011-07-11T00:00:00Z","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"page":"53","department":[{"_id":"KrCh"}],"year":"2011","oa":1,"date_updated":"2023-02-23T11:22:53Z","pubrep_id":"16","title":"Bounded rationality in concurrent parity games","citation":{"apa":"Chatterjee, K. (2011). <i>Bounded rationality in concurrent parity games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0008\">https://doi.org/10.15479/AT:IST-2011-0008</a>","chicago":"Chatterjee, Krishnendu. <i>Bounded Rationality in Concurrent Parity Games</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0008\">https://doi.org/10.15479/AT:IST-2011-0008</a>.","ista":"Chatterjee K. 2011. Bounded rationality in concurrent parity games, IST Austria, 53p.","mla":"Chatterjee, Krishnendu. <i>Bounded Rationality in Concurrent Parity Games</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0008\">10.15479/AT:IST-2011-0008</a>.","short":"K. Chatterjee, Bounded Rationality in Concurrent Parity Games, IST Austria, 2011.","ama":"Chatterjee K. <i>Bounded Rationality in Concurrent Parity Games</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0008\">10.15479/AT:IST-2011-0008</a>","ieee":"K. Chatterjee, <i>Bounded rationality in concurrent parity games</i>. IST Austria, 2011."},"date_created":"2018-12-12T11:39:00Z","has_accepted_license":"1","related_material":{"record":[{"status":"public","id":"3338","relation":"later_version"}]},"_id":"5380","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:39Z","doi":"10.15479/AT:IST-2011-0008"},{"has_accepted_license":"1","related_material":{"record":[{"relation":"later_version","id":"1903","status":"public"},{"status":"public","id":"2211","relation":"later_version"},{"relation":"later_version","id":"2955","status":"public"}]},"date_created":"2018-12-12T11:39:00Z","citation":{"mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">10.15479/AT:IST-2011-0007</a>.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">https://doi.org/10.15479/AT:IST-2011-0007</a>.","ista":"Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to win when belief fails, IST Austria, 43p.","short":"K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win When Belief Fails, IST Austria, 2011.","ieee":"K. Chatterjee and L. Doyen, <i>Partial-observation stochastic games: How to win when belief fails</i>. IST Austria, 2011.","ama":"Chatterjee K, Doyen L. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">10.15479/AT:IST-2011-0007</a>","apa":"Chatterjee, K., &#38; Doyen, L. (2011). <i>Partial-observation stochastic games: How to win when belief fails</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">https://doi.org/10.15479/AT:IST-2011-0007</a>"},"title":"Partial-observation stochastic games: How to win when belief fails","year":"2011","oa":1,"date_updated":"2023-02-23T11:05:48Z","pubrep_id":"17","doi":"10.15479/AT:IST-2011-0007","language":[{"iso":"eng"}],"_id":"5381","file_date_updated":"2020-07-14T12:46:39Z","file":[{"date_created":"2018-12-12T11:53:27Z","date_updated":"2020-07-14T12:46:39Z","checksum":"06bf6dfc97f6006e3fd0e9a3f31bc961","file_id":"5488","file_name":"IST-2011-0007_IST-2011-0007.pdf","relation":"main_file","file_size":574055,"access_level":"open_access","content_type":"application/pdf","creator":"system"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"In two-player finite-state stochastic games of partial obser- vation on graphs, in every state of the graph, the players simultaneously choose an action, and their joint actions determine a probability distri- bution over the successor states. The game is played for infinitely many rounds and thus the players construct an infinite path in the graph. We consider reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1) or pos- itively (i.e., with positive probability), no matter the strategy of the second player.\r\n\r\nWe classify such games according to the information and to the power of randomization available to the players. On the basis of information, the game can be one-sided with either (a) player 1, or (b) player 2 having partial observation (and the other player has perfect observation), or two- sided with (c) both players having partial observation. On the basis of randomization, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization.\r\n\r\nOur main results for pure strategies are as follows: (1) For one-sided games with player 2 perfect observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strate- gies are not sufficient, and present an exponential upper bound on mem- ory both for almost-sure and positive winning strategies; we show that the problem of deciding the existence of almost-sure and positive winning strategies for player 1 is EXPTIME-complete and present symbolic algo- rithms that avoid the explicit exponential construction. (2) For one-sided games with player 1 perfect observation we show that non-elementary memory is both necessary and sufficient for both almost-sure and posi- tive winning strategies. (3) We show that for the general (two-sided) case finite-memory strategies are sufficient for both positive and almost-sure winning, and at least non-elementary memory is required. We establish the equivalence of the almost-sure winning problems for pure strategies and for randomized strategies with actions invisible. Our equivalence re- sult exhibit serious flaws in previous results in the literature: we show a non-elementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed.","lang":"eng"}],"oa_version":"Published Version","day":"05","publication_identifier":{"issn":["2664-1690"]},"month":"07","ddc":["000","005"],"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"publication_status":"published","department":[{"_id":"KrCh"}],"page":"43","status":"public","date_published":"2011-07-05T00:00:00Z","type":"technical_report","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"]}]