[{"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"}],"publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"month":"06","ddc":["000","005"],"abstract":[{"text":"We consider two-player stochastic games played on a finite state space for an infinite num- ber 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 a probability distribution over the successor states. We also consider the important special case of turn-based stochastic games where players make moves in turns, rather than concurrently. We study concurrent games with ω-regular winning conditions specified as parity objectives. The value for player 1 for a parity objective is the maximal probability with which the player can guarantee the satisfaction of the objective against all strategies of the opponent. We study the problem of continuity and robustness of the value function in concurrent and turn-based stochastic parity games with respect to imprecision in the transition probabilities. We present quantitative bounds on the difference of the value function (in terms of the imprecision of the transition probabilities) and show the value continuity for structurally equivalent concurrent games (two games are structurally equivalent if the support of the transition func- tion is same and the probabilities differ). We also show robustness of optimal strategies for structurally equivalent turn-based stochastic parity games. Finally we show that the value continuity property breaks without the structurally equivalent assumption (even for Markov chains) and show that our quantitative bound is asymptotically optimal. Hence our results are tight (the assumption is both necessary and sufficient) and optimal (our quantitative bound is asymptotically optimal).","lang":"eng"}],"file":[{"file_name":"IST-2011-0006_IST-2011-0006.pdf","file_id":"5546","checksum":"1322b652d6ab07eb5248298a3f91c1cf","date_updated":"2020-07-14T12:46:40Z","date_created":"2018-12-12T11:54:24Z","creator":"system","file_size":335997,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"27","oa_version":"Published Version","type":"technical_report","date_published":"2011-06-27T00:00:00Z","status":"public","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"page":"18","department":[{"_id":"KrCh"}],"year":"2011","date_updated":"2023-02-23T11:23:01Z","pubrep_id":"18","oa":1,"citation":{"apa":"Chatterjee, K. (2011). <i>Robustness of structurally equivalent concurrent parity games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0006\">https://doi.org/10.15479/AT:IST-2011-0006</a>","short":"K. Chatterjee, Robustness of Structurally Equivalent Concurrent Parity Games, IST Austria, 2011.","ieee":"K. Chatterjee, <i>Robustness of structurally equivalent concurrent parity games</i>. IST Austria, 2011.","ama":"Chatterjee K. <i>Robustness of Structurally Equivalent Concurrent Parity Games</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0006\">10.15479/AT:IST-2011-0006</a>","chicago":"Chatterjee, Krishnendu. <i>Robustness of Structurally Equivalent Concurrent Parity Games</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0006\">https://doi.org/10.15479/AT:IST-2011-0006</a>.","ista":"Chatterjee K. 2011. Robustness of structurally equivalent concurrent parity games, IST Austria, 18p.","mla":"Chatterjee, Krishnendu. <i>Robustness of Structurally Equivalent Concurrent Parity Games</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0006\">10.15479/AT:IST-2011-0006</a>."},"date_created":"2018-12-12T11:39:00Z","title":"Robustness of structurally equivalent concurrent parity games","related_material":{"record":[{"status":"public","relation":"later_version","id":"3341"}]},"has_accepted_license":"1","language":[{"iso":"eng"}],"_id":"5382","file_date_updated":"2020-07-14T12:46:40Z","doi":"10.15479/AT:IST-2011-0006"},{"oa_version":"Published Version","day":"11","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We consider probabilistic automata on infinite words with acceptance defined by parity conditions. We consider three qualitative decision problems: (i) the positive decision problem asks whether there is a word that is accepted with positive probability; (ii) the almost decision problem asks whether there is a word that is accepted with probability 1; and (iii) the limit decision problem asks whether for every ε > 0 there is a word that is accepted with probability at least 1 − ε. We unify and generalize several decidability results for probabilistic automata over infinite words, and identify a robust (closed under union and intersection) subclass of probabilistic automata for which all the qualitative decision problems are decidable for parity conditions. We also show that if the input words are restricted to lasso shape words, then the positive and almost problems are decidable for all probabilistic automata with parity conditions.","lang":"eng"}],"file":[{"file_id":"5545","checksum":"f5a0f664fadc335990f5fcf138df19f1","file_name":"IST-2011-004_IST-2011-0004.pdf","date_created":"2018-12-12T11:54:23Z","date_updated":"2020-07-14T12:46:40Z","creator":"system","relation":"main_file","file_size":570827,"access_level":"open_access","content_type":"application/pdf"}],"ddc":["000","005"],"month":"04","publication_identifier":{"issn":["2664-1690"]},"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3F54FA38-F248-11E8-B48F-1D18A9856A87","last_name":"Tracol","full_name":"Tracol, Mathieu","first_name":"Mathieu"}],"publication_status":"published","department":[{"_id":"KrCh"}],"page":"30","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"type":"technical_report","status":"public","date_published":"2011-04-11T00:00:00Z","has_accepted_license":"1","related_material":{"record":[{"status":"public","id":"2957","relation":"later_version"}]},"date_created":"2018-12-12T11:39:01Z","citation":{"apa":"Chatterjee, K., &#38; Tracol, M. (2011). <i>Decidable problems for probabilistic automata on infinite words</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0004\">https://doi.org/10.15479/AT:IST-2011-0004</a>","chicago":"Chatterjee, Krishnendu, and Mathieu Tracol. <i>Decidable Problems for Probabilistic Automata on Infinite Words</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0004\">https://doi.org/10.15479/AT:IST-2011-0004</a>.","ista":"Chatterjee K, Tracol M. 2011. Decidable problems for probabilistic automata on infinite words, IST Austria, 30p.","mla":"Chatterjee, Krishnendu, and Mathieu Tracol. <i>Decidable Problems for Probabilistic Automata on Infinite Words</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0004\">10.15479/AT:IST-2011-0004</a>.","ieee":"K. Chatterjee and M. Tracol, <i>Decidable problems for probabilistic automata on infinite words</i>. IST Austria, 2011.","ama":"Chatterjee K, Tracol M. <i>Decidable Problems for Probabilistic Automata on Infinite Words</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0004\">10.15479/AT:IST-2011-0004</a>","short":"K. Chatterjee, M. Tracol, Decidable Problems for Probabilistic Automata on Infinite Words, IST Austria, 2011."},"title":"Decidable problems for probabilistic automata on infinite words","date_updated":"2023-02-23T11:05:53Z","pubrep_id":"20","oa":1,"year":"2011","doi":"10.15479/AT:IST-2011-0004","file_date_updated":"2020-07-14T12:46:40Z","_id":"5384","language":[{"iso":"eng"}]},{"doi":"10.15479/AT:IST-2011-0003","_id":"5385","file_date_updated":"2020-07-14T12:46:41Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"2038"},{"status":"public","relation":"later_version","id":"3356"}]},"ec_funded":1,"date_created":"2018-12-12T11:39:02Z","citation":{"mla":"Boker, Udi, et al. <i>Temporal Specifications with Accumulative Values</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">10.15479/AT:IST-2011-0003</a>.","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.","chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. <i>Temporal Specifications with Accumulative Values</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">https://doi.org/10.15479/AT:IST-2011-0003</a>.","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, <i>Temporal specifications with accumulative values</i>. IST Austria, 2011.","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. <i>Temporal Specifications with Accumulative Values</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">10.15479/AT:IST-2011-0003</a>","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2011). <i>Temporal specifications with accumulative values</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">https://doi.org/10.15479/AT:IST-2011-0003</a>"},"year":"2011","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"page":"14","date_published":"2011-04-04T00:00:00Z","publisher":"IST Austria","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"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"}],"ddc":["000","004"],"publication_status":"published","language":[{"iso":"eng"}],"has_accepted_license":"1","title":"Temporal specifications with accumulative values","pubrep_id":"21","oa":1,"date_updated":"2023-02-23T11:23:41Z","status":"public","type":"technical_report","alternative_title":["IST Austria Technical Report"],"file":[{"date_updated":"2020-07-14T12:46:41Z","date_created":"2018-12-12T11:53:00Z","file_id":"5461","checksum":"8491d0d48c4911620ecd5350b413c11e","file_name":"IST-2011-0003_IST-2011-0003.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_size":366281,"creator":"system"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","day":"04","month":"04","publication_identifier":{"issn":["2664-1690"]},"author":[{"first_name":"Udi","full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"last_name":"Kupferman","first_name":"Orna","full_name":"Kupferman, Orna"}]},{"file_date_updated":"2020-07-14T12:46:42Z","_id":"5388","language":[{"iso":"eng"}],"doi":"10.15479/AT:IST-2010-0004","title":"Quantitative synthesis for concurrent programs","date_created":"2018-12-12T11:39:03Z","citation":{"apa":"Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., &#38; Singh, R. (2010). <i>Quantitative synthesis for concurrent programs</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2010-0004\">https://doi.org/10.15479/AT:IST-2010-0004</a>","ieee":"K. Chatterjee, P. Cerny, T. A. Henzinger, A. Radhakrishna, and R. Singh, <i>Quantitative synthesis for concurrent programs</i>. IST Austria, 2010.","ama":"Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. <i>Quantitative Synthesis for Concurrent Programs</i>. IST Austria; 2010. doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0004\">10.15479/AT:IST-2010-0004</a>","short":"K. Chatterjee, P. Cerny, T.A. Henzinger, A. Radhakrishna, R. Singh, Quantitative Synthesis for Concurrent Programs, IST Austria, 2010.","mla":"Chatterjee, Krishnendu, et al. <i>Quantitative Synthesis for Concurrent Programs</i>. IST Austria, 2010, doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0004\">10.15479/AT:IST-2010-0004</a>.","chicago":"Chatterjee, Krishnendu, Pavol Cerny, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. <i>Quantitative Synthesis for Concurrent Programs</i>. IST Austria, 2010. <a href=\"https://doi.org/10.15479/AT:IST-2010-0004\">https://doi.org/10.15479/AT:IST-2010-0004</a>.","ista":"Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative synthesis for concurrent programs, IST Austria, 17p."},"pubrep_id":"24","oa":1,"date_updated":"2023-02-23T11:24:08Z","year":"2010","has_accepted_license":"1","related_material":{"record":[{"status":"public","id":"3366","relation":"later_version"}]},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"page":"17","publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"date_published":"2010-10-07T00:00:00Z","status":"public","type":"technical_report","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"first_name":"Pavol","full_name":"Cerny, Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","first_name":"Arjun"},{"last_name":"Singh","first_name":"Rohit","full_name":"Singh, Rohit"}],"publication_status":"published","day":"07","oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":429101,"relation":"main_file","access_level":"open_access","creator":"system","date_created":"2018-12-12T11:53:53Z","date_updated":"2020-07-14T12:46:42Z","file_id":"5515","file_name":"IST-2010-0004_IST-2010-0004.pdf","checksum":"da38782d2388a6fa32109d10bb9bad67"}],"abstract":[{"lang":"eng","text":"We present an algorithmic method for the synthesis of concurrent programs that are optimal with respect to quantitative performance measures. The input consists of a sequential sketch, that is, a program that does not contain synchronization constructs, and of a parametric performance model that assigns costs to actions such as locking, context switching, and idling. The quantitative synthesis problem is to automatically introduce synchronization constructs into the sequential sketch so that both correctness is guaranteed and worst-case (or average-case) performance is optimized. Correctness is formalized as race freedom or linearizability.\r\n\r\nWe show that for worst-case performance, the problem can be modeled\r\nas a 2-player graph game with quantitative (limit-average) objectives, and\r\nfor average-case performance, as a 2 1/2 -player graph game (with probabilistic transitions). In both cases, the optimal correct program is derived from an optimal strategy in the corresponding quantitative game. We prove that the respective game problems are computationally expensive (NP-complete), and present several techniques that overcome the theoretical difficulty in cases of concurrent programs of practical interest.\r\n\r\nWe have implemented a prototype tool and used it for the automatic syn- thesis of programs that access a concurrent list. For certain parameter val- ues, our method automatically synthesizes various classical synchronization schemes for implementing a concurrent list, such as fine-grained locking or a lazy algorithm. For other parameter values, a new, hybrid synchronization style is synthesized, which uses both the lazy approach and coarse-grained locks (instead of standard fine-grained locks). The trade-off occurs because while fine-grained locking tends to decrease the cost that is due to waiting for locks, it increases cache size requirements."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000","005"],"month":"10","publication_identifier":{"issn":["2664-1690"]}},{"doi":"10.15479/AT:IST-2010-0002","file_date_updated":"2020-07-14T12:46:43Z","language":[{"iso":"eng"}],"_id":"5390","has_accepted_license":"1","citation":{"short":"K. Chatterjee, N. Fijalkow, Topological, Automata-Theoretic and Logical Characterization of Finitary Languages, IST Austria, 2010.","ama":"Chatterjee K, Fijalkow N. <i>Topological, Automata-Theoretic and Logical Characterization of Finitary Languages</i>. IST Austria; 2010. doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0002\">10.15479/AT:IST-2010-0002</a>","ieee":"K. Chatterjee and N. Fijalkow, <i>Topological, automata-theoretic and logical characterization of finitary languages</i>. IST Austria, 2010.","mla":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. <i>Topological, Automata-Theoretic and Logical Characterization of Finitary Languages</i>. IST Austria, 2010, doi:<a href=\"https://doi.org/10.15479/AT:IST-2010-0002\">10.15479/AT:IST-2010-0002</a>.","ista":"Chatterjee K, Fijalkow N. 2010. Topological, automata-theoretic and logical characterization of finitary languages, IST Austria, 21p.","chicago":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. <i>Topological, Automata-Theoretic and Logical Characterization of Finitary Languages</i>. IST Austria, 2010. <a href=\"https://doi.org/10.15479/AT:IST-2010-0002\">https://doi.org/10.15479/AT:IST-2010-0002</a>.","apa":"Chatterjee, K., &#38; Fijalkow, N. (2010). <i>Topological, automata-theoretic and logical characterization of finitary languages</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2010-0002\">https://doi.org/10.15479/AT:IST-2010-0002</a>"},"title":"Topological, automata-theoretic and logical characterization of finitary languages","date_created":"2018-12-12T11:39:03Z","pubrep_id":"26","date_updated":"2020-07-14T23:04:41Z","oa":1,"year":"2010","page":"21","department":[{"_id":"KrCh"}],"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","date_published":"2010-06-04T00:00:00Z","type":"technical_report","status":"public","day":"04","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","file_size":395662,"access_level":"open_access","content_type":"application/pdf","creator":"system","date_created":"2018-12-12T11:54:10Z","date_updated":"2020-07-14T12:46:43Z","file_id":"5532","checksum":"283d3604d76dd4d5161585d4c8625fbe","file_name":"IST-2010-0002_IST-2010-0002.pdf"}],"abstract":[{"text":"The class of ω regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually.” Two main strengths of the classical, infinite-limit formulation of liveness are robustness (independence from the granularity of transitions) and simplicity (abstraction of complicated time bounds). However, the classical liveness formulation suffers from the drawback that the time until something good happens may be unbounded. A stronger formulation of liveness, so-called finitary liveness, overcomes this drawback, while still retaining robustness and simplicity. Finitary liveness requires that there exists an unknown, fixed bound b such that something good happens within b transitions. In this work we consider the finitary parity and Streett (fairness) conditions. We present the topological, automata-theoretic and logical characterization of finitary languages defined by finitary parity and Streett conditions. We (a) show that the finitary parity and Streett languages are Σ2-complete; (b) present a complete characterization of the expressive power of various classes of automata with finitary and infinitary conditions (in particular we show that non-deterministic finitary parity and Streett automata cannot be determinized to deterministic finitary parity or Streett automata); and (c) show that the languages defined by non-deterministic finitary parity automata exactly characterize the star-free fragment of ωB-regular languages.","lang":"eng"}],"ddc":["000"],"month":"06","publication_identifier":{"issn":["2664-1690"]},"publication_status":"published","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"last_name":"Fijalkow","full_name":"Fijalkow, Nathanaël","first_name":"Nathanaël"}]},{"date_published":"2010-09-10T00:00:00Z","publisher":"Springer","quality_controlled":"1","volume":6199,"department":[{"_id":"KrCh"}],"page":"599 - 610","publication_status":"published","abstract":[{"text":"Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of energy in the game) must remain positive. Beside their own interest in the design and synthesis of resource-constrained omega-regular specifications, energy parity games provide one of the simplest model of games with combined qualitative and quantitative objective. Our main results are as follows: (a) exponential memory is sufficient and may be necessary for winning strategies in energy parity games; (b) the problem of deciding the winner in energy parity games can be solved in NP ∩ coNP; and (c) we give an algorithm to solve energy parity by reduction to energy games. We also show that the problem of deciding the winner in energy parity games is polynomially equivalent to the problem of deciding the winner in mean-payoff parity games, which can thus be solved in NP ∩ coNP. As a consequence we also obtain a conceptually simple algorithm to solve mean-payoff parity games.","lang":"eng"}],"external_id":{"arxiv":["1001.5183"]},"_id":"3851","doi":"10.1007/978-3-642-14162-1_50","year":"2010","citation":{"short":"K. Chatterjee, L. Doyen, in:, Springer, 2010, pp. 599–610.","ieee":"K. Chatterjee and L. Doyen, “Energy parity games,” presented at the  ICALP: Automata, Languages and Programming, 37th International Colloquium, Bordeaux, France, 2010, vol. 6199, pp. 599–610.","ama":"Chatterjee K, Doyen L. Energy parity games. In: Vol 6199. Springer; 2010:599-610. doi:<a href=\"https://doi.org/10.1007/978-3-642-14162-1_50\">10.1007/978-3-642-14162-1_50</a>","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games,” 6199:599–610. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14162-1_50\">https://doi.org/10.1007/978-3-642-14162-1_50</a>.","ista":"Chatterjee K, Doyen L. 2010. Energy parity games.  ICALP: Automata, Languages and Programming, 37th International Colloquium, LNCS, vol. 6199, 599–610.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Energy Parity Games</i>. Vol. 6199, Springer, 2010, pp. 599–610, doi:<a href=\"https://doi.org/10.1007/978-3-642-14162-1_50\">10.1007/978-3-642-14162-1_50</a>.","apa":"Chatterjee, K., &#38; Doyen, L. (2010). Energy parity games (Vol. 6199, pp. 599–610). Presented at the  ICALP: Automata, Languages and Programming, 37th International Colloquium, Bordeaux, France: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14162-1_50\">https://doi.org/10.1007/978-3-642-14162-1_50</a>"},"publist_id":"2330","date_created":"2018-12-11T12:05:31Z","related_material":{"record":[{"relation":"later_version","id":"2972","status":"public"}]},"type":"conference","status":"public","alternative_title":["LNCS"],"arxiv":1,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"month":"09","conference":{"location":"Bordeaux, France","end_date":"2010-07-10","name":" ICALP: Automata, Languages and Programming, 37th International Colloquium","start_date":"2010-07-06"},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","day":"10","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1001.5183"}],"language":[{"iso":"eng"}],"date_updated":"2023-02-23T11:06:35Z","oa":1,"title":"Energy parity games","scopus_import":1,"intvolume":"      6199"},{"citation":{"short":"K. Chatterjee, R. Majumdar, in:, EPTCS, 2010, pp. 22–29.","ama":"Chatterjee K, Majumdar R. Discounting in games across time scales. In: Vol 25. EPTCS; 2010:22-29. doi:<a href=\"https://doi.org/10.4204/EPTCS.25.6\">10.4204/EPTCS.25.6</a>","ieee":"K. Chatterjee and R. Majumdar, “Discounting in games across time scales,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2010, vol. 25, pp. 22–29.","ista":"Chatterjee K, Majumdar R. 2010. Discounting in games across time scales. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 22–29.","mla":"Chatterjee, Krishnendu, and Ritankar Majumdar. <i>Discounting in Games across Time Scales</i>. Vol. 25, EPTCS, 2010, pp. 22–29, doi:<a href=\"https://doi.org/10.4204/EPTCS.25.6\">10.4204/EPTCS.25.6</a>.","chicago":"Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting in Games across Time Scales,” 25:22–29. EPTCS, 2010. <a href=\"https://doi.org/10.4204/EPTCS.25.6\">https://doi.org/10.4204/EPTCS.25.6</a>.","apa":"Chatterjee, K., &#38; Majumdar, R. (2010). Discounting in games across time scales (Vol. 25, pp. 22–29). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. <a href=\"https://doi.org/10.4204/EPTCS.25.6\">https://doi.org/10.4204/EPTCS.25.6</a>"},"date_created":"2018-12-11T12:05:31Z","publist_id":"2329","year":"2010","_id":"3852","file_date_updated":"2020-07-14T12:46:17Z","doi":"10.4204/EPTCS.25.6","publication_status":"published","abstract":[{"text":"We introduce two-level discounted games played by two players on a perfect-information stochastic game graph. The upper level game is a discounted game and the lower level game is an undiscounted reachability game. Two-level games model hierarchical and sequential decision making under uncertainty across different time scales. We show the existence of pure memoryless optimal strategies for both players and an ordered field property for such games. We show that if there is only one player (Markov decision processes), then the values can be computed in polynomial time. It follows that whether the value of a player is equal to a given rational constant in two-level discounted games can be decided in NP intersected coNP. We also give an alternate strategy improvement algorithm to compute the value. ","lang":"eng"}],"external_id":{"arxiv":["1006.1403"]},"ddc":["000"],"volume":25,"quality_controlled":"1","department":[{"_id":"KrCh"}],"page":"22 - 29","date_published":"2010-06-08T00:00:00Z","publisher":"EPTCS","title":"Discounting in games across time scales","article_processing_charge":"No","date_updated":"2023-09-04T11:47:04Z","oa":1,"pubrep_id":"491","has_accepted_license":"1","scopus_import":"1","intvolume":"        25","language":[{"iso":"eng"}],"arxiv":1,"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"first_name":"Ritankar","full_name":"Majumdar, Ritankar","last_name":"Majumdar"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2018-12-12T10:12:19Z","date_updated":"2020-07-14T12:46:17Z","file_name":"IST-2016-491-v1+1_1006.1403v1.pdf","checksum":"2bdf1e9103710555c6251ca4153cb5e9","file_id":"4937","content_type":"application/pdf","access_level":"open_access","file_size":74598,"relation":"main_file","creator":"system"}],"oa_version":"Published Version","day":"08","month":"06","conference":{"end_date":"2010-06-18","location":"Minori, Italy","start_date":"2010-06-17","name":"GandALF: Games, Automata, Logic, and Formal Verification"},"status":"public","type":"conference","alternative_title":["EPTCS"]},{"project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","call_identifier":"FP7","name":"Design for Embedded Systems"}],"page":"269 - 283","department":[{"_id":"KrCh"},{"_id":"HeEd"},{"_id":"ToHe"}],"volume":6269,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2010-11-18T00:00:00Z","publication_status":"published","abstract":[{"lang":"eng","text":"Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on transitions that assign to each infinite path the long-run average of the transition weights. When the mode of branching of the automaton is deterministic, nondeterministic, or alternating, the corresponding class of quantitative languages is not robust as it is not closed under the pointwise operations of max, min, sum, and numerical complement. Nondeterministic and alternating mean-payoff automata are not decidable either, as the quantitative generalization of the problems of universality and language inclusion is undecidable. We introduce a new class of quantitative languages, defined by mean-payoff automaton expressions, which is robust and decidable: it is closed under the four pointwise operations, and we show that all decision problems are decidable for this class. Mean-payoff automaton expressions subsume deterministic meanpayoff automata, and we show that they have expressive power incomparable to nondeterministic and alternating mean-payoff automata. We also present for the first time an algorithm to compute distance between two quantitative languages, and in our case the quantitative languages are given as mean-payoff automaton expressions."}],"ddc":["000","005"],"file_date_updated":"2020-07-14T12:46:17Z","_id":"3853","doi":"10.1007/978-3-642-15375-4_19","publist_id":"2328","date_created":"2018-12-11T12:05:31Z","citation":{"apa":"Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T. A., &#38; Rannou, P. (2010). Mean-payoff automaton expressions (Vol. 6269, pp. 269–283). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">https://doi.org/10.1007/978-3-642-15375-4_19</a>","ieee":"K. Chatterjee, L. Doyen, H. Edelsbrunner, T. A. Henzinger, and P. Rannou, “Mean-payoff automaton expressions,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 269–283.","ama":"Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. Mean-payoff automaton expressions. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:269-283. doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">10.1007/978-3-642-15375-4_19</a>","short":"K. Chatterjee, L. Doyen, H. Edelsbrunner, T.A. Henzinger, P. Rannou, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–283.","ista":"Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.","mla":"Chatterjee, Krishnendu, et al. <i>Mean-Payoff Automaton Expressions</i>. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–83, doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">10.1007/978-3-642-15375-4_19</a>.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Herbert Edelsbrunner, Thomas A Henzinger, and Philippe Rannou. “Mean-Payoff Automaton Expressions,” 6269:269–83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">https://doi.org/10.1007/978-3-642-15375-4_19</a>."},"year":"2010","ec_funded":1,"alternative_title":["LNCS"],"status":"public","type":"conference","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"full_name":"Rannou, Philippe","first_name":"Philippe","last_name":"Rannou"}],"day":"18","oa_version":"Submitted Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"4f753ae99d076553fb8733e2c8b390e2","file_id":"5163","file_name":"IST-2012-62-v1+1_Mean-payoff_automaton_expressions.pdf","date_created":"2018-12-12T10:15:41Z","date_updated":"2020-07-14T12:46:17Z","creator":"system","relation":"main_file","file_size":233260,"content_type":"application/pdf","access_level":"open_access"}],"conference":{"start_date":"2010-08-31","name":"CONCUR: Concurrency Theory","end_date":"2010-09-03","location":"Paris, France"},"month":"11","language":[{"iso":"eng"}],"title":"Mean-payoff automaton expressions","oa":1,"date_updated":"2021-01-12T07:52:40Z","pubrep_id":"62","scopus_import":1,"intvolume":"      6269","has_accepted_license":"1"},{"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"first_name":"Florian","full_name":"Horn, Florian","last_name":"Horn","id":"37327ACE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Christof","full_name":"Löding, Christof","last_name":"Löding"}],"publication_status":"published","conference":{"start_date":"2010-08-31","name":"CONCUR: Concurrency Theory","end_date":"2010-09-03","location":"Paris, France"},"month":"09","oa_version":"None","day":"08","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the environment. The evolution of the system depends on the decisions of both players. The specification for the system is usually given as an ω-regular language L over paths and Eve’s goal is to ensure that the play belongs to L irrespective of Adam’s behaviour. The classical notion of winning strategies fails to capture several interesting scenarios. For example, strong fairness (Streett) conditions are specified by a number of request-grant pairs and require every pair that is requested infinitely often to be granted infinitely often: Eve might win just by preventing Adam from making any new request, but a “better” strategy would allow Adam to make as many requests as possible and still ensure fairness. To address such questions, we introduce the notion of obliging games, where Eve has to ensure a strong condition Φ, while always allowing Adam to satisfy a weak condition Ψ. We present a linear time reduction of obliging games with two Muller conditions Φ and Ψ to classical Muller games. We consider obliging Streett games and show they are co-NP complete, and show a natural quantitative optimisation problem for obliging Streett games is in FNP. We also show how obliging games can provide new and interesting semantics for multi-player games.","lang":"eng"}],"alternative_title":["LNCS"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2010-09-08T00:00:00Z","status":"public","type":"conference","page":"284 - 296","department":[{"_id":"KrCh"}],"volume":6269,"quality_controlled":"1","date_updated":"2021-01-12T07:52:41Z","year":"2010","citation":{"apa":"Chatterjee, K., Horn, F., &#38; Löding, C. (2010). Obliging games (Vol. 6269, pp. 284–296). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_20\">https://doi.org/10.1007/978-3-642-15375-4_20</a>","mla":"Chatterjee, Krishnendu, et al. <i>Obliging Games</i>. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 284–96, doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_20\">10.1007/978-3-642-15375-4_20</a>.","chicago":"Chatterjee, Krishnendu, Florian Horn, and Christof Löding. “Obliging Games,” 6269:284–96. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_20\">https://doi.org/10.1007/978-3-642-15375-4_20</a>.","ista":"Chatterjee K, Horn F, Löding C. 2010. Obliging games. CONCUR: Concurrency Theory, LNCS, vol. 6269, 284–296.","ama":"Chatterjee K, Horn F, Löding C. Obliging games. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:284-296. doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_20\">10.1007/978-3-642-15375-4_20</a>","ieee":"K. Chatterjee, F. Horn, and C. Löding, “Obliging games,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 284–296.","short":"K. Chatterjee, F. Horn, C. Löding, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 284–296."},"publist_id":"2327","title":"Obliging games","date_created":"2018-12-11T12:05:32Z","scopus_import":1,"intvolume":"      6269","_id":"3854","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-15375-4_20"},{"project":[{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"},{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems"}],"quality_controlled":"1","volume":6281,"page":"258 - 269","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_published":"2010-08-01T00:00:00Z","publisher":"Springer","publication_status":"published","abstract":[{"lang":"eng","text":"We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observation-based strategy relies on partial information about the history of a play, namely, on the past sequence of observations. We consider qualitative analysis problems: given a POMDP with a parity objective, decide whether there exists an observation-based strategy to achieve the objective with probability 1 (almost-sure winning), or with positive probability (positive winning). Our main results are twofold. First, we present a complete picture of the computational complexity of the qualitative analysis problem for POMDPs with parity objectives and its subclasses: safety, reachability, Büchi, and coBüchi objectives. We establish several upper and lower bounds that were not known in the literature. Second, we give optimal bounds (matching upper and lower bounds) for the memory required by pure and randomized observation-based strategies for each class of objectives."}],"ddc":["004"],"_id":"3855","file_date_updated":"2020-07-14T12:46:17Z","doi":"10.1007/978-3-642-15155-2_24","citation":{"apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2010). Qualitative analysis of partially-observable Markov Decision Processes (Vol. 6281, pp. 258–269). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_24\">https://doi.org/10.1007/978-3-642-15155-2_24</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Qualitative Analysis of Partially-Observable Markov Decision Processes,” 6281:258–69. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_24\">https://doi.org/10.1007/978-3-642-15155-2_24</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Qualitative Analysis of Partially-Observable Markov Decision Processes</i>. Vol. 6281, Springer, 2010, pp. 258–69, doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_24\">10.1007/978-3-642-15155-2_24</a>.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2010. Qualitative analysis of partially-observable Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 258–269.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2010, pp. 258–269.","ama":"Chatterjee K, Doyen L, Henzinger TA. Qualitative analysis of partially-observable Markov Decision Processes. In: Vol 6281. Springer; 2010:258-269. doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_24\">10.1007/978-3-642-15155-2_24</a>","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Qualitative analysis of partially-observable Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 258–269."},"date_created":"2018-12-11T12:05:32Z","publist_id":"2326","year":"2010","related_material":{"record":[{"id":"5395","relation":"earlier_version","status":"public"}]},"ec_funded":1,"status":"public","type":"conference","alternative_title":["LNCS"],"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","first_name":"Laurent","full_name":"Doyen, Laurent"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"file":[{"file_id":"5038","checksum":"b6c82ec82f194e5b0ab7c1c3800e4580","file_name":"IST-2012-61-v1+1_Qualitative_analysis_of_partially-observable_Markov_Decision_Processes.pdf","date_updated":"2020-07-14T12:46:17Z","date_created":"2018-12-12T10:13:51Z","creator":"system","file_size":173948,"access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","day":"01","month":"08","conference":{"name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2010-08-23","location":"Brno, Czech Republic","end_date":"2010-08-27"},"language":[{"iso":"eng"}],"title":"Qualitative analysis of partially-observable Markov Decision Processes","oa":1,"date_updated":"2023-02-23T12:24:22Z","pubrep_id":"61","intvolume":"      6281","has_accepted_license":"1","scopus_import":1},{"language":[{"iso":"eng"}],"intvolume":"      6281","scopus_import":1,"title":"Randomness for free","pubrep_id":"60","date_updated":"2023-02-23T10:12:00Z","oa":1,"alternative_title":["LNCS"],"status":"public","type":"conference","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1006.0673v1"}],"oa_version":"Preprint","day":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Brno, Czech Republic","end_date":"2010-08-27","name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2010-08-23"},"month":"09","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"first_name":"Hugo","full_name":"Gimbert, Hugo","last_name":"Gimbert"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"doi":"10.1007/978-3-642-15155-2_23","_id":"3856","ec_funded":1,"related_material":{"record":[{"id":"1731","relation":"later_version","status":"public"}]},"citation":{"ama":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. Randomness for free. In: Vol 6281. Springer; 2010:246-257. doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_23\">10.1007/978-3-642-15155-2_23</a>","ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 246–257.","short":"K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, in:, Springer, 2010, pp. 246–257.","ista":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2010. Randomness for free. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 246–257.","mla":"Chatterjee, Krishnendu, et al. <i>Randomness for Free</i>. Vol. 6281, Springer, 2010, pp. 246–57, doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_23\">10.1007/978-3-642-15155-2_23</a>.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free,” 6281:246–57. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_23\">https://doi.org/10.1007/978-3-642-15155-2_23</a>.","apa":"Chatterjee, K., Doyen, L., Gimbert, H., &#38; Henzinger, T. A. (2010). Randomness for free (Vol. 6281, pp. 246–257). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_23\">https://doi.org/10.1007/978-3-642-15155-2_23</a>"},"date_created":"2018-12-11T12:05:32Z","publist_id":"2325","acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","year":"2010","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"page":"246 - 257","volume":6281,"quality_controlled":"1","publisher":"Springer","date_published":"2010-09-06T00:00:00Z","project":[{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems","call_identifier":"FP7"}],"abstract":[{"lang":"eng","text":"We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided complete-observation (one player has complete observation); and (c) complete-observation (both players have complete view of the game). On the basis of mode of interaction we have the following classification: (a) concurrent (players interact simultaneously); and (b) turn-based (players interact in turn). The two sources of randomness in these games are randomness in transition function and randomness in strategies. In general, randomized strategies are more powerful than deterministic strategies, and randomness in transitions gives more general classes of games. We present a complete characterization for the classes of games where randomness is not helpful in: (a) the transition function (probabilistic transition can be simulated by deterministic transition); and (b) strategies (pure strategies are as powerful as randomized strategies). As consequence of our characterization we obtain new undecidability results for these games. "}],"publication_status":"published"},{"volume":6252,"quality_controlled":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"page":"1 - 16","date_published":"2010-10-12T00:00:00Z","publisher":"Springer","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"},{"call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"abstract":[{"text":"We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi, and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present an almost complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words.","lang":"eng"}],"publication_status":"published","doi":"10.1007/978-3-642-15643-4_1","_id":"3857","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5392"}]},"ec_funded":1,"date_created":"2018-12-11T12:05:33Z","citation":{"apa":"Chatterjee, K., &#38; Henzinger, T. A. (2010). Probabilistic Automata on infinite words: decidability and undecidability results (Vol. 6252, pp. 1–16). Presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15643-4_1\">https://doi.org/10.1007/978-3-642-15643-4_1</a>","short":"K. Chatterjee, T.A. Henzinger, in:, Springer, 2010, pp. 1–16.","ieee":"K. Chatterjee and T. A. Henzinger, “Probabilistic Automata on infinite words: decidability and undecidability results,” presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore, 2010, vol. 6252, pp. 1–16.","ama":"Chatterjee K, Henzinger TA. Probabilistic Automata on infinite words: decidability and undecidability results. In: Vol 6252. Springer; 2010:1-16. doi:<a href=\"https://doi.org/10.1007/978-3-642-15643-4_1\">10.1007/978-3-642-15643-4_1</a>","ista":"Chatterjee K, Henzinger TA. 2010. Probabilistic Automata on infinite words: decidability and undecidability results. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6252, 1–16.","mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger. <i>Probabilistic Automata on Infinite Words: Decidability and Undecidability Results</i>. Vol. 6252, Springer, 2010, pp. 1–16, doi:<a href=\"https://doi.org/10.1007/978-3-642-15643-4_1\">10.1007/978-3-642-15643-4_1</a>.","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “Probabilistic Automata on Infinite Words: Decidability and Undecidability Results,” 6252:1–16. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15643-4_1\">https://doi.org/10.1007/978-3-642-15643-4_1</a>."},"publist_id":"2324","year":"2010","status":"public","type":"conference","alternative_title":["LNCS"],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"12","oa_version":"None","month":"10","conference":{"name":"ATVA: Automated Technology for Verification and Analysis","start_date":"2010-09-21","location":"Singapore, Singapore","end_date":"2010-09-24"},"author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"language":[{"iso":"eng"}],"intvolume":"      6252","scopus_import":1,"title":"Probabilistic Automata on infinite words: decidability and undecidability results","date_updated":"2023-02-23T12:24:14Z","pubrep_id":"28"},{"file":[{"file_id":"7872","checksum":"770e86e5d78c56fddb4786a8da7ef126","file_name":"2010_LPAR_Chatterjee.pdf","date_created":"2020-05-19T16:29:04Z","date_updated":"2020-07-14T12:46:18Z","creator":"dernst","file_size":142836,"content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","day":"09","month":"12","conference":{"end_date":"2010-10-15","location":"Yogyakarta, Indonesia","start_date":"2010-10-10","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning"},"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"status":"public","type":"conference","alternative_title":["LNCS"],"intvolume":"      6397","scopus_import":1,"has_accepted_license":"1","title":"The complexity of partial-observation parity games","article_processing_charge":"No","date_updated":"2021-01-12T07:52:43Z","oa":1,"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided partial-observation (one player has partial-observation and the other player has complete-observation); and (c) complete-observation (both players have com- plete view of the game). We survey the complexity results for the problem of de- ciding the winner in various classes of partial-observation games with ω-regular winning conditions specified as parity objectives. We present a reduction from the class of parity objectives that depend on sequence of states of the game to the sub-class of parity objectives that only depend on the sequence of observations. We also establish that partial-observation acyclic games are PSPACE-complete."}],"ddc":["000"],"publication_status":"published","volume":6397,"quality_controlled":"1","department":[{"_id":"KrCh"}],"page":"1 - 14","date_published":"2010-12-09T00:00:00Z","publisher":"Springer","publist_id":"2323","date_created":"2018-12-11T12:05:33Z","citation":{"short":"K. Chatterjee, L. Doyen, in:, Springer, 2010, pp. 1–14.","ieee":"K. Chatterjee and L. Doyen, “The complexity of partial-observation parity games,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia, 2010, vol. 6397, pp. 1–14.","ama":"Chatterjee K, Doyen L. The complexity of partial-observation parity games. In: Vol 6397. Springer; 2010:1-14. doi:<a href=\"https://doi.org/10.1007/978-3-642-16242-8_1\">10.1007/978-3-642-16242-8_1</a>","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>The Complexity of Partial-Observation Parity Games</i>. Vol. 6397, Springer, 2010, pp. 1–14, doi:<a href=\"https://doi.org/10.1007/978-3-642-16242-8_1\">10.1007/978-3-642-16242-8_1</a>.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “The Complexity of Partial-Observation Parity Games,” 6397:1–14. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-16242-8_1\">https://doi.org/10.1007/978-3-642-16242-8_1</a>.","ista":"Chatterjee K, Doyen L. 2010. The complexity of partial-observation parity games. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 6397, 1–14.","apa":"Chatterjee, K., &#38; Doyen, L. (2010). The complexity of partial-observation parity games (Vol. 6397, pp. 1–14). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-16242-8_1\">https://doi.org/10.1007/978-3-642-16242-8_1</a>"},"year":"2010","doi":"10.1007/978-3-642-16242-8_1","_id":"3858","file_date_updated":"2020-07-14T12:46:18Z"},{"date_published":"2010-09-20T00:00:00Z","status":"public","type":"conference_editor","publisher":"Springer","alternative_title":["LNCS"],"quality_controlled":"1","volume":6246,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","month":"09","conference":{"start_date":"2010-09-08","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","end_date":"2010-09-10","location":"Klosterneuburg, Austria"},"abstract":[{"lang":"eng","text":"This book constitutes the proceedings of the 8th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2010, held in Klosterneuburg, Austria in September 2010. The 14 papers presented were carefully reviewed and selected from 31 submissions. In addition, the volume contains 3 invited talks and 2 invited tutorials.The aim of FORMATS is to promote the study of fundamental and practical aspects of timed systems, and to bring together researchers from different disciplines that share an interest in the modeling and analysis of timed systems. Typical topics include foundations and semantics, methods and tools, and applications."}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"20","oa_version":"None","_id":"3859","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-15297-9","year":"2010","date_updated":"2019-11-14T08:42:42Z","publist_id":"2322","title":"Formal modeling and analysis of timed systems","citation":{"short":"K. Chatterjee, T.A. Henzinger, eds., Formal Modeling and Analysis of Timed Systems, Springer, 2010.","ama":"Chatterjee K, Henzinger TA, eds. <i>Formal Modeling and Analysis of Timed Systems</i>. Vol 6246. Springer; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9\">10.1007/978-3-642-15297-9</a>","ieee":"K. Chatterjee and T. A. Henzinger, Eds., <i>Formal modeling and analysis of timed systems</i>, vol. 6246. Springer, 2010.","mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger, editors. <i>Formal Modeling and Analysis of Timed Systems</i>. Vol. 6246, Springer, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9\">10.1007/978-3-642-15297-9</a>.","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger, eds. <i>Formal Modeling and Analysis of Timed Systems</i>. Vol. 6246. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15297-9\">https://doi.org/10.1007/978-3-642-15297-9</a>.","ista":"Chatterjee K, Henzinger TA eds. 2010. Formal modeling and analysis of timed systems, Springer,p.","apa":"Chatterjee, K., &#38; Henzinger, T. A. (Eds.). (2010). <i>Formal modeling and analysis of timed systems</i> (Vol. 6246). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15297-9\">https://doi.org/10.1007/978-3-642-15297-9</a>"},"date_created":"2018-12-11T12:05:33Z","editor":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"related_material":{"link":[{"url":"https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=12721","description":"eBook available via IST BookList","relation":"other"}]},"intvolume":"      6246"},{"oa":1,"date_updated":"2021-01-12T07:52:44Z","pubrep_id":"59","article_processing_charge":"No","title":"Generalized mean-payoff and energy games","scopus_import":1,"intvolume":"         8","has_accepted_license":"1","language":[{"iso":"eng"}],"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Raskin","full_name":"Raskin, Jean","first_name":"Jean"}],"conference":{"location":"Chennai, India","end_date":"2010-12-18","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","start_date":"2010-12-15"},"month":"12","day":"13","oa_version":"Submitted Version","file":[{"date_updated":"2020-07-14T12:46:18Z","date_created":"2018-12-12T10:15:27Z","file_name":"IST-2012-59-v1+1_Generalized_mean-payoff_and_energy_games.pdf","checksum":"1caabd6319b979927208117a41192637","file_id":"5147","relation":"main_file","file_size":178278,"content_type":"application/pdf","access_level":"open_access","creator":"system"},{"creator":"system","access_level":"open_access","relation":"main_file","file_size":477976,"content_type":"application/pdf","checksum":"3a59759ceeacdb5b578f3803d5e6769b","file_id":"5148","file_name":"IST-2016-59-v2+1_2_1_.pdf","date_created":"2018-12-12T10:15:28Z","date_updated":"2020-07-14T12:46:18Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LIPIcs"],"type":"conference","status":"public","year":"2010","date_created":"2018-12-11T12:05:34Z","publist_id":"2321","citation":{"ieee":"K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, “Generalized mean-payoff and energy games,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 505–516.","ama":"Chatterjee K, Doyen L, Henzinger TA, Raskin J. Generalized mean-payoff and energy games. In: Vol 8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:505-516. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">10.4230/LIPIcs.FSTTCS.2010.505</a>","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–516.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Generalized Mean-Payoff and Energy Games,” 8:505–16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505</a>.","ista":"Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2010. Generalized mean-payoff and energy games. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 505–516.","mla":"Chatterjee, Krishnendu, et al. <i>Generalized Mean-Payoff and Energy Games</i>. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">10.4230/LIPIcs.FSTTCS.2010.505</a>.","apa":"Chatterjee, K., Doyen, L., Henzinger, T. A., &#38; Raskin, J. (2010). Generalized mean-payoff and energy games (Vol. 8, pp. 505–516). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505\">https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505</a>"},"file_date_updated":"2020-07-14T12:46:18Z","_id":"3860","doi":"10.4230/LIPIcs.FSTTCS.2010.505","publication_status":"published","ddc":["005"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"abstract":[{"lang":"eng","text":"In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Generalized mean-payoff and energy games replace individual weights by tuples, and the limit average (resp. running sum) of each coordinate must be (resp. remain) nonnegative. These games have applications in the synthesis of resource-bounded processes with multiple resources. We prove the finite-memory determinacy of generalized energy games and show the inter- reducibility of generalized mean-payoff and energy games for finite-memory strategies. We also improve the computational complexity for solving both classes of games with finite-memory strategies: while the previously best known upper bound was EXPSPACE, and no lower bound was known, we give an optimal coNP-complete bound. For memoryless strategies, we show that the problem of deciding the existence of a winning strategy for the protagonist is NP-complete."}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2010-12-13T00:00:00Z","page":"505 - 516","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"volume":8,"quality_controlled":"1"},{"status":"public","type":"journal_article","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"first_name":"Nir","full_name":"Piterman, Nir","last_name":"Piterman"}],"month":"06","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"creator":"system","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_size":189120,"file_name":"IST-2012-56-v1+1_Strategy_logic.pdf","checksum":"13bff93f3c2a014e2908145a4517f177","file_id":"4911","date_updated":"2020-07-14T12:46:18Z","date_created":"2018-12-12T10:11:54Z"}],"day":"01","oa_version":"Submitted Version","language":[{"iso":"eng"}],"publication":"Information and Computation","issue":"6","pubrep_id":"56","oa":1,"date_updated":"2023-02-23T11:46:57Z","title":"Strategy logic","has_accepted_license":"1","intvolume":"       208","scopus_import":1,"date_published":"2010-06-01T00:00:00Z","publisher":"Elsevier","volume":208,"quality_controlled":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"page":"677 - 693","publication_status":"published","ddc":["000","004"],"abstract":[{"text":"We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properties of nonzero-sum games in a simple and natural way. We show that the one-alternation fragment of strategy logic is strong enough to express the existence of Nash equilibria and secure equilibria, and subsumes other logics that were introduced to reason about games, such as ATL, ATL*, and game logic. We show that strategy logic is decidable, by constructing tree automata that recognize sets of strategies. While for the general logic, our decision procedure is nonelementary, for the simple fragment that is used above we show that the complexity is polynomial in the size of the game graph and optimal in the size of the formula (ranging from polynomial to 2EXPTIME depending on the form of the formula).","lang":"eng"}],"_id":"3861","file_date_updated":"2020-07-14T12:46:18Z","doi":"10.1016/j.ic.2009.07.004","year":"2010","publist_id":"2317","citation":{"mla":"Chatterjee, Krishnendu, et al. “Strategy Logic.” <i>Information and Computation</i>, vol. 208, no. 6, Elsevier, 2010, pp. 677–93, doi:<a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">10.1016/j.ic.2009.07.004</a>.","ista":"Chatterjee K, Henzinger TA, Piterman N. 2010. Strategy logic. Information and Computation. 208(6), 677–693.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy Logic.” <i>Information and Computation</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">https://doi.org/10.1016/j.ic.2009.07.004</a>.","short":"K. Chatterjee, T.A. Henzinger, N. Piterman, Information and Computation 208 (2010) 677–693.","ieee":"K. Chatterjee, T. A. Henzinger, and N. Piterman, “Strategy logic,” <i>Information and Computation</i>, vol. 208, no. 6. Elsevier, pp. 677–693, 2010.","ama":"Chatterjee K, Henzinger TA, Piterman N. Strategy logic. <i>Information and Computation</i>. 2010;208(6):677-693. doi:<a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">10.1016/j.ic.2009.07.004</a>","apa":"Chatterjee, K., Henzinger, T. A., &#38; Piterman, N. (2010). Strategy logic. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2009.07.004\">https://doi.org/10.1016/j.ic.2009.07.004</a>"},"date_created":"2018-12-11T12:05:34Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"3884"}]}},{"language":[{"iso":"eng"}],"publication":"Information and Computation","title":"Strategy construction for parity games with imperfect information","issue":"10","date_updated":"2023-02-23T11:46:47Z","pubrep_id":"58","oa":1,"scopus_import":1,"has_accepted_license":"1","intvolume":"       208","type":"journal_article","status":"public","author":[{"full_name":"Berwanger, Dietmar","first_name":"Dietmar","last_name":"Berwanger"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"De Wulf, Martin","first_name":"Martin","last_name":"De Wulf"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"}],"file":[{"access_level":"open_access","file_size":287496,"relation":"main_file","content_type":"application/pdf","creator":"system","date_created":"2018-12-12T10:17:44Z","date_updated":"2020-07-14T12:46:18Z","file_id":"5300","file_name":"IST-2012-58-v1+1_Strategy_construction_for_parity_games_with_imperfect_information.pdf","checksum":"29d146e4f8049dbb7f80bbf7ea3700ed"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"01","oa_version":"Submitted Version","month":"10","_id":"3863","file_date_updated":"2020-07-14T12:46:18Z","doi":"10.1016/j.ic.2009.09.006","date_created":"2018-12-11T12:05:35Z","publist_id":"2319","citation":{"ieee":"D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and T. A. Henzinger, “Strategy construction for parity games with imperfect information,” <i>Information and Computation</i>, vol. 208, no. 10. Elsevier, pp. 1206–1220, 2010.","ama":"Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. Strategy construction for parity games with imperfect information. <i>Information and Computation</i>. 2010;208(10):1206-1220. doi:<a href=\"https://doi.org/10.1016/j.ic.2009.09.006\">10.1016/j.ic.2009.09.006</a>","short":"D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, Information and Computation 208 (2010) 1206–1220.","chicago":"Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, and Thomas A Henzinger. “Strategy Construction for Parity Games with Imperfect Information.” <i>Information and Computation</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.ic.2009.09.006\">https://doi.org/10.1016/j.ic.2009.09.006</a>.","mla":"Berwanger, Dietmar, et al. “Strategy Construction for Parity Games with Imperfect Information.” <i>Information and Computation</i>, vol. 208, no. 10, Elsevier, 2010, pp. 1206–20, doi:<a href=\"https://doi.org/10.1016/j.ic.2009.09.006\">10.1016/j.ic.2009.09.006</a>.","ista":"Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. 2010. Strategy construction for parity games with imperfect information. Information and Computation. 208(10), 1206–1220.","apa":"Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., &#38; Henzinger, T. A. (2010). Strategy construction for parity games with imperfect information. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2009.09.006\">https://doi.org/10.1016/j.ic.2009.09.006</a>"},"year":"2010","related_material":{"record":[{"relation":"earlier_version","id":"3880","status":"public"}]},"ec_funded":1,"project":[{"name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"}],"volume":208,"quality_controlled":"1","page":"1206 - 1220","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_published":"2010-10-01T00:00:00Z","publisher":"Elsevier","publication_status":"published","abstract":[{"lang":"eng","text":"We consider two-player parity games with imperfect information in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., to determine the winning regions of players and corresponding winning strategies, one can use the subset construction to build an equivalent perfect-information game. Recently, an algorithm that avoids the inefficient subset construction has been proposed. The algorithm performs a fixed-point computation in a lattice of antichains, thus maintaining a succinct representation of state sets. However, this representation does not allow to recover winning strategies. In this paper, we build on the antichain approach to develop an algorithm for constructing the winning strategies in parity games of imperfect information. One major obstacle in adapting the classical procedure is that the complementation of attractor sets would break the invariant of downward-closedness on which the antichain representation relies. We overcome this difficulty by decomposing problem instances recursively into games with a combination of reachability, safety, and simpler parity conditions. We also report on an experimental implementation of our algorithm: to our knowledge, this is the first implementation of a procedure for solving imperfect-information parity games on graphs."}],"ddc":["005"]},{"status":"public","type":"conference","alternative_title":["LNCS"],"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"last_name":"Jobstmann","first_name":"Barbara","full_name":"Jobstmann, Barbara"},{"first_name":"Rohit","full_name":"Singh, Rohit","last_name":"Singh"}],"month":"07","conference":{"name":"CAV: Computer Aided Verification","start_date":"201-07-15","location":"Edinburgh, United Kingdom","end_date":"2010-07-19"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"http://arxiv.org/abs/1004.0739","open_access":"1"}],"oa_version":"Preprint","day":"09","language":[{"iso":"eng"}],"oa":1,"date_updated":"2023-02-23T10:17:28Z","title":"Measuring and synthesizing systems in probabilistic environments","intvolume":"      6174","scopus_import":1,"date_published":"2010-07-09T00:00:00Z","publisher":"Springer","volume":6174,"quality_controlled":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"page":"380 - 395","publication_status":"published","abstract":[{"text":"Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each word a value, such that a system is preferred if it generates a higher expected value. We solve the following optimal-synthesis problem: given an omega-regular specification, a Markov chain that describes the distribution of inputs, and a weighted automaton that measures how well a system satisfies the given specification tinder the given input assumption, synthesize a system that optimizes the measured value. For safety specifications and measures that are defined by mean-payoff automata, the optimal-synthesis problem amounts to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average reward objective, which can be done in polynomial time. For general omega-regular specifications, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives. We present some experimental results showing optimal systems that were automatically generated in this way.","lang":"eng"}],"_id":"3864","doi":"10.1007/978-3-642-14295-6_34","year":"2010","acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","publist_id":"2313","citation":{"ama":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing systems in probabilistic environments. In: Vol 6174. Springer; 2010:380-395. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_34\">10.1007/978-3-642-14295-6_34</a>","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom, 2010, vol. 6174, pp. 380–395.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2010, pp. 380–395.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments,” 6174:380–95. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_34\">https://doi.org/10.1007/978-3-642-14295-6_34</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Measuring and Synthesizing Systems in Probabilistic Environments</i>. Vol. 6174, Springer, 2010, pp. 380–95, doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_34\">10.1007/978-3-642-14295-6_34</a>.","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2010. Measuring and synthesizing systems in probabilistic environments. CAV: Computer Aided Verification, LNCS, vol. 6174, 380–395.","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Singh, R. (2010). Measuring and synthesizing systems in probabilistic environments (Vol. 6174, pp. 380–395). Presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_34\">https://doi.org/10.1007/978-3-642-14295-6_34</a>"},"date_created":"2018-12-11T12:05:35Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"1856"}]}},{"editor":[{"last_name":"Rosenblum","first_name":"David","full_name":"Rosenblum, David"},{"first_name":"Gabriele","full_name":"Taenzer, Gabriele","last_name":"Taenzer"}],"intvolume":"      6013","scopus_import":1,"year":"2010","date_updated":"2021-01-12T07:52:47Z","date_created":"2018-12-11T12:05:35Z","citation":{"ista":"Chatterjee K, De Alfaro L, Raman V, Sánchez C. 2010. Analyzing the impact of change in multi-threaded programs. FASE: Fundamental Approaches To Software Engineering, LNCS, vol. 6013, 293–307.","mla":"Chatterjee, Krishnendu, et al. <i>Analyzing the Impact of Change in Multi-Threaded Programs</i>. Edited by David Rosenblum and Gabriele Taenzer, vol. 6013, Springer, 2010, pp. 293–307, doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_21\">10.1007/978-3-642-12029-9_21</a>.","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, Vishwanath Raman, and César Sánchez. “Analyzing the Impact of Change in Multi-Threaded Programs.” edited by David Rosenblum and Gabriele Taenzer, 6013:293–307. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_21\">https://doi.org/10.1007/978-3-642-12029-9_21</a>.","ieee":"K. Chatterjee, L. De Alfaro, V. Raman, and C. Sánchez, “Analyzing the impact of change in multi-threaded programs,” presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus, 2010, vol. 6013, pp. 293–307.","ama":"Chatterjee K, De Alfaro L, Raman V, Sánchez C. Analyzing the impact of change in multi-threaded programs. In: Rosenblum D, Taenzer G, eds. Vol 6013. Springer; 2010:293-307. doi:<a href=\"https://doi.org/10.1007/978-3-642-12029-9_21\">10.1007/978-3-642-12029-9_21</a>","short":"K. Chatterjee, L. De Alfaro, V. Raman, C. Sánchez, in:, D. Rosenblum, G. Taenzer (Eds.), Springer, 2010, pp. 293–307.","apa":"Chatterjee, K., De Alfaro, L., Raman, V., &#38; Sánchez, C. (2010). Analyzing the impact of change in multi-threaded programs. In D. Rosenblum &#38; G. Taenzer (Eds.) (Vol. 6013, pp. 293–307). Presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-12029-9_21\">https://doi.org/10.1007/978-3-642-12029-9_21</a>"},"publist_id":"2315","title":"Analyzing the impact of change in multi-threaded programs","doi":"10.1007/978-3-642-12029-9_21","_id":"3865","language":[{"iso":"eng"}],"month":"04","conference":{"name":"FASE: Fundamental Approaches To Software Engineering","start_date":"2010-03-20","location":"Paphos, Cyprus","end_date":"2010-03-28"},"abstract":[{"lang":"eng","text":"We introduce a technique for debugging multi-threaded C programs and analyzing the impact of source code changes, and its implementation in the prototype tool DIRECT. Our approach uses a combination of source code instrumentation and runtime management. The source code along with a test harness is instrumented to monitor Operating System (OS) and user defined function calls. DIRECT tracks all concurrency control primitives and, optionally, data from the program. DIRECT maintains an abstract global state that combines information from every thread, including the sequence of function calls and concurrency primitives executed. The runtime manager can insert delays, provoking thread inter-leavings that may exhibit bugs that are difficult to reach otherwise. The runtime manager collects an approximation of the reachable state space and uses this approximation to assess the impact of change in a new version of the program."}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"None","day":"21","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"De Alfaro","full_name":"De Alfaro, Luca","first_name":"Luca"},{"full_name":"Raman, Vishwanath","first_name":"Vishwanath","last_name":"Raman"},{"full_name":"Sánchez, César","first_name":"César","last_name":"Sánchez"}],"publication_status":"published","date_published":"2010-04-21T00:00:00Z","status":"public","type":"conference","alternative_title":["LNCS"],"publisher":"Springer","volume":6013,"quality_controlled":"1","page":"293 - 307","department":[{"_id":"KrCh"}]},{"publication_status":"published","ddc":["004"],"abstract":[{"text":"Systems ought to behave reasonably even in circumstances that are not anticipated in their specifications. We propose a definition of robustness for liveness specifications which prescribes, for any number of environment assumptions that are violated, a minimal number of system guarantees that must still be fulfilled. This notion of robustness can be formulated and realized using a Generalized Reactivity formula. We present an algorithm for synthesizing robust systems from such formulas. For the important special case of Generalized Reactivity formulas of rank 1, our algorithm improves the complexity of [PPS06] for large specifications with a small number of assumptions and guarantees.","lang":"eng"}],"project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","call_identifier":"FP7","name":"Design for Embedded Systems"}],"date_published":"2010-07-01T00:00:00Z","publisher":"Springer","volume":6174,"quality_controlled":"1","page":"410 - 424","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"year":"2010","date_created":"2018-12-11T12:05:36Z","publist_id":"2310","citation":{"chicago":"Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Robustness in the Presence of Liveness.” edited by Tayssir Touili, Byron Cook, and Paul Jackson, 6174:410–24. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">https://doi.org/10.1007/978-3-642-14295-6_36</a>.","mla":"Bloem, Roderick, et al. <i>Robustness in the Presence of Liveness</i>. Edited by Tayssir Touili et al., vol. 6174, Springer, 2010, pp. 410–24, doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">10.1007/978-3-642-14295-6_36</a>.","ista":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2010. Robustness in the presence of liveness. CAV: Computer Aided Verification, LNCS, vol. 6174, 410–424.","ieee":"R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Robustness in the presence of liveness,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 410–424.","ama":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. Robustness in the presence of liveness. In: Touili T, Cook B, Jackson P, eds. Vol 6174. Springer; 2010:410-424. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">10.1007/978-3-642-14295-6_36</a>","short":"R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, T. Touili, B. Cook, P. Jackson (Eds.), Springer, 2010, pp. 410–424.","apa":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., &#38; Jobstmann, B. (2010). Robustness in the presence of liveness. In T. Touili, B. Cook, &#38; P. Jackson (Eds.) (Vol. 6174, pp. 410–424). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_36\">https://doi.org/10.1007/978-3-642-14295-6_36</a>"},"ec_funded":1,"_id":"3866","file_date_updated":"2020-07-14T12:46:19Z","doi":"10.1007/978-3-642-14295-6_36","author":[{"last_name":"Bloem","full_name":"Bloem, Roderick","first_name":"Roderick"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Greimel","first_name":"Karin","full_name":"Greimel, Karin"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"last_name":"Jobstmann","full_name":"Jobstmann, Barbara","first_name":"Barbara"}],"month":"07","conference":{"location":"Edinburgh, UK","end_date":"2010-07-19","name":"CAV: Computer Aided Verification","start_date":"2010-07-15"},"file":[{"file_size":213083,"access_level":"open_access","content_type":"application/pdf","relation":"main_file","creator":"system","date_updated":"2020-07-14T12:46:19Z","date_created":"2018-12-12T10:16:52Z","checksum":"9d204611c8d7855bed8134f8708a0010","file_name":"IST-2012-54-v1+1_Robustness_in_the_presence_of_liveness.pdf","file_id":"5243"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","day":"01","status":"public","type":"conference","alternative_title":["LNCS"],"date_updated":"2021-01-12T07:52:47Z","pubrep_id":"54","oa":1,"title":"Robustness in the presence of liveness","editor":[{"full_name":"Touili, Tayssir","first_name":"Tayssir","last_name":"Touili"},{"full_name":"Cook, Byron","first_name":"Byron","last_name":"Cook"},{"first_name":"Paul","full_name":"Jackson, Paul","last_name":"Jackson"}],"intvolume":"      6174","has_accepted_license":"1","scopus_import":1,"language":[{"iso":"eng"}]}]