[{"intvolume":"      6945","day":"15","publisher":"Springer","year":"2011","citation":{"mla":"Chatterjee, Krishnendu. “Graph Games with Reachability Objectives.” <i>5th International Workshop on Reachability Problems</i>, 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>.","short":"K. Chatterjee, in:, 5th International Workshop on Reachability Problems, Springer, 2011, pp. 1–1.","chicago":"Chatterjee, Krishnendu. “Graph Games with Reachability Objectives.” In <i>5th International Workshop on Reachability Problems</i>, 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>.","ieee":"K. Chatterjee, “Graph games with reachability objectives,” in <i>5th International Workshop on Reachability Problems</i>, Genoa, Italy, 2011, vol. 6945, pp. 1–1.","apa":"Chatterjee, K. (2011). Graph games with reachability objectives. In <i>5th International Workshop on Reachability Problems</i> (Vol. 6945, pp. 1–1). 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: <i>5th International Workshop on Reachability Problems</i>. 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>","ista":"Chatterjee K. 2011. Graph games with reachability objectives. 5th International Workshop on Reachability Problems. RP: Reachability Problems, LNCS, vol. 6945, 1–1."},"status":"public","_id":"3344","oa_version":"None","date_published":"2011-10-15T00:00:00Z","OA_type":"closed access","fulldoi":"https://doi.org/10.1007/978-3-642-24288-5_1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"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.","lang":"eng"}],"publist_id":"3277","alternative_title":["LNCS"],"date_updated":"2025-05-20T06:00:59Z","quality_controlled":"1","article_processing_charge":"No","date_created":"2018-12-11T12:02:47Z","month":"10","page":"1 - 1","publication_status":"published","volume":6945,"department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"title":"Graph games with reachability objectives","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783642242885"]},"type":"conference","doi":"10.1007/978-3-642-24288-5_1","publication":"5th International Workshop on Reachability Problems","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"conference":{"end_date":"2011-09-30","name":"RP: Reachability Problems","location":"Genoa, Italy","start_date":"2011-09-28"},"corr_author":"1"},{"oa_version":"Preprint","status":"public","_id":"3345","publisher":"Springer","year":"2011","citation":{"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>.","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>.","short":"K. Chatterjee, L. Doyen, in:, Springer, 2011, pp. 206–218.","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.","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>","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.","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>"},"arxiv":1,"day":"28","intvolume":"      6907","external_id":{"arxiv":["1104.2909"]},"publist_id":"3276","alternative_title":["LNCS"],"date_updated":"2023-02-23T12:23:59Z","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."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1007/978-3-642-22993-0_21","date_published":"2011-09-28T00:00:00Z","publication_status":"published","volume":6907,"language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"page":"206 - 218","month":"09","date_created":"2018-12-11T12:02:48Z","quality_controlled":"1","related_material":{"record":[{"relation":"earlier_version","id":"5387","status":"public"}]},"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"}],"scopus_import":1,"conference":{"location":"Warsaw, Poland","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2011-08-26","start_date":"2011-08-22"},"author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"}],"type":"conference","main_file_link":[{"url":"http://arxiv.org/abs/1104.2909","open_access":"1"}],"doi":"10.1007/978-3-642-22993-0_21","oa":1,"title":"Energy and mean-payoff parity Markov Decision Processes"},{"publist_id":"3275","date_updated":"2025-09-30T09:07:47Z","abstract":[{"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.","lang":"eng"}],"ec_funded":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","fulldoi":"https://doi.org/10.1109/LICS.2011.10","date_published":"2011-06-21T00:00:00Z","oa_version":"Submitted Version","status":"public","_id":"3346","citation":{"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>.","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>.","short":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, in:, IEEE, 2011.","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.","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>"},"year":"2011","publisher":"IEEE","arxiv":1,"day":"21","isi":1,"external_id":{"arxiv":["1104.3489"],"isi":["000297350400006"]},"scopus_import":"1","conference":{"end_date":"2011-06-24","name":"LICS: Logic in Computer Science","location":"Toronto, Canada","start_date":"2011-06-21"},"author":[{"first_name":"Tomáš","last_name":"Brázdil","full_name":"Brázdil, Tomáš"},{"last_name":"Brožek","full_name":"Brožek, Václav","first_name":"Václav"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Vojtěch","last_name":"Forejt","full_name":"Forejt, Vojtěch"},{"full_name":"Kučera, Antonín","last_name":"Kučera","first_name":"Antonín"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.3489"}],"doi":"10.1109/LICS.2011.10","type":"conference","oa":1,"title":"Two views on multiple mean payoff objectives in Markov Decision Processes","article_number":"5970225","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"publication_status":"published","month":"06","date_created":"2018-12-11T12:02:48Z","article_processing_charge":"No","quality_controlled":"1","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}]},{"oa_version":"Preprint","status":"public","_id":"3347","year":"2011","citation":{"ista":"Chatterjee K, Fijalkow N. 2011. Finitary languages. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 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>","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>","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.","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."},"publisher":"Springer","arxiv":1,"day":"16","intvolume":"      6638","external_id":{"arxiv":["1101.1727"]},"alternative_title":["LNCS"],"publist_id":"3274","date_updated":"2024-10-09T20:54:28Z","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"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1007/978-3-642-21254-3_16","date_published":"2011-06-16T00:00:00Z","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"volume":6638,"publication_status":"published","page":"216 - 226","month":"06","date_created":"2018-12-11T12:02:48Z","quality_controlled":"1","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"scopus_import":1,"corr_author":"1","conference":{"end_date":"2011-05-31","name":"LATA: Language and Automata Theory and Applications","location":"Tarragona, Spain","start_date":"2011-05-26"},"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Fijalkow","id":"A1B5DD72-E997-11E9-8398-E808B6C6ADC0","full_name":"Fijalkow, Nathanaël","first_name":"Nathanaël"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1101.1727"}],"doi":"10.1007/978-3-642-21254-3_16","type":"conference","title":"Finitary languages","oa":1},{"title":"Synthesis of memory efficient real time controllers for safety objectives","oa":1,"type":"conference","main_file_link":[{"url":"http://arxiv.org/abs/1101.5842","open_access":"1"}],"doi":"10.1145/1967701.1967734","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"first_name":"Vinayak","last_name":"Prabhu","full_name":"Prabhu, Vinayak"}],"conference":{"end_date":"2011-04-14","name":"HSCC: Hybrid Systems - Computation and Control","location":"Chicago, USA","start_date":"2011-04-12"},"corr_author":"1","scopus_import":"1","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"}],"quality_controlled":"1","article_processing_charge":"No","date_created":"2018-12-11T12:02:49Z","month":"01","page":"221 - 230","publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"date_published":"2011-01-31T00:00:00Z","fulldoi":"https://doi.org/10.1145/1967701.1967734","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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"}],"publist_id":"3273","date_updated":"2025-06-11T08:11:56Z","external_id":{"arxiv":["1101.5842"]},"arxiv":1,"day":"31","publisher":"Springer","citation":{"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>.","short":"K. Chatterjee, V. Prabhu, in:, Springer, 2011, pp. 221–230.","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>.","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.","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>","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>","ista":"Chatterjee K, Prabhu V. 2011. Synthesis of memory efficient real time controllers for safety objectives. HSCC: Hybrid Systems - Computation and Control, 221–230."},"year":"2011","_id":"3348","status":"public","oa_version":"Submitted Version"},{"page":"74 - 86","publication_status":"published","volume":54,"department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"month":"06","article_processing_charge":"No","date_created":"2018-12-11T12:02:49Z","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"conference":{"start_date":"2011-06-15","end_date":"2011-06-17","name":"GandALF: Games, Automata, Logic, and Formal Verification","location":"Minori, Italy"},"corr_author":"1","scopus_import":"1","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"last_name":"Fijalkow","full_name":"Fijalkow, Nathanaël","first_name":"Nathanaël"}],"oa":1,"title":"A reduction from parity games to simple stochastic games","type":"conference","doi":"10.4204/EPTCS.54.6","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1106.1232"}],"status":"public","_id":"3349","oa_version":"Submitted Version","day":"04","arxiv":1,"publisher":"EPTCS","citation":{"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.","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>","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>","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.","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>.","short":"K. Chatterjee, N. Fijalkow, in:, EPTCS, 2011, pp. 74–86.","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>."},"year":"2011","external_id":{"arxiv":["1106.1232"]},"intvolume":"        54","date_updated":"2025-06-11T08:12:12Z","publist_id":"3272","alternative_title":["EPTCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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"}],"date_published":"2011-06-04T00:00:00Z","fulldoi":"https://doi.org/10.4204/EPTCS.54.6"},{"publist_id":"3271","alternative_title":["LNCS"],"date_updated":"2021-01-12T07:42:51Z","abstract":[{"lang":"eng","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."}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1007/978-3-642-24310-3_11","date_published":"2011-01-01T00:00:00Z","editor":[{"first_name":"Uli","last_name":"Fahrenberg","full_name":"Fahrenberg, Uli"},{"first_name":"Stavros","last_name":"Tripakis","full_name":"Tripakis, Stavros"}],"oa_version":"None","status":"public","_id":"3350","publisher":"Springer","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>","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.","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.","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>","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>.","short":"K. Chatterjee, R. Majumdar, in:, U. Fahrenberg, S. Tripakis (Eds.), Springer, 2011, pp. 145–159.","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>."},"year":"2011","day":"01","intvolume":"      6919","scopus_import":1,"conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems","end_date":"2011-09-23","location":"Aalborg, Denmark","start_date":"2011-09-21"},"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Majumdar","full_name":"Majumdar, Ritankar","first_name":"Ritankar"}],"type":"conference","doi":"10.1007/978-3-642-24310-3_11","title":"Minimum attention controller synthesis for omega regular objectives","publication_status":"published","department":[{"_id":"KrCh"}],"volume":6919,"language":[{"iso":"eng"}],"page":"145 - 159","month":"01","date_created":"2018-12-11T12:02:49Z","quality_controlled":"1","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}]},{"intvolume":"      6914","external_id":{"arxiv":["1104.3211"]},"editor":[{"first_name":"Olaf","full_name":"Owe, Olaf","last_name":"Owe"},{"first_name":"Martin","last_name":"Steffen","full_name":"Steffen, Martin"},{"last_name":"Telle","full_name":"Telle, Jan Arne","first_name":"Jan Arne"}],"oa_version":"Submitted Version","status":"public","_id":"3351","year":"2011","citation":{"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>.","short":"K. Chatterjee, L. Doyen, R. Singh, in:, O. Owe, M. Steffen, J.A. Telle (Eds.), Springer, 2011, pp. 148–159.","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>.","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.","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>","ista":"Chatterjee K, Doyen L, Singh R. 2011. On memoryless quantitative objectives. FCT: Fundamentals of Computation Theory, LNCS, vol. 6914, 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>"},"publisher":"Springer","arxiv":1,"day":"16","fulldoi":"https://doi.org/10.1007/978-3-642-22953-4_13","date_published":"2011-04-16T00:00:00Z","publist_id":"3270","alternative_title":["LNCS"],"date_updated":"2025-06-11T08:12:32Z","abstract":[{"lang":"eng","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."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:02:50Z","article_processing_charge":"No","quality_controlled":"1","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"language":[{"iso":"eng"}],"volume":6914,"department":[{"_id":"KrCh"}],"publication_status":"published","page":"148 - 159","month":"04","doi":"10.1007/978-3-642-22953-4_13","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.3211"}],"type":"conference","oa":1,"title":"On memoryless quantitative objectives","scopus_import":"1","conference":{"start_date":"2011-08-22","location":"Oslo, Norway","end_date":"2011-08-25","name":"FCT: Fundamentals of Computation Theory"},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"full_name":"Singh, Rohit","last_name":"Singh","first_name":"Rohit"}]},{"issue":"10","external_id":{"isi":["000296022500019"]},"intvolume":"        54","isi":1,"day":"01","publisher":"ACM","citation":{"ama":"Fisher J, Harel D, Henzinger TA. Biology as reactivity. <i>Communications of the ACM</i>. 2011;54(10):72-82. doi:<a href=\"https://doi.org/10.1145/2001269.2001289\">10.1145/2001269.2001289</a>","ista":"Fisher J, Harel D, Henzinger TA. 2011. Biology as reactivity. Communications of the ACM. 54(10), 72–82.","ieee":"J. Fisher, D. Harel, and T. A. Henzinger, “Biology as reactivity,” <i>Communications of the ACM</i>, vol. 54, no. 10. ACM, pp. 72–82, 2011.","apa":"Fisher, J., Harel, D., &#38; Henzinger, T. A. (2011). Biology as reactivity. <i>Communications of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2001269.2001289\">https://doi.org/10.1145/2001269.2001289</a>","chicago":"Fisher, Jasmin, David Harel, and Thomas A Henzinger. “Biology as Reactivity.” <i>Communications of the ACM</i>. ACM, 2011. <a href=\"https://doi.org/10.1145/2001269.2001289\">https://doi.org/10.1145/2001269.2001289</a>.","mla":"Fisher, Jasmin, et al. “Biology as Reactivity.” <i>Communications of the ACM</i>, vol. 54, no. 10, ACM, 2011, pp. 72–82, doi:<a href=\"https://doi.org/10.1145/2001269.2001289\">10.1145/2001269.2001289</a>.","short":"J. Fisher, D. Harel, T.A. Henzinger, Communications of the ACM 54 (2011) 72–82."},"year":"2011","status":"public","_id":"3352","oa_version":"None","date_published":"2011-10-01T00:00:00Z","fulldoi":"https://doi.org/10.1145/2001269.2001289","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"lang":"eng","text":"Exploring the connection of biology with reactive systems to better understand living systems."}],"ec_funded":1,"publist_id":"3267","date_updated":"2025-09-30T09:06:32Z","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"}],"quality_controlled":"1","article_processing_charge":"No","date_created":"2018-12-11T12:02:50Z","month":"10","page":"72 - 82","publication_status":"published","department":[{"_id":"ToHe"}],"volume":54,"language":[{"iso":"eng"}],"title":"Biology as reactivity","type":"journal_article","doi":"10.1145/2001269.2001289","publication":"Communications of the ACM","author":[{"last_name":"Fisher","full_name":"Fisher, Jasmin","first_name":"Jasmin"},{"last_name":"Harel","full_name":"Harel, David","first_name":"David"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"scopus_import":"1"},{"file":[{"creator":"system","date_updated":"2020-07-14T12:46:09Z","content_type":"application/pdf","relation":"main_file","checksum":"4dc8750ab7921f51de992000b13d1b01","access_level":"open_access","file_size":272017,"date_created":"2018-12-12T10:07:49Z","file_name":"IST-2012-84-v1+1_Quantitative_evaluation_of_BFT_protocols.pdf","file_id":"4648"}],"year":"2011","citation":{"mla":"Halalai, Raluca, et al. <i>Quantitative Evaluation of BFT Protocols</i>. IEEE, 2011, pp. 255–64, doi:<a href=\"https://doi.org/10.1109/QEST.2011.40\">10.1109/QEST.2011.40</a>.","short":"R. Halalai, T.A. Henzinger, V. Singh, in:, IEEE, 2011, pp. 255–264.","chicago":"Halalai, Raluca, Thomas A Henzinger, and Vasu Singh. “Quantitative Evaluation of BFT Protocols,” 255–64. IEEE, 2011. <a href=\"https://doi.org/10.1109/QEST.2011.40\">https://doi.org/10.1109/QEST.2011.40</a>.","apa":"Halalai, R., Henzinger, T. A., &#38; Singh, V. (2011). Quantitative evaluation of BFT protocols (pp. 255–264). Presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany: IEEE. <a href=\"https://doi.org/10.1109/QEST.2011.40\">https://doi.org/10.1109/QEST.2011.40</a>","ieee":"R. Halalai, T. A. Henzinger, and V. Singh, “Quantitative evaluation of BFT protocols,” presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany, 2011, pp. 255–264.","ama":"Halalai R, Henzinger TA, Singh V. Quantitative evaluation of BFT protocols. In: IEEE; 2011:255-264. doi:<a href=\"https://doi.org/10.1109/QEST.2011.40\">10.1109/QEST.2011.40</a>","ista":"Halalai R, Henzinger TA, Singh V. 2011. Quantitative evaluation of BFT protocols. QEST: Quantitative Evaluation of Systems, 255–264."},"publisher":"IEEE","day":"13","oa_version":"Submitted Version","_id":"3355","status":"public","fulldoi":"https://doi.org/10.1109/QEST.2011.40","ddc":["000","004"],"has_accepted_license":"1","date_published":"2011-10-13T00:00:00Z","abstract":[{"text":"Byzantine Fault Tolerant (BFT) protocols aim to improve the reliability of distributed systems. They enable systems to tolerate arbitrary failures in a bounded number of nodes. BFT protocols are usually proven correct for certain safety and liveness properties. However, recent studies have shown that the performance of state-of-the-art BFT protocols decreases drastically in the presence of even a single malicious node. This motivates a formal quantitative analysis of BFT protocols to investigate their performance characteristics under different scenarios. We present HyPerf, a new hybrid methodology based on model checking and simulation techniques for evaluating the performance of BFT protocols. We build a transition system corresponding to a BFT protocol and systematically explore the set of behaviors allowed by the protocol. We associate certain timing information with different operations in the protocol, like cryptographic operations and message transmission. After an elaborate state exploration, we use the time information to evaluate the performance characteristics of the protocol using simulation techniques. We integrate our framework in Mace, a tool for building and verifying distributed systems. We evaluate the performance of PBFT using our framework. We describe two different use-cases of our methodology. For the benign operation of the protocol, we use the time information as random variables to compute the probability distribution of the execution times. In the presence of faults, we estimate the worst-case performance of the protocol for various attacks that can be employed by malicious nodes. Our results show the importance of hybrid techniques in systematically analyzing the performance of large-scale systems.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:09Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-09T20:54:27Z","publist_id":"3260","quality_controlled":"1","date_created":"2018-12-11T12:02:51Z","month":"10","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"pubrep_id":"84","publication_status":"published","page":"255 - 264","doi":"10.1109/QEST.2011.40","type":"conference","oa":1,"title":"Quantitative evaluation of BFT protocols","author":[{"full_name":"Halalai, Raluca","last_name":"Halalai","id":"584C6850-E996-11E9-805B-F01764644770","first_name":"Raluca"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"first_name":"Vasu","full_name":"Singh, Vasu","last_name":"Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":1,"corr_author":"1","conference":{"start_date":"2011-09-05","name":"QEST: Quantitative Evaluation of Systems","end_date":"2011-09-08","location":"Aachen, Germany"}},{"month":"01","page":"227 - 237","publication_status":"published","language":[{"iso":"eng"}],"volume":6638,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"quality_controlled":"1","date_created":"2018-12-11T12:02:52Z","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"full_name":"Horn, Florian","last_name":"Horn","id":"37327ACE-F248-11E8-B48F-1D18A9856A87","first_name":"Florian"}],"conference":{"name":"LATA: Language and Automata Theory and Applications","end_date":"2011-05-31","location":"Tarragona, Spain","start_date":"2011-05-26"},"corr_author":"1","scopus_import":1,"title":"The complexity of request-response games","type":"conference","doi":"10.1007/978-3-642-21254-3_17","day":"01","publisher":"Springer","year":"2011","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>","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.","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.","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>","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>.","short":"K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 227–237.","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>."},"_id":"3357","status":"public","editor":[{"first_name":"Adrian-Horia","full_name":"Dediu, Adrian-Horia","last_name":"Dediu"},{"last_name":"Inenaga","full_name":"Inenaga, Shunsuke","first_name":"Shunsuke"},{"full_name":"Martín-Vide, Carlos","last_name":"Martín-Vide","first_name":"Carlos"}],"oa_version":"None","intvolume":"      6638","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."}],"alternative_title":["LNCS"],"date_updated":"2024-10-09T20:54:27Z","publist_id":"3258","date_published":"2011-01-01T00:00:00Z","fulldoi":"https://doi.org/10.1007/978-3-642-21254-3_17"},{"article_processing_charge":"No","date_created":"2018-12-11T12:02:53Z","quality_controlled":"1","publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"page":"329 - 342","month":"04","type":"conference","main_file_link":[{"open_access":"1","url":"http://cs.nyu.edu/wies/publ/scheduling_large_jobs_by_abstraction_refinement.pdf"}],"doi":"10.1145/1966445.1966476","title":"Scheduling large jobs by abstraction refinement","oa":1,"scopus_import":"1","conference":{"end_date":"2011-04-13","name":"EuroSys","location":"Salzburg, Austria","start_date":"2011-04-10"},"corr_author":"1","author":[{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"last_name":"Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","full_name":"Singh, Vasu","first_name":"Vasu"},{"full_name":"Wies, Thomas","last_name":"Wies","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas"},{"last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","first_name":"Damien"}],"oa_version":"Published Version","status":"public","_id":"3358","publisher":"ACM","citation":{"chicago":"Henzinger, Thomas A, Vasu Singh, Thomas Wies, and Damien Zufferey. “Scheduling Large Jobs by Abstraction Refinement,” 329–42. ACM, 2011. <a href=\"https://doi.org/10.1145/1966445.1966476\">https://doi.org/10.1145/1966445.1966476</a>.","mla":"Henzinger, Thomas A., et al. <i>Scheduling Large Jobs by Abstraction Refinement</i>. ACM, 2011, pp. 329–42, doi:<a href=\"https://doi.org/10.1145/1966445.1966476\">10.1145/1966445.1966476</a>.","short":"T.A. Henzinger, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2011, pp. 329–342.","ama":"Henzinger TA, Singh V, Wies T, Zufferey D. Scheduling large jobs by abstraction refinement. In: ACM; 2011:329-342. doi:<a href=\"https://doi.org/10.1145/1966445.1966476\">10.1145/1966445.1966476</a>","ista":"Henzinger TA, Singh V, Wies T, Zufferey D. 2011. Scheduling large jobs by abstraction refinement. EuroSys, 329–342.","apa":"Henzinger, T. A., Singh, V., Wies, T., &#38; Zufferey, D. (2011). Scheduling large jobs by abstraction refinement (pp. 329–342). Presented at the EuroSys, Salzburg, Austria: ACM. <a href=\"https://doi.org/10.1145/1966445.1966476\">https://doi.org/10.1145/1966445.1966476</a>","ieee":"T. A. Henzinger, V. Singh, T. Wies, and D. Zufferey, “Scheduling large jobs by abstraction refinement,” presented at the EuroSys, Salzburg, Austria, 2011, pp. 329–342."},"year":"2011","day":"10","fulldoi":"https://doi.org/10.1145/1966445.1966476","date_published":"2011-04-10T00:00:00Z","ddc":["000"],"date_updated":"2026-06-18T18:44:21Z","publist_id":"3257","abstract":[{"text":"The static scheduling problem often arises as a fundamental problem in real-time systems and grid computing. We consider the problem of statically scheduling a large job expressed as a task graph on a large number of computing nodes, such as a data center. This paper solves the large-scale static scheduling problem using abstraction refinement, a technique commonly used in formal verification to efficiently solve computationally hard problems. A scheduler based on abstraction refinement first attempts to solve the scheduling problem with abstract representations of the job and the computing resources. As abstract representations are generally small, the scheduling can be done reasonably fast. If the obtained schedule does not meet specified quality conditions (like data center utilization or schedule makespan) then the scheduler refines the job and data center abstractions and, again solves the scheduling problem. We develop different schedulers based on abstraction refinement. We implemented these schedulers and used them to schedule task graphs from various computing domains on simulated data centers with realistic topologies. We compared the speed of scheduling and the quality of the produced schedules with our abstraction refinement schedulers against a baseline scheduler that does not use any abstraction. We conclude that abstraction refinement techniques give a significant speed-up compared to traditional static scheduling heuristics, at a reasonable cost in the quality of the produced schedules. We further used our static schedulers in an actual system that we deployed on Amazon EC2 and compared it against the Hadoop dynamic scheduler for large MapReduce jobs. Our experiments indicate that there is great potential for static scheduling techniques.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"date_updated":"2024-10-21T06:03:04Z","conference":{"name":"EMSOFT: Embedded Software ","end_date":"2011-10-14","location":"Taipei; Taiwan","start_date":"2011-10-09"},"publist_id":"3256","corr_author":"1","scopus_import":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"abstract":[{"lang":"eng","text":"Motivated by improvements in constraint-solving technology and by the increase of routinely available computational power, partial-program synthesis is emerging as an effective approach for increasing programmer productivity. The goal of the approach is to allow the programmer to specify a part of her intent imperatively (that is, give a partial program) and a part of her intent declaratively, by specifying which conditions need to be achieved or maintained. The task of the synthesizer is to construct a program that satisfies the specification. As an example, consider a partial program where threads access shared data without using any synchronization mechanism, and a declarative specification that excludes data races and deadlocks. The task of the synthesizer is then to place locks into the program code in order for the program to meet the specification.\r\n\r\nIn this paper, we argue that quantitative objectives are needed in partial-program synthesis in order to produce higher-quality programs, while enabling simpler specifications. Returning to the example, the synthesizer could construct a naive solution that uses one global lock for shared data. This can be prevented either by constraining the solution space further (which is error-prone and partly defeats the point of synthesis), or by optimizing a quantitative objective that models performance. Other quantitative notions useful in synthesis include fault tolerance, robustness, resource (memory, power) consumption, and information flow."}],"author":[{"first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","full_name":"Cerny, Pavol"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A"}],"title":"From boolean to quantitative synthesis","date_published":"2011-10-09T00:00:00Z","type":"conference","fulldoi":"https://doi.org/10.1145/2038642.2038666","doi":"10.1145/2038642.2038666","_id":"3359","status":"public","page":"149 - 154","publication_status":"published","oa_version":"None","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"month":"10","day":"09","publisher":"ACM","acknowledgement":"This work was partially supported by the ERC Advanced Grant QUAREM, the FWF NFN Grant S11402-N23 (RiSE), and the EU NOE Grant ArtistDesign.","citation":{"chicago":"Cerny, Pavol, and Thomas A Henzinger. “From Boolean to Quantitative Synthesis,” 149–54. ACM, 2011. <a href=\"https://doi.org/10.1145/2038642.2038666\">https://doi.org/10.1145/2038642.2038666</a>.","mla":"Cerny, Pavol, and Thomas A. Henzinger. <i>From Boolean to Quantitative Synthesis</i>. ACM, 2011, pp. 149–54, doi:<a href=\"https://doi.org/10.1145/2038642.2038666\">10.1145/2038642.2038666</a>.","short":"P. Cerny, T.A. Henzinger, in:, ACM, 2011, pp. 149–154.","ista":"Cerny P, Henzinger TA. 2011. From boolean to quantitative synthesis. EMSOFT: Embedded Software , 149–154.","ama":"Cerny P, Henzinger TA. From boolean to quantitative synthesis. In: ACM; 2011:149-154. doi:<a href=\"https://doi.org/10.1145/2038642.2038666\">10.1145/2038642.2038666</a>","apa":"Cerny, P., &#38; Henzinger, T. A. (2011). From boolean to quantitative synthesis (pp. 149–154). Presented at the EMSOFT: Embedded Software , Taipei; Taiwan: ACM. <a href=\"https://doi.org/10.1145/2038642.2038666\">https://doi.org/10.1145/2038642.2038666</a>","ieee":"P. Cerny and T. A. Henzinger, “From boolean to quantitative synthesis,” presented at the EMSOFT: Embedded Software , Taipei; Taiwan, 2011, pp. 149–154."},"year":"2011","date_created":"2018-12-11T12:02:53Z","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems"}],"quality_controlled":"1"},{"author":[{"first_name":"Udi","last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A"}],"scopus_import":1,"conference":{"location":"Bergen, Norway","name":"CSL: Computer Science Logic","end_date":"2011-09-15","start_date":"2011-09-12"},"type":"conference","doi":"10.4230/LIPIcs.CSL.2011.82","title":"Determinizing discounted-sum automata","oa":1,"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","month":"08","pubrep_id":"82","publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"volume":12,"page":"82 - 96","quality_controlled":"1","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","call_identifier":"FP7"}],"date_created":"2018-12-11T12:02:53Z","ec_funded":1,"abstract":[{"lang":"eng","text":"A discounted-sum automaton (NDA) is a nondeterministic finite automaton with edge weights, which values a run by the discounted sum of visited edge weights. More precisely, the weight in the i-th position of the run is divided by lambda^i, where the discount factor lambda is a fixed rational number greater than 1. Discounted summation is a common and useful measuring scheme, especially for infinite sequences, which reflects the assumption that earlier weights are more important than later weights. Determinizing automata is often essential, for example, in formal verification, where there are polynomial algorithms for comparing two deterministic NDAs, while the equivalence problem for NDAs is not known to be decidable. Unfortunately, however, discounted-sum automata are, in general, not determinizable: it is currently known that for every rational discount factor 1 &lt; lambda &lt; 2, there is an NDA with lambda (denoted lambda-NDA) that cannot be determinized. We provide positive news, showing that every NDA with an integral factor is determinizable. We also complete the picture by proving that the integers characterize exactly the discount factors that guarantee determinizability: we show that for every non-integral rational factor lambda, there is a nondeterminizable lambda-NDA. Finally, we prove that the class of NDAs with integral discount factors enjoys closure under the algebraic operations min, max, addition, and subtraction, which is not the case for general NDAs nor for deterministic NDAs. This shows that for integral discount factors, the class of NDAs forms an attractive specification formalism in quantitative formal verification. All our results hold equally for automata over finite words and for automata over infinite words. "}],"file_date_updated":"2020-07-14T12:46:10Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"3255","date_updated":"2021-01-12T07:42:56Z","alternative_title":["LIPIcs"],"tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","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)"},"fulldoi":"https://doi.org/10.4230/LIPIcs.CSL.2011.82","has_accepted_license":"1","date_published":"2011-08-31T00:00:00Z","ddc":["004"],"publisher":"Springer","year":"2011","citation":{"ista":"Boker U, Henzinger TA. 2011. Determinizing discounted-sum automata. CSL: Computer Science Logic, LIPIcs, vol. 12, 82–96.","ama":"Boker U, Henzinger TA. Determinizing discounted-sum automata. In: Vol 12. Springer; 2011:82-96. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2011.82\">10.4230/LIPIcs.CSL.2011.82</a>","ieee":"U. Boker and T. A. Henzinger, “Determinizing discounted-sum automata,” presented at the CSL: Computer Science Logic, Bergen, Norway, 2011, vol. 12, pp. 82–96.","apa":"Boker, U., &#38; Henzinger, T. A. (2011). Determinizing discounted-sum automata (Vol. 12, pp. 82–96). Presented at the CSL: Computer Science Logic, Bergen, Norway: Springer. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2011.82\">https://doi.org/10.4230/LIPIcs.CSL.2011.82</a>","chicago":"Boker, Udi, and Thomas A Henzinger. “Determinizing Discounted-Sum Automata,” 12:82–96. Springer, 2011. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2011.82\">https://doi.org/10.4230/LIPIcs.CSL.2011.82</a>.","short":"U. Boker, T.A. Henzinger, in:, Springer, 2011, pp. 82–96.","mla":"Boker, Udi, and Thomas A. Henzinger. <i>Determinizing Discounted-Sum Automata</i>. Vol. 12, Springer, 2011, pp. 82–96, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2011.82\">10.4230/LIPIcs.CSL.2011.82</a>."},"day":"31","oa_version":"Published Version","status":"public","_id":"3360","intvolume":"        12","file":[{"date_created":"2018-12-12T10:10:17Z","file_size":504270,"file_name":"IST-2012-82-v1+1_Determinizing_discounted-sum_automata.pdf","file_id":"4803","creator":"system","content_type":"application/pdf","date_updated":"2020-07-14T12:46:10Z","relation":"main_file","checksum":"250603c6be8ccad4fbd4d7b24221f0ee","access_level":"open_access"}]},{"file":[{"file_name":"IST-2012-81-v1+1_The_complexity_of_quantitative_information_flow_problems.pdf","date_created":"2018-12-12T10:10:07Z","file_size":299069,"file_id":"4792","content_type":"application/pdf","date_updated":"2020-07-14T12:46:10Z","creator":"system","checksum":"1a25be0c62459fc7640db88af08ff63a","access_level":"open_access","relation":"main_file"}],"external_id":{"isi":["000300766400014"]},"publisher":"IEEE","year":"2011","citation":{"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>.","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>.","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>","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.","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>","ista":"Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217."},"isi":1,"day":"27","oa_version":"Submitted Version","_id":"3361","status":"public","fulldoi":"https://doi.org/10.1109/CSF.2011.21","date_published":"2011-06-27T00:00:00Z","has_accepted_license":"1","ddc":["000","005"],"abstract":[{"lang":"eng","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."}],"file_date_updated":"2020-07-14T12:46:10Z","ec_funded":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-30T09:04:15Z","publist_id":"3254","quality_controlled":"1","project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989"},{"grant_number":"S11402-N23","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"article_processing_charge":"No","date_created":"2018-12-11T12:02:54Z","month":"06","publication_status":"published","pubrep_id":"81","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"page":"205 - 217","type":"conference","doi":"10.1109/CSF.2011.21","oa":1,"title":"The complexity of quantitative information flow problems","author":[{"first_name":"Pavol","full_name":"Cerny, Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A"}],"scopus_import":"1","conference":{"location":"Cernay-la-Ville, France","name":"CSF: Computer Security Foundations","end_date":"2011-06-29","start_date":"2011-06-27"},"corr_author":"1"},{"intvolume":"      6901","file":[{"file_name":"2011_CONCUR_Fisher.pdf","date_created":"2020-05-19T16:17:48Z","file_size":337125,"file_id":"7870","date_updated":"2020-07-14T12:46:10Z","content_type":"application/pdf","creator":"dernst","access_level":"open_access","checksum":"6bf2453d8e52e979ddb58d17325bad26","relation":"main_file"}],"_id":"3362","status":"public","oa_version":"Submitted Version","day":"01","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"chicago":"Fisher, Jasmin, Thomas A Henzinger, Dejan Nickovic, Nir Piterman, Anmol Singh, and Moshe Vardi. “Dynamic Reactive Modules,” 6901:404–18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011. <a href=\"https://doi.org/10.1007/978-3-642-23217-6_27\">https://doi.org/10.1007/978-3-642-23217-6_27</a>.","short":"J. Fisher, T.A. Henzinger, D. Nickovic, N. Piterman, A. Singh, M. Vardi, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–418.","mla":"Fisher, Jasmin, et al. <i>Dynamic Reactive Modules</i>. Vol. 6901, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-23217-6_27\">10.1007/978-3-642-23217-6_27</a>.","ista":"Fisher J, Henzinger TA, Nickovic D, Piterman N, Singh A, Vardi M. 2011. Dynamic reactive modules. CONCUR: Concurrency Theory, LNCS, vol. 6901, 404–418.","ama":"Fisher J, Henzinger TA, Nickovic D, Piterman N, Singh A, Vardi M. Dynamic reactive modules. In: Vol 6901. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2011:404-418. doi:<a href=\"https://doi.org/10.1007/978-3-642-23217-6_27\">10.1007/978-3-642-23217-6_27</a>","ieee":"J. Fisher, T. A. Henzinger, D. Nickovic, N. Piterman, A. Singh, and M. Vardi, “Dynamic reactive modules,” presented at the CONCUR: Concurrency Theory, Aachen, Germany, 2011, vol. 6901, pp. 404–418.","apa":"Fisher, J., Henzinger, T. A., Nickovic, D., Piterman, N., Singh, A., &#38; Vardi, M. (2011). Dynamic reactive modules (Vol. 6901, pp. 404–418). Presented at the CONCUR: Concurrency Theory, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-23217-6_27\">https://doi.org/10.1007/978-3-642-23217-6_27</a>"},"year":"2011","has_accepted_license":"1","date_published":"2011-01-01T00:00:00Z","ddc":["000"],"fulldoi":"https://doi.org/10.1007/978-3-642-23217-6_27","publist_id":"3253","alternative_title":["LNCS"],"date_updated":"2021-01-12T07:42:57Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"file_date_updated":"2020-07-14T12:46:10Z","abstract":[{"text":"State-transition systems communicating by shared variables have been the underlying model of choice for applications of model checking. Such formalisms, however, have difficulty with modeling process creation or death and communication reconfigurability. Here, we introduce “dynamic reactive modules” (DRM), a state-transition modeling formalism that supports dynamic reconfiguration and creation/death of processes. The resulting formalism supports two types of variables, data variables and reference variables. Reference variables enable changing the connectivity between processes and referring to instances of processes. We show how this new formalism supports parallel composition and refinement through trace containment. DRM provide a natural language for modeling (and ultimately reasoning about) biological systems and multiple threads communicating through shared variables.","lang":"eng"}],"article_processing_charge":"No","date_created":"2018-12-11T12:02:54Z","project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989"},{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"}],"quality_controlled":"1","page":"404 - 418","publication_status":"published","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"volume":6901,"month":"01","oa":1,"title":"Dynamic reactive modules","type":"conference","doi":"10.1007/978-3-642-23217-6_27","conference":{"name":"CONCUR: Concurrency Theory","end_date":"2011-09-09","location":"Aachen, Germany","start_date":"2011-09-06"},"scopus_import":1,"author":[{"last_name":"Fisher","full_name":"Fisher, Jasmin","first_name":"Jasmin"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"first_name":"Dejan","full_name":"Nickovic, Dejan","last_name":"Nickovic","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nir","full_name":"Piterman, Nir","last_name":"Piterman"},{"first_name":"Anmol","full_name":"Singh, Anmol","last_name":"Singh"},{"first_name":"Moshe","full_name":"Vardi, Moshe","last_name":"Vardi"}]},{"date_created":"2018-12-11T12:02:54Z","article_processing_charge":"No","project":[{"name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"grant_number":"214373","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"language":[{"iso":"eng"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"submitted","page":"19","month":"04","doi":"10.48550/arXiv.1104.0127","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1104.0127"}],"type":"preprint","oa":1,"title":"The decidability frontier for probabilistic automata on infinite words","article_number":"1104.0127","corr_author":"1","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","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"}],"external_id":{"arxiv":["1104.0127"]},"oa_version":"Preprint","_id":"3363","status":"public","year":"2011","citation":{"apa":"Chatterjee, K., Henzinger, T. A., &#38; Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv. <a href=\"https://doi.org/10.48550/arXiv.1104.0127\">https://doi.org/10.48550/arXiv.1104.0127</a>","ieee":"K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.","ista":"Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words. 1104.0127.","ama":"Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words. doi:<a href=\"https://doi.org/10.48550/arXiv.1104.0127\">10.48550/arXiv.1104.0127</a>","mla":"Chatterjee, Krishnendu, et al. <i>The Decidability Frontier for Probabilistic Automata on Infinite Words</i>. 1104.0127, ArXiv, doi:<a href=\"https://doi.org/10.48550/arXiv.1104.0127\">10.48550/arXiv.1104.0127</a>.","short":"K. Chatterjee, T.A. Henzinger, M. Tracol, (n.d.).","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d. <a href=\"https://doi.org/10.48550/arXiv.1104.0127\">https://doi.org/10.48550/arXiv.1104.0127</a>."},"publisher":"ArXiv","arxiv":1,"day":"01","fulldoi":"https://doi.org/10.48550/arXiv.1104.0127","date_published":"2011-04-01T00:00:00Z","publist_id":"3251","date_updated":"2025-06-26T09:19:59Z","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 a complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words.","lang":"eng"}],"ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"scopus_import":"1","publication":"Theoretical Computer Science","author":[{"first_name":"Frédéric","full_name":"Didier, Frédéric","last_name":"Didier"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"last_name":"Mateescu","full_name":"Mateescu, Maria","first_name":"Maria"},{"last_name":"Wolf","full_name":"Wolf, Verena","first_name":"Verena"}],"title":"Approximation of event probabilities in noisy cellular processes","oa":1,"doi":"10.1016/j.tcs.2010.10.022","type":"journal_article","page":"2128 - 2141","volume":412,"department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"pubrep_id":"79","publication_status":"published","month":"05","date_created":"2018-12-11T12:02:55Z","article_processing_charge":"No","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"4535"}]},"quality_controlled":"1","publist_id":"3249","date_updated":"2025-09-30T09:03:30Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"lang":"eng","text":"Molecular noise, which arises from the randomness of the discrete events in the cell, significantly influences fundamental biological processes. Discrete-state continuous-time stochastic models (CTMC) can be used to describe such effects, but the calculation of the probabilities of certain events is computationally expensive. We present a comparison of two analysis approaches for CTMC. On one hand, we estimate the probabilities of interest using repeated Gillespie simulation and determine the statistical accuracy that we obtain. On the other hand, we apply a numerical reachability analysis that approximates the probability distributions of the system at several time instances. We use examples of cellular processes to demonstrate the superiority of the reachability analysis if accurate results are required."}],"file_date_updated":"2020-07-14T12:46:10Z","ddc":["000","004"],"date_published":"2011-05-06T00:00:00Z","has_accepted_license":"1","fulldoi":"https://doi.org/10.1016/j.tcs.2010.10.022","status":"public","_id":"3364","oa_version":"Submitted Version","day":"06","isi":1,"year":"2011","citation":{"ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. Approximation of event probabilities in noisy cellular processes. <i>Theoretical Computer Science</i>. 2011;412(21):2128-2141. doi:<a href=\"https://doi.org/10.1016/j.tcs.2010.10.022\">10.1016/j.tcs.2010.10.022</a>","ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2011. Approximation of event probabilities in noisy cellular processes. Theoretical Computer Science. 412(21), 2128–2141.","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Approximation of event probabilities in noisy cellular processes,” <i>Theoretical Computer Science</i>, vol. 412, no. 21. Elsevier, pp. 2128–2141, 2011.","apa":"Didier, F., Henzinger, T. A., Mateescu, M., &#38; Wolf, V. (2011). Approximation of event probabilities in noisy cellular processes. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2010.10.022\">https://doi.org/10.1016/j.tcs.2010.10.022</a>","chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Approximation of Event Probabilities in Noisy Cellular Processes.” <i>Theoretical Computer Science</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.tcs.2010.10.022\">https://doi.org/10.1016/j.tcs.2010.10.022</a>.","mla":"Didier, Frédéric, et al. “Approximation of Event Probabilities in Noisy Cellular Processes.” <i>Theoretical Computer Science</i>, vol. 412, no. 21, Elsevier, 2011, pp. 2128–41, doi:<a href=\"https://doi.org/10.1016/j.tcs.2010.10.022\">10.1016/j.tcs.2010.10.022</a>.","short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, Theoretical Computer Science 412 (2011) 2128–2141."},"publisher":"Elsevier","external_id":{"isi":["000290078000005"]},"issue":"21","file":[{"file_size":230503,"date_created":"2018-12-12T10:11:09Z","file_name":"IST-2012-79-v1+1_Approximation_of_event_probabilities_in_noisy_cellular_processes.pdf","file_id":"4862","creator":"system","content_type":"application/pdf","date_updated":"2020-07-14T12:46:10Z","checksum":"e5503e25ce020d753e06b3431e16841e","access_level":"open_access","relation":"main_file"}],"intvolume":"       412"},{"doi":"10.1007/978-3-642-19835-9_24","type":"conference","oa":1,"title":"QUASY: quantitative synthesis tool","scopus_import":1,"conference":{"start_date":"2011-03-26","end_date":"2011-04-03","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Saarbrucken, Germany"},"author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Barbara","full_name":"Jobstmann, Barbara","last_name":"Jobstmann"},{"first_name":"Rohit","last_name":"Singh","full_name":"Singh, Rohit"}],"date_created":"2018-12-11T12:02:55Z","quality_controlled":"1","volume":6605,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"language":[{"iso":"eng"}],"publication_status":"published","pubrep_id":"77","page":"267 - 271","month":"09","fulldoi":"https://doi.org/10.1007/978-3-642-19835-9_24","ddc":["000","005"],"date_published":"2011-09-29T00:00:00Z","has_accepted_license":"1","publist_id":"3248","alternative_title":["LNCS"],"date_updated":"2021-01-12T07:42:58Z","abstract":[{"lang":"eng","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."}],"file_date_updated":"2020-07-14T12:46:10Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2018-12-12T10:13:37Z","file_size":475661,"file_name":"IST-2012-77-v1+1_QUASY-_quantitative_synthesis_tool.pdf","file_id":"5022","creator":"system","content_type":"application/pdf","date_updated":"2020-07-14T12:46:10Z","relation":"main_file","access_level":"open_access","checksum":"762e52eb296f6dbfbf2a75d98b8ebaee"}],"intvolume":"      6605","oa_version":"Submitted Version","status":"public","_id":"3365","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>.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2011, pp. 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>.","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>","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.","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.","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","publisher":"Springer","day":"29"},{"date_created":"2018-12-11T12:02:55Z","article_processing_charge":"No","related_material":{"record":[{"id":"5388","relation":"earlier_version","status":"public"}]},"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"grant_number":"214373","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"volume":6806,"language":[{"iso":"eng"}],"pubrep_id":"76","publication_status":"published","page":"243 - 259","month":"04","doi":"10.1007/978-3-642-22110-1_20","type":"conference","oa":1,"title":"Quantitative synthesis for concurrent programs","scopus_import":"1","corr_author":"1","conference":{"start_date":"2011-07-14","end_date":"2011-07-20","name":"CAV: Computer Aided Verification","location":"Snowbird, USA"},"author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","full_name":"Cerny, Pavol","first_name":"Pavol"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"},{"full_name":"Singh, Rohit","last_name":"Singh","first_name":"Rohit"}],"file":[{"access_level":"open_access","checksum":"c033689355f45742dc7c99b5af13ce7a","relation":"main_file","content_type":"application/pdf","date_updated":"2020-07-14T12:46:10Z","creator":"system","file_id":"5174","file_name":"IST-2012-76-v1+1_Quantitative_synthesis_for_concurrent_programs.pdf","file_size":508946,"date_created":"2018-12-12T10:15:51Z"}],"intvolume":"      6806","editor":[{"full_name":"Gopalakrishnan, Ganesh","last_name":"Gopalakrishnan","first_name":"Ganesh"},{"last_name":"Qadeer","full_name":"Qadeer, Shaz","first_name":"Shaz"}],"oa_version":"Submitted Version","status":"public","_id":"3366","citation":{"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.","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>","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.","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>","short":"P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.","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>.","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>."},"year":"2011","publisher":"Springer","day":"21","fulldoi":"https://doi.org/10.1007/978-3-642-22110-1_20","ddc":["000","004"],"date_published":"2011-04-21T00:00:00Z","has_accepted_license":"1","publist_id":"3247","date_updated":"2024-10-21T06:03:04Z","alternative_title":["LNCS"],"file_date_updated":"2020-07-14T12:46:10Z","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. "}],"ec_funded":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"}]