[{"ddc":["000"],"day":"11","status":"public","oa":1,"month":"07","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"citation":{"chicago":"Chatterjee, Krishnendu. <i>Bounded Rationality in Concurrent Parity Games</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0008\">https://doi.org/10.15479/AT:IST-2011-0008</a>.","ieee":"K. Chatterjee, <i>Bounded rationality in concurrent parity games</i>. IST Austria, 2011.","apa":"Chatterjee, K. (2011). <i>Bounded rationality in concurrent parity games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0008\">https://doi.org/10.15479/AT:IST-2011-0008</a>","ama":"Chatterjee K. <i>Bounded Rationality in Concurrent Parity Games</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0008\">10.15479/AT:IST-2011-0008</a>","short":"K. Chatterjee, Bounded Rationality in Concurrent Parity Games, IST Austria, 2011.","ista":"Chatterjee K. 2011. Bounded rationality in concurrent parity games, IST Austria, 53p.","mla":"Chatterjee, Krishnendu. <i>Bounded Rationality in Concurrent Parity Games</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0008\">10.15479/AT:IST-2011-0008</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"technical_report","page":"53","file":[{"relation":"main_file","access_level":"open_access","creator":"system","content_type":"application/pdf","date_created":"2018-12-12T11:54:22Z","date_updated":"2020-07-14T12:46:39Z","file_id":"5544","file_size":500399,"checksum":"0fd38186409be819a911c4990fa79d1f","file_name":"IST-2011-0008_IST-2011-0008.pdf"}],"has_accepted_license":"1","year":"2011","publication_status":"published","_id":"5380","related_material":{"record":[{"relation":"later_version","status":"public","id":"3338"}]},"doi":"10.15479/AT:IST-2011-0008","alternative_title":["IST Austria Technical Report"],"date_updated":"2023-02-23T11:22:53Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"}],"pubrep_id":"16","date_published":"2011-07-11T00:00:00Z","abstract":[{"text":"We consider 2-player games played on a finite state space for an infinite number of rounds.  The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. We study concurrent games with ω-regular winning conditions specified as parity objectives.  We consider the qualitative analysis problems: the computation of the almost-sure and limit-sure winning set of states, where player 1 can ensure to win with probability 1 and with probability arbitrarily close to 1, respectively. In general the almost-sure and limit-sure winning strategies require both infinite-memory as well as infinite-precision (to describe probabilities). We study the bounded-rationality problem for qualitative analysis of concurrent parity games, where the strategy set for player 1 is restricted to bounded-resource strategies.  In terms of precision, strategies can be deterministic, uniform, finite-precision or infinite-precision;  and in terms of memory, strategies can be memoryless, finite-memory or infinite-memory. We present a precise and complete characterization of the qualitative winning sets for all combinations of classes of strategies. In particular, we show that uniform memoryless strategies are as powerful as finite-precision infinite-memory strategies, and infinite-precision memoryless strategies are as powerful as infinite-precision finite-memory strategies.  We show that the winning sets can be computed in O(n2d+3) time, where n is the size of the game structure and 2d is the number of priorities (or colors), and our algorithms are symbolic. The membership problem of whether a state belongs to a winning set can be decided in NP ∩ coNP. While this complexity is the same as for the simpler class of turn-based parity games, where in each state only one of the two players has a choice of moves, our algorithms,that are obtained by characterization of the winning sets as μ-calculus formulas, are considerably more involved than those for turn-based games.","lang":"eng"}],"publisher":"IST Austria","title":"Bounded rationality in concurrent parity games","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:39Z","date_created":"2018-12-12T11:39:00Z","oa_version":"Published Version"},{"oa_version":"Published Version","date_created":"2018-12-12T11:39:00Z","publisher":"IST Austria","title":"Partial-observation stochastic games: How to win when belief fails","file_date_updated":"2020-07-14T12:46:39Z","department":[{"_id":"KrCh"}],"abstract":[{"text":"In two-player finite-state stochastic games of partial obser- vation on graphs, in every state of the graph, the players simultaneously choose an action, and their joint actions determine a probability distri- bution over the successor states. The game is played for infinitely many rounds and thus the players construct an infinite path in the graph. We consider reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1) or pos- itively (i.e., with positive probability), no matter the strategy of the second player.\r\n\r\nWe classify such games according to the information and to the power of randomization available to the players. On the basis of information, the game can be one-sided with either (a) player 1, or (b) player 2 having partial observation (and the other player has perfect observation), or two- sided with (c) both players having partial observation. On the basis of randomization, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization.\r\n\r\nOur main results for pure strategies are as follows: (1) For one-sided games with player 2 perfect observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strate- gies are not sufficient, and present an exponential upper bound on mem- ory both for almost-sure and positive winning strategies; we show that the problem of deciding the existence of almost-sure and positive winning strategies for player 1 is EXPTIME-complete and present symbolic algo- rithms that avoid the explicit exponential construction. (2) For one-sided games with player 1 perfect observation we show that non-elementary memory is both necessary and sufficient for both almost-sure and posi- tive winning strategies. (3) We show that for the general (two-sided) case finite-memory strategies are sufficient for both positive and almost-sure winning, and at least non-elementary memory is required. We establish the equivalence of the almost-sure winning problems for pure strategies and for randomized strategies with actions invisible. Our equivalence re- sult exhibit serious flaws in previous results in the literature: we show a non-elementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed.","lang":"eng"}],"alternative_title":["IST Austria Technical Report"],"date_updated":"2023-02-23T11:05:48Z","doi":"10.15479/AT:IST-2011-0007","related_material":{"record":[{"relation":"later_version","status":"public","id":"1903"},{"id":"2211","status":"public","relation":"later_version"},{"id":"2955","status":"public","relation":"later_version"}]},"pubrep_id":"17","date_published":"2011-07-05T00:00:00Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"}],"publication_status":"published","has_accepted_license":"1","file":[{"date_created":"2018-12-12T11:53:27Z","content_type":"application/pdf","access_level":"open_access","creator":"system","relation":"main_file","file_name":"IST-2011-0007_IST-2011-0007.pdf","checksum":"06bf6dfc97f6006e3fd0e9a3f31bc961","file_size":574055,"date_updated":"2020-07-14T12:46:39Z","file_id":"5488"}],"year":"2011","_id":"5381","type":"technical_report","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"43","publication_identifier":{"issn":["2664-1690"]},"language":[{"iso":"eng"}],"month":"07","citation":{"chicago":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">https://doi.org/10.15479/AT:IST-2011-0007</a>.","ieee":"K. Chatterjee and L. Doyen, <i>Partial-observation stochastic games: How to win when belief fails</i>. IST Austria, 2011.","apa":"Chatterjee, K., &#38; Doyen, L. (2011). <i>Partial-observation stochastic games: How to win when belief fails</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">https://doi.org/10.15479/AT:IST-2011-0007</a>","ama":"Chatterjee K, Doyen L. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">10.15479/AT:IST-2011-0007</a>","ista":"Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to win when belief fails, IST Austria, 43p.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Partial-Observation Stochastic Games: How to Win When Belief Fails</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0007\">10.15479/AT:IST-2011-0007</a>.","short":"K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win When Belief Fails, IST Austria, 2011."},"day":"05","ddc":["000","005"],"oa":1,"status":"public"},{"page":"18","type":"technical_report","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5382","publication_status":"published","year":"2011","file":[{"date_updated":"2020-07-14T12:46:40Z","file_id":"5546","file_size":335997,"file_name":"IST-2011-0006_IST-2011-0006.pdf","checksum":"1322b652d6ab07eb5248298a3f91c1cf","relation":"main_file","creator":"system","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T11:54:24Z"}],"has_accepted_license":"1","status":"public","oa":1,"day":"27","ddc":["000","005"],"citation":{"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>.","ista":"Chatterjee K. 2011. Robustness of structurally equivalent concurrent parity games, IST Austria, 18p.","short":"K. Chatterjee, Robustness of Structurally Equivalent Concurrent Parity Games, 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>","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>","ieee":"K. Chatterjee, <i>Robustness of structurally equivalent concurrent parity games</i>. IST Austria, 2011.","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>."},"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"month":"06","file_date_updated":"2020-07-14T12:46:40Z","department":[{"_id":"KrCh"}],"title":"Robustness of structurally equivalent concurrent parity games","publisher":"IST Austria","oa_version":"Published Version","date_created":"2018-12-12T11:39:00Z","pubrep_id":"18","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"}],"date_published":"2011-06-27T00:00:00Z","related_material":{"record":[{"id":"3341","relation":"later_version","status":"public"}]},"date_updated":"2023-02-23T11:23:01Z","alternative_title":["IST Austria Technical Report"],"doi":"10.15479/AT:IST-2011-0006","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"}]},{"ddc":["000","006"],"day":"26","oa":1,"status":"public","month":"04","publication_identifier":{"issn":["2664-1690"]},"language":[{"iso":"eng"}],"citation":{"ama":"Wies T, Muñiz M, Kuncak V. <i>On an Efficient Decision Procedure for Imperative Tree Data Structures</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0005\">10.15479/AT:IST-2011-0005</a>","ista":"Wies T, Muñiz M, Kuncak V. 2011. On an efficient decision procedure for imperative tree data structures, IST Austria, 25p.","mla":"Wies, Thomas, et al. <i>On an Efficient Decision Procedure for Imperative Tree Data Structures</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0005\">10.15479/AT:IST-2011-0005</a>.","short":"T. Wies, M. Muñiz, V. Kuncak, On an Efficient Decision Procedure for Imperative Tree Data Structures, IST Austria, 2011.","chicago":"Wies, Thomas, Marco Muñiz, and Viktor Kuncak. <i>On an Efficient Decision Procedure for Imperative Tree Data Structures</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0005\">https://doi.org/10.15479/AT:IST-2011-0005</a>.","ieee":"T. Wies, M. Muñiz, and V. Kuncak, <i>On an efficient decision procedure for imperative tree data structures</i>. IST Austria, 2011.","apa":"Wies, T., Muñiz, M., &#38; Kuncak, V. (2011). <i>On an efficient decision procedure for imperative tree data structures</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0005\">https://doi.org/10.15479/AT:IST-2011-0005</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"technical_report","page":"25","year":"2011","file":[{"creator":"system","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T11:53:01Z","content_type":"application/pdf","date_updated":"2020-07-14T12:46:40Z","file_id":"5462","file_name":"IST-2011-0005_IST-2011-0005.pdf","checksum":"b20029184c4a819c5f4466a4a3d238b5","file_size":619053}],"has_accepted_license":"1","publication_status":"published","_id":"5383","related_material":{"record":[{"id":"3323","status":"public","relation":"later_version"}]},"date_updated":"2023-02-23T11:22:16Z","alternative_title":["IST Austria Technical Report"],"doi":"10.15479/AT:IST-2011-0005","pubrep_id":"19","author":[{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","full_name":"Wies, Thomas","last_name":"Wies","first_name":"Thomas"},{"full_name":"Muñiz, Marco","last_name":"Muñiz","first_name":"Marco"},{"full_name":"Kuncak, Viktor","first_name":"Viktor","last_name":"Kuncak"}],"date_published":"2011-04-26T00:00:00Z","abstract":[{"lang":"eng","text":"We present a new decidable logic called TREX for expressing constraints about imperative tree data structures. In particular, TREX supports a transitive closure operator that can express reachability constraints, which often appear in data structure invariants. We show that our logic is closed under weakest precondition computation, which enables its use for automated software verification. We further show that satisfiability of formulas in TREX is decidable in NP. The low complexity makes it an attractive alternative to more expensive logics such as monadic second-order logic (MSOL) over trees, which have been traditionally used for reasoning about tree data structures."}],"publisher":"IST Austria","file_date_updated":"2020-07-14T12:46:40Z","department":[{"_id":"ToHe"}],"title":"On an efficient decision procedure for imperative tree data structures","date_created":"2018-12-12T11:39:01Z","oa_version":"Published Version"},{"file_date_updated":"2020-07-14T12:46:40Z","title":"Decidable problems for probabilistic automata on infinite words","department":[{"_id":"KrCh"}],"publisher":"IST Austria","oa_version":"Published Version","date_created":"2018-12-12T11:39:01Z","pubrep_id":"20","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tracol, Mathieu","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87","first_name":"Mathieu","last_name":"Tracol"}],"date_published":"2011-04-11T00:00:00Z","doi":"10.15479/AT:IST-2011-0004","related_material":{"record":[{"id":"2957","status":"public","relation":"later_version"}]},"date_updated":"2023-02-23T11:05:53Z","alternative_title":["IST Austria Technical Report"],"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"}],"page":"30","type":"technical_report","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5384","publication_status":"published","year":"2011","file":[{"file_size":570827,"file_name":"IST-2011-004_IST-2011-0004.pdf","checksum":"f5a0f664fadc335990f5fcf138df19f1","file_id":"5545","date_updated":"2020-07-14T12:46:40Z","content_type":"application/pdf","date_created":"2018-12-12T11:54:23Z","relation":"main_file","creator":"system","access_level":"open_access"}],"has_accepted_license":"1","oa":1,"status":"public","day":"11","ddc":["000","005"],"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>","ieee":"K. Chatterjee and M. Tracol, <i>Decidable problems for probabilistic automata on infinite words</i>. IST Austria, 2011.","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.","short":"K. Chatterjee, M. Tracol, Decidable Problems for Probabilistic Automata on Infinite Words, IST Austria, 2011.","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>.","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>"},"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"month":"04"},{"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"}],"oa_version":"Published Version","date_created":"2018-12-12T11:39:02Z","ec_funded":1,"title":"Temporal specifications with accumulative values","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"IST Austria","citation":{"ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, <i>Temporal specifications with accumulative values</i>. IST Austria, 2011.","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>.","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>","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>","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.","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011."},"publication_identifier":{"issn":["2664-1690"]},"status":"public","oa":1,"_id":"5385","has_accepted_license":"1","year":"2011","page":"14","type":"technical_report","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2011-04-04T00:00:00Z","pubrep_id":"21","author":[{"first_name":"Udi","last_name":"Boker","full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"}],"alternative_title":["IST Austria Technical Report"],"doi":"10.15479/AT:IST-2011-0003","date_updated":"2023-02-23T11:23:41Z","related_material":{"record":[{"id":"2038","relation":"later_version","status":"public"},{"id":"3356","status":"public","relation":"later_version"}]},"file_date_updated":"2020-07-14T12:46:41Z","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"},{"call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"month":"04","day":"04","ddc":["000","004"],"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","creator":"system","content_type":"application/pdf","date_created":"2018-12-12T11:53:00Z","file_id":"5461","date_updated":"2020-07-14T12:46:41Z","file_size":366281,"checksum":"8491d0d48c4911620ecd5350b413c11e","file_name":"IST-2011-0003_IST-2011-0003.pdf"}]},{"citation":{"chicago":"Chen, Chao, Daniel Freedman, and Christoph Lampert. <i>Enforcing Topological Constraints in Random Field Image Segmentation</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0002\">https://doi.org/10.15479/AT:IST-2011-0002</a>.","ieee":"C. Chen, D. Freedman, and C. Lampert, <i>Enforcing topological constraints in random field image segmentation</i>. IST Austria, 2011.","apa":"Chen, C., Freedman, D., &#38; Lampert, C. (2011). <i>Enforcing topological constraints in random field image segmentation</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0002\">https://doi.org/10.15479/AT:IST-2011-0002</a>","ama":"Chen C, Freedman D, Lampert C. <i>Enforcing Topological Constraints in Random Field Image Segmentation</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0002\">10.15479/AT:IST-2011-0002</a>","ista":"Chen C, Freedman D, Lampert C. 2011. Enforcing topological constraints in random field image segmentation, IST Austria, 69p.","short":"C. Chen, D. Freedman, C. Lampert, Enforcing Topological Constraints in Random Field Image Segmentation, IST Austria, 2011.","mla":"Chen, Chao, et al. <i>Enforcing Topological Constraints in Random Field Image Segmentation</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0002\">10.15479/AT:IST-2011-0002</a>."},"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"month":"03","oa":1,"status":"public","day":"28","ddc":["000"],"_id":"5386","publication_status":"published","year":"2011","file":[{"creator":"system","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T11:53:34Z","content_type":"application/pdf","date_updated":"2020-07-14T12:46:41Z","file_id":"5495","file_name":"IST-2011-0002_IST-2011-0002.pdf","checksum":"ad64c2add5fe2ad10e9d5c669f3f9526","file_size":26390601}],"has_accepted_license":"1","page":"69","type":"technical_report","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We introduce TopoCut: a new way to integrate knowledge about topological properties (TPs) into random field image segmentation model. Instead of including TPs as additional constraints during minimization of the energy function, we devise an efficient algorithm for modifying the unary potentials such that the resulting segmentation is guaranteed with the desired properties. Our method is more flexible in the sense that it handles more topology constraints than previous methods, which were only able to enforce pairwise or global connectivity. In particular, our method is very fast, making it for the first time possible to enforce global topological properties in practical image segmentation tasks."}],"date_published":"2011-03-28T00:00:00Z","author":[{"id":"3E92416E-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chao","last_name":"Chen","first_name":"Chao"},{"first_name":"Daniel","last_name":"Freedman","full_name":"Freedman, Daniel"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887","first_name":"Christoph"}],"pubrep_id":"22","date_updated":"2023-02-23T11:22:48Z","related_material":{"record":[{"id":"3336","relation":"later_version","status":"public"}]},"doi":"10.15479/AT:IST-2011-0002","alternative_title":["IST Austria Technical Report"],"oa_version":"Published Version","date_created":"2018-12-12T11:39:02Z","title":"Enforcing topological constraints in random field image segmentation","file_date_updated":"2020-07-14T12:46:41Z","department":[{"_id":"ChLa"}],"publisher":"IST Austria"},{"title":"Energy and mean-payoff parity Markov decision processes","file_date_updated":"2020-07-14T12:46:41Z","department":[{"_id":"KrCh"}],"publisher":"IST Austria","oa_version":"Published Version","date_created":"2018-12-12T11:39:02Z","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"}],"date_published":"2011-02-16T00:00:00Z","pubrep_id":"23","date_updated":"2023-02-23T11:23:11Z","alternative_title":["IST Austria Technical Report"],"related_material":{"record":[{"id":"3345","status":"public","relation":"later_version"}]},"doi":"10.15479/AT:IST-2011-0001","abstract":[{"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.","lang":"eng"}],"page":"20","type":"technical_report","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5387","publication_status":"published","has_accepted_license":"1","file":[{"file_size":329976,"checksum":"824d6c70e6d3feb3e836b009e0b3cf73","file_name":"IST-2011-0001_IST-2011-0001.pdf","date_updated":"2020-07-14T12:46:41Z","file_id":"5458","content_type":"application/pdf","date_created":"2018-12-12T11:52:57Z","relation":"main_file","creator":"system","access_level":"open_access"}],"year":"2011","oa":1,"status":"public","day":"16","ddc":["000","005"],"citation":{"mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Energy and Mean-Payoff Parity Markov Decision Processes</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0001\">10.15479/AT:IST-2011-0001</a>.","short":"K. Chatterjee, L. Doyen, Energy and Mean-Payoff Parity Markov Decision Processes, IST Austria, 2011.","ista":"Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov decision processes, IST Austria, 20p.","ama":"Chatterjee K, Doyen L. <i>Energy and Mean-Payoff Parity Markov Decision Processes</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0001\">10.15479/AT:IST-2011-0001</a>","apa":"Chatterjee, K., &#38; Doyen, L. (2011). <i>Energy and mean-payoff parity Markov decision processes</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0001\">https://doi.org/10.15479/AT:IST-2011-0001</a>","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Energy and Mean-Payoff Parity Markov Decision Processes</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0001\">https://doi.org/10.15479/AT:IST-2011-0001</a>.","ieee":"K. Chatterjee and L. Doyen, <i>Energy and mean-payoff parity Markov decision processes</i>. IST Austria, 2011."},"publication_identifier":{"issn":["2664-1690"]},"language":[{"iso":"eng"}],"month":"02"},{"publication_status":"published","intvolume":"       101","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3218319/","open_access":"1"}],"language":[{"iso":"eng"}],"month":"11","day":"16","pmid":1,"quality_controlled":"1","scopus_import":"1","date_updated":"2021-04-16T11:54:49Z","doi":"10.1016/j.bpj.2011.09.040","article_processing_charge":"No","author":[{"first_name":"Heungwon","last_name":"Park","full_name":"Park, Heungwon"},{"full_name":"Oikonomou, Panos","first_name":"Panos","last_name":"Oikonomou"},{"first_name":"Calin C","last_name":"Guet","orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cluzel, Philippe","first_name":"Philippe","last_name":"Cluzel"}],"date_published":"2011-11-16T00:00:00Z","year":"2011","_id":"6496","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"2336-2340","volume":101,"publication_identifier":{"issn":["0006-3495"]},"citation":{"apa":"Park, H., Oikonomou, P., Guet, C. C., &#38; Cluzel, P. (2011). Noise underlies switching behavior of the bacterial flagellum. <i>Biophysical Journal</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.bpj.2011.09.040\">https://doi.org/10.1016/j.bpj.2011.09.040</a>","chicago":"Park, Heungwon, Panos Oikonomou, Calin C Guet, and Philippe Cluzel. “Noise Underlies Switching Behavior of the Bacterial Flagellum.” <i>Biophysical Journal</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.bpj.2011.09.040\">https://doi.org/10.1016/j.bpj.2011.09.040</a>.","ieee":"H. Park, P. Oikonomou, C. C. Guet, and P. Cluzel, “Noise underlies switching behavior of the bacterial flagellum,” <i>Biophysical Journal</i>, vol. 101, no. 10. Elsevier, pp. 2336–2340, 2011.","short":"H. Park, P. Oikonomou, C.C. Guet, P. Cluzel, Biophysical Journal 101 (2011) 2336–2340.","ista":"Park H, Oikonomou P, Guet CC, Cluzel P. 2011. Noise underlies switching behavior of the bacterial flagellum. Biophysical Journal. 101(10), 2336–2340.","mla":"Park, Heungwon, et al. “Noise Underlies Switching Behavior of the Bacterial Flagellum.” <i>Biophysical Journal</i>, vol. 101, no. 10, Elsevier, 2011, pp. 2336–40, doi:<a href=\"https://doi.org/10.1016/j.bpj.2011.09.040\">10.1016/j.bpj.2011.09.040</a>.","ama":"Park H, Oikonomou P, Guet CC, Cluzel P. Noise underlies switching behavior of the bacterial flagellum. <i>Biophysical Journal</i>. 2011;101(10):2336-2340. doi:<a href=\"https://doi.org/10.1016/j.bpj.2011.09.040\">10.1016/j.bpj.2011.09.040</a>"},"external_id":{"pmid":["22098731"]},"issue":"10","oa":1,"status":"public","oa_version":"Published Version","date_created":"2019-05-28T11:54:29Z","publisher":"Elsevier","department":[{"_id":"CaGu"}],"title":"Noise underlies switching behavior of the bacterial flagellum","publication":"Biophysical Journal","abstract":[{"lang":"eng","text":"We report the switching behavior of the full bacterial flagellum system that includes the filament and the motor in wild-type Escherichia coli cells. In sorting the motor behavior by the clockwise bias, we find that the distributions of the clockwise (CW) and counterclockwise (CCW) intervals are either exponential or nonexponential with long tails. At low bias, CW intervals are exponentially distributed and CCW intervals exhibit long tails. At intermediate CW bias (0.5) both CW and CCW intervals are mainly exponentially distributed. A simple model suggests that these two distinct switching behaviors are governed by the presence of signaling noise within the chemotaxis network. Low noise yields exponentially distributed intervals, whereas large noise yields nonexponential behavior with long tails. These drastically different motor statistics may play a role in optimizing bacterial behavior for a wide range of environmental conditions."}]},{"oa_version":"Published Version","date_created":"2021-07-11T22:01:19Z","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"title":"Incremental-decremental algorithm for computing AT-models and persistent homology","publication":"Computer Analysis of Images and Patterns","abstract":[{"text":"In this paper, we establish a correspondence between the incremental algorithm for computing AT-models [8,9] and the one for computing persistent homology [6,14,15]. We also present a decremental algorithm for computing AT-models that allows to extend the persistence computation to a wider setting. Finally, we show how to combine incremental and decremental techniques for persistent homology computation.","lang":"eng"}],"year":"2011","_id":"9648","type":"conference","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","page":"286-293","volume":6854,"publication_identifier":{"isbn":["9783642236716"],"eissn":["16113349"],"issn":["03029743"]},"citation":{"apa":"Gonzalez-Diaz, R., Ion, A., Jimenez, M. J., &#38; Poyatos, R. (2011). Incremental-decremental algorithm for computing AT-models and persistent homology. In <i>Computer Analysis of Images and Patterns</i> (Vol. 6854, pp. 286–293). Seville, Spain: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-23672-3_35\">https://doi.org/10.1007/978-3-642-23672-3_35</a>","ieee":"R. Gonzalez-Diaz, A. Ion, M. J. Jimenez, and R. Poyatos, “Incremental-decremental algorithm for computing AT-models and persistent homology,” in <i>Computer Analysis of Images and Patterns</i>, Seville, Spain, 2011, vol. 6854, pp. 286–293.","chicago":"Gonzalez-Diaz, Rocio, Adrian Ion, Maria Jose Jimenez, and Regina Poyatos. “Incremental-Decremental Algorithm for Computing AT-Models and Persistent Homology.” In <i>Computer Analysis of Images and Patterns</i>, 6854:286–93. Springer Nature, 2011. <a href=\"https://doi.org/10.1007/978-3-642-23672-3_35\">https://doi.org/10.1007/978-3-642-23672-3_35</a>.","ista":"Gonzalez-Diaz R, Ion A, Jimenez MJ, Poyatos R. 2011. Incremental-decremental algorithm for computing AT-models and persistent homology. Computer Analysis of Images and Patterns. CAIP: International Conference on Computer Analysis of Images and Patterns, LNCS, vol. 6854, 286–293.","mla":"Gonzalez-Diaz, Rocio, et al. “Incremental-Decremental Algorithm for Computing AT-Models and Persistent Homology.” <i>Computer Analysis of Images and Patterns</i>, vol. 6854, Springer Nature, 2011, pp. 286–93, doi:<a href=\"https://doi.org/10.1007/978-3-642-23672-3_35\">10.1007/978-3-642-23672-3_35</a>.","short":"R. Gonzalez-Diaz, A. Ion, M.J. Jimenez, R. Poyatos, in:, Computer Analysis of Images and Patterns, Springer Nature, 2011, pp. 286–293.","ama":"Gonzalez-Diaz R, Ion A, Jimenez MJ, Poyatos R. Incremental-decremental algorithm for computing AT-models and persistent homology. In: <i>Computer Analysis of Images and Patterns</i>. Vol 6854. Springer Nature; 2011:286-293. doi:<a href=\"https://doi.org/10.1007/978-3-642-23672-3_35\">10.1007/978-3-642-23672-3_35</a>"},"status":"public","oa":1,"conference":{"end_date":"2011-08-31","name":"CAIP: International Conference on Computer Analysis of Images and Patterns","start_date":"2011-08-29","location":"Seville, Spain"},"quality_controlled":"1","scopus_import":"1","doi":"10.1007/978-3-642-23672-3_35","alternative_title":["LNCS"],"date_updated":"2021-08-12T13:53:17Z","article_processing_charge":"No","author":[{"full_name":"Gonzalez-Diaz, Rocio","first_name":"Rocio","last_name":"Gonzalez-Diaz"},{"id":"29F89302-F248-11E8-B48F-1D18A9856A87","full_name":"Ion, Adrian","last_name":"Ion","first_name":"Adrian"},{"last_name":"Jimenez","first_name":"Maria Jose","full_name":"Jimenez, Maria Jose"},{"first_name":"Regina","last_name":"Poyatos","full_name":"Poyatos, Regina"}],"date_published":"2011-08-01T00:00:00Z","publication_status":"published","intvolume":"      6854","main_file_link":[{"url":"http://hdl.handle.net/11441/30766","open_access":"1"}],"language":[{"iso":"eng"}],"month":"08","day":"01"},{"publisher":"IST Austria","title":"Data from: Effect of oceanographic barriers and overfishing on the population genetic structure of the European spiny lobster (Palinurus elephas)","department":[{"_id":"NiBa"}],"date_created":"2021-08-02T07:11:19Z","oa_version":"Published Version","article_processing_charge":"No","doi":"10.5061/dryad.299h8","date_updated":"2023-02-23T11:25:25Z","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"3395"}]},"author":[{"orcid":"0000-0002-0343-8329","last_name":"Palero","first_name":"Ferran","id":"3F0E2A22-F248-11E8-B48F-1D18A9856A87","full_name":"Palero, Ferran"},{"last_name":"Abello","first_name":"Pere","full_name":"Abello, Pere"},{"full_name":"Macpherson, Enrique","last_name":"Macpherson","first_name":"Enrique"},{"full_name":"Beaumont, Mark","last_name":"Beaumont","first_name":"Mark"},{"full_name":"Pascual, Marta","first_name":"Marta","last_name":"Pascual"}],"date_published":"2011-05-12T00:00:00Z","abstract":[{"text":"Defining population structure and genetic diversity levels is of the utmost importance for developing efficient conservation strategies. Overfishing has caused mean annual catches of the European spiny lobster (Palinurus elephas) to decrease alarmingly along its distribution area. In this context, there is a need for comprehensive studies to evaluate the genetic health of the exploited populations. The present work is based on a set of 10 nuclear markers amplified in 331 individuals from 10 different localities covering most of P. elephas distribution area. Samples from Atlantic and Mediterranean basins showed small but significant differences, indicating that P. elephas populations do not behave as a single panmictic unit but form two partially-overlapping groups. Despite intense overfishing, our dataset did not recover a recent bottleneck signal, and showed a large and stable historical effective size instead. This result could be accounted for by specific life history traits (reproduction and longevity) and the limitations of molecular markers in covering very recent timescales for non temporal samples. Our study emphasizes the necessity of integrating information on effective population sizes and life history parameters when evaluating population connectivity levels from genetic data.","lang":"eng"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","type":"research_data_reference","year":"2011","_id":"9762","main_file_link":[{"url":"https://doi.org/10.5061/dryad.299h8","open_access":"1"}],"day":"12","oa":1,"status":"public","month":"05","citation":{"mla":"Palero, Ferran, et al. <i>Data from: Effect of Oceanographic Barriers and Overfishing on the Population Genetic Structure of the European Spiny Lobster (Palinurus Elephas)</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.5061/dryad.299h8\">10.5061/dryad.299h8</a>.","short":"F. Palero, P. Abello, E. Macpherson, M. Beaumont, M. Pascual, (2011).","ista":"Palero F, Abello P, Macpherson E, Beaumont M, Pascual M. 2011. Data from: Effect of oceanographic barriers and overfishing on the population genetic structure of the European spiny lobster (Palinurus elephas), IST Austria, <a href=\"https://doi.org/10.5061/dryad.299h8\">10.5061/dryad.299h8</a>.","ama":"Palero F, Abello P, Macpherson E, Beaumont M, Pascual M. Data from: Effect of oceanographic barriers and overfishing on the population genetic structure of the European spiny lobster (Palinurus elephas). 2011. doi:<a href=\"https://doi.org/10.5061/dryad.299h8\">10.5061/dryad.299h8</a>","apa":"Palero, F., Abello, P., Macpherson, E., Beaumont, M., &#38; Pascual, M. (2011). Data from: Effect of oceanographic barriers and overfishing on the population genetic structure of the European spiny lobster (Palinurus elephas). IST Austria. <a href=\"https://doi.org/10.5061/dryad.299h8\">https://doi.org/10.5061/dryad.299h8</a>","ieee":"F. Palero, P. Abello, E. Macpherson, M. Beaumont, and M. Pascual, “Data from: Effect of oceanographic barriers and overfishing on the population genetic structure of the European spiny lobster (Palinurus elephas).” IST Austria, 2011.","chicago":"Palero, Ferran, Pere Abello, Enrique Macpherson, Mark Beaumont, and Marta Pascual. “Data from: Effect of Oceanographic Barriers and Overfishing on the Population Genetic Structure of the European Spiny Lobster (Palinurus Elephas).” IST Austria, 2011. <a href=\"https://doi.org/10.5061/dryad.299h8\">https://doi.org/10.5061/dryad.299h8</a>."}},{"year":"2011","_id":"3345","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","volume":6907,"page":"206 - 218","citation":{"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>","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Energy and Mean-Payoff Parity Markov Decision Processes,” 6907:206–18. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22993-0_21\">https://doi.org/10.1007/978-3-642-22993-0_21</a>.","ieee":"K. Chatterjee and L. Doyen, “Energy and mean-payoff parity Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland, 2011, vol. 6907, pp. 206–218.","ista":"Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6907, 206–218.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Energy and Mean-Payoff Parity Markov Decision Processes</i>. Vol. 6907, Springer, 2011, pp. 206–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-22993-0_21\">10.1007/978-3-642-22993-0_21</a>.","short":"K. Chatterjee, L. Doyen, in:, Springer, 2011, pp. 206–218.","ama":"Chatterjee K, Doyen L. Energy and mean-payoff parity Markov Decision Processes. In: Vol 6907. Springer; 2011:206-218. doi:<a href=\"https://doi.org/10.1007/978-3-642-22993-0_21\">10.1007/978-3-642-22993-0_21</a>"},"external_id":{"arxiv":["1104.2909"]},"status":"public","oa":1,"publist_id":"3276","date_created":"2018-12-11T12:02:48Z","oa_version":"Preprint","publisher":"Springer","title":"Energy and mean-payoff parity Markov Decision Processes","department":[{"_id":"KrCh"}],"abstract":[{"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.","lang":"eng"}],"arxiv":1,"publication_status":"published","intvolume":"      6907","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.2909"}],"month":"09","language":[{"iso":"eng"}],"project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"day":"28","conference":{"end_date":"2011-08-26","name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2011-08-22","location":"Warsaw, Poland"},"quality_controlled":"1","scopus_import":1,"date_updated":"2023-02-23T12:23:59Z","doi":"10.1007/978-3-642-22993-0_21","related_material":{"record":[{"id":"5387","relation":"earlier_version","status":"public"}]},"alternative_title":["LNCS"],"date_published":"2011-09-28T00:00:00Z","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}]},{"publist_id":"3275","date_created":"2018-12-11T12:02:48Z","conference":{"name":"LICS: Logic in Computer Science","end_date":"2011-06-24","location":"Toronto, Canada","start_date":"2011-06-21"},"ec_funded":1,"oa_version":"Submitted Version","article_number":"5970225","publisher":"IEEE","title":"Two views on multiple mean payoff objectives in Markov Decision Processes","department":[{"_id":"KrCh"}],"quality_controlled":"1","scopus_import":1,"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"}],"doi":"10.1109/LICS.2011.10","date_updated":"2021-01-12T07:42:49Z","author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"last_name":"Brožek","first_name":"Václav","full_name":"Brožek, Václav"},{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Forejt","first_name":"Vojtěch","full_name":"Forejt, Vojtěch"},{"last_name":"Kučera","first_name":"Antonín","full_name":"Kučera, Antonín"}],"date_published":"2011-06-21T00:00:00Z","year":"2011","publication_status":"published","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.3489"}],"_id":"3346","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"conference","month":"06","language":[{"iso":"eng"}],"project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"citation":{"short":"T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, in:, IEEE, 2011.","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>.","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>","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>","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>.","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."},"day":"21","oa":1,"status":"public"},{"publication_status":"published","intvolume":"      6638","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1101.1727"}],"day":"16","language":[{"iso":"eng"}],"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"month":"06","conference":{"end_date":"2011-05-31","name":"LATA: Language and Automata Theory and Applications","start_date":"2011-05-26","location":"Tarragona, Spain"},"date_updated":"2021-01-12T07:42:50Z","alternative_title":["LNCS"],"doi":"10.1007/978-3-642-21254-3_16","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Fijalkow","first_name":"Nathanaël","id":"A1B5DD72-E997-11E9-8398-E808B6C6ADC0","full_name":"Fijalkow, Nathanaël"}],"date_published":"2011-06-16T00:00:00Z","quality_controlled":"1","scopus_import":1,"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"216 - 226","volume":6638,"year":"2011","_id":"3347","external_id":{"arxiv":["1101.1727"]},"status":"public","oa":1,"citation":{"ista":"Chatterjee K, Fijalkow N. 2011. Finitary languages. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 216–226.","short":"K. Chatterjee, N. Fijalkow, in:, Springer, 2011, pp. 216–226.","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>.","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>."},"publisher":"Springer","title":"Finitary languages","department":[{"_id":"KrCh"}],"publist_id":"3274","oa_version":"Preprint","date_created":"2018-12-11T12:02:48Z","arxiv":1,"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"}]},{"oa":1,"status":"public","day":"31","citation":{"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.","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."},"month":"01","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"page":"221 - 230","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"conference","main_file_link":[{"url":"http://arxiv.org/abs/1101.5842","open_access":"1"}],"_id":"3348","year":"2011","publication_status":"published","date_published":"2011-01-31T00:00:00Z","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Vinayak","last_name":"Prabhu","full_name":"Prabhu, Vinayak"}],"date_updated":"2021-01-12T07:42:50Z","doi":"10.1145/1967701.1967734","scopus_import":1,"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"}],"quality_controlled":"1","department":[{"_id":"KrCh"}],"title":"Synthesis of memory efficient real time controllers for safety objectives","publisher":"Springer","date_created":"2018-12-11T12:02:49Z","conference":{"start_date":"2011-04-12","location":"Chicago, USA","end_date":"2011-04-14","name":"HSCC: Hybrid Systems - Computation and Control"},"oa_version":"Submitted Version","publist_id":"3273"},{"doi":"10.4204/EPTCS.54.6","date_updated":"2021-01-12T07:42:51Z","alternative_title":["EPTCS"],"date_published":"2011-06-04T00:00:00Z","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Fijalkow, Nathanaël","last_name":"Fijalkow","first_name":"Nathanaël"}],"scopus_import":1,"abstract":[{"lang":"eng","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."}],"publisher":"EPTCS","title":"A reduction from parity games to simple stochastic games","department":[{"_id":"KrCh"}],"publist_id":"3272","conference":{"location":"Minori, Italy","start_date":"2011-06-15","name":"GandALF: Games, Automata, Logic, and Formal Verification","end_date":"2011-06-17"},"date_created":"2018-12-11T12:02:49Z","oa_version":"Submitted Version","day":"04","status":"public","oa":1,"month":"06","language":[{"iso":"eng"}],"project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"citation":{"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.","short":"K. Chatterjee, N. Fijalkow, in:, EPTCS, 2011, pp. 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>.","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>","apa":"Chatterjee, K., &#38; Fijalkow, N. (2011). A reduction from parity games to simple stochastic games (Vol. 54, pp. 74–86). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. <a href=\"https://doi.org/10.4204/EPTCS.54.6\">https://doi.org/10.4204/EPTCS.54.6</a>","chicago":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “A Reduction from Parity Games to Simple Stochastic Games,” 54:74–86. EPTCS, 2011. <a href=\"https://doi.org/10.4204/EPTCS.54.6\">https://doi.org/10.4204/EPTCS.54.6</a>.","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."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"conference","volume":54,"page":"74 - 86","year":"2011","publication_status":"published","_id":"3349","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1106.1232"}],"intvolume":"        54"},{"publist_id":"3271","oa_version":"None","date_created":"2018-12-11T12:02:49Z","conference":{"end_date":"2011-09-23","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","start_date":"2011-09-21","location":"Aalborg, Denmark"},"publisher":"Springer","title":"Minimum attention controller synthesis for omega regular objectives","department":[{"_id":"KrCh"}],"quality_controlled":"1","abstract":[{"text":"A controller for a discrete game with ω-regular objectives requires attention if, intuitively, it requires measuring the state and switching from the current control action. Minimum attention controllers are preferable in modern shared implementations of cyber-physical systems because they produce the least burden on system resources such as processor time or communication bandwidth. We give algorithms to compute minimum attention controllers for ω-regular objectives in imperfect information discrete two-player games. We show a polynomial-time reduction from minimum attention controller synthesis to synthesis of controllers for mean-payoff parity objectives in games of incomplete information. This gives an optimal EXPTIME-complete synthesis algorithm. We show that the minimum attention controller problem is decidable for infinite state systems with finite bisimulation quotients. In particular, the problem is decidable for timed and rectangular automata.","lang":"eng"}],"scopus_import":1,"alternative_title":["LNCS"],"date_updated":"2021-01-12T07:42:51Z","doi":"10.1007/978-3-642-24310-3_11","editor":[{"full_name":"Fahrenberg, Uli","last_name":"Fahrenberg","first_name":"Uli"},{"last_name":"Tripakis","first_name":"Stavros","full_name":"Tripakis, Stavros"}],"author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Majumdar","first_name":"Ritankar","full_name":"Majumdar, Ritankar"}],"date_published":"2011-01-01T00:00:00Z","publication_status":"published","year":"2011","_id":"3350","intvolume":"      6919","type":"conference","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","page":"145 - 159","volume":6919,"project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"language":[{"iso":"eng"}],"month":"01","citation":{"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>.","ista":"Chatterjee K, Majumdar R. 2011. Minimum attention controller synthesis for omega regular objectives. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6919, 145–159.","short":"K. Chatterjee, R. Majumdar, in:, U. Fahrenberg, S. Tripakis (Eds.), Springer, 2011, pp. 145–159.","ieee":"K. Chatterjee and R. Majumdar, “Minimum attention controller synthesis for omega regular objectives,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark, 2011, vol. 6919, pp. 145–159.","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>.","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>"},"day":"01","status":"public"},{"scopus_import":1,"quality_controlled":"1","editor":[{"first_name":"Olaf","last_name":"Owe","full_name":"Owe, Olaf"},{"last_name":"Steffen","first_name":"Martin","full_name":"Steffen, Martin"},{"last_name":"Telle","first_name":"Jan Arne","full_name":"Telle, Jan Arne"}],"date_published":"2011-04-16T00:00:00Z","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"last_name":"Singh","first_name":"Rohit","full_name":"Singh, Rohit"}],"doi":"10.1007/978-3-642-22953-4_13","alternative_title":["LNCS"],"date_updated":"2021-01-12T07:42:52Z","conference":{"name":"FCT: Fundamentals of Computation Theory","end_date":"2011-08-25","location":"Oslo, Norway","start_date":"2011-08-22"},"project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"month":"04","day":"16","intvolume":"      6914","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.3211"}],"publication_status":"published","abstract":[{"text":"In two-player games on graph, the players construct an infinite path through the game graph and get a reward computed by a payoff function over infinite paths. Over weighted graphs, the typical and most studied payoff functions compute the limit-average or the discounted sum of the rewards along the path. Besides their simple definition, these two payoff functions enjoy the property that memoryless optimal strategies always exist. In an attempt to construct other simple payoff functions, we define a class of payoff functions which compute an (infinite) weighted average of the rewards. This new class contains both the limit-average and the discounted sum functions, and we show that they are the only members of this class which induce memoryless optimal strategies, showing that there is essentially no other simple payoff functions.","lang":"eng"}],"oa_version":"Submitted Version","date_created":"2018-12-11T12:02:50Z","publist_id":"3270","title":"On memoryless quantitative objectives","department":[{"_id":"KrCh"}],"publisher":"Springer","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>.","ista":"Chatterjee K, Doyen L, Singh R. 2011. On memoryless quantitative objectives. FCT: Fundamentals of Computation Theory, LNCS, vol. 6914, 148–159.","short":"K. Chatterjee, L. Doyen, R. Singh, in:, O. Owe, M. Steffen, J.A. Telle (Eds.), Springer, 2011, pp. 148–159.","ama":"Chatterjee K, Doyen L, Singh R. On memoryless quantitative objectives. In: Owe O, Steffen M, Telle JA, eds. Vol 6914. Springer; 2011:148-159. doi:<a href=\"https://doi.org/10.1007/978-3-642-22953-4_13\">10.1007/978-3-642-22953-4_13</a>","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>","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.","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>."},"status":"public","oa":1,"_id":"3351","year":"2011","page":"148 - 159","volume":6914,"type":"conference","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"},{"title":"Biology as reactivity","department":[{"_id":"ToHe"}],"publication":"Communications of the ACM","publisher":"ACM","oa_version":"None","date_created":"2018-12-11T12:02:50Z","ec_funded":1,"publist_id":"3267","author":[{"last_name":"Fisher","first_name":"Jasmin","full_name":"Fisher, Jasmin"},{"full_name":"Harel, David","last_name":"Harel","first_name":"David"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"}],"date_published":"2011-10-01T00:00:00Z","date_updated":"2021-01-12T07:42:52Z","doi":"10.1145/2001269.2001289","abstract":[{"text":"Exploring the connection of biology with reactive systems to better understand living systems.","lang":"eng"}],"quality_controlled":"1","page":"72 - 82","volume":54,"type":"journal_article","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","intvolume":"        54","_id":"3352","publication_status":"published","year":"2011","status":"public","day":"01","issue":"10","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>","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>.","ista":"Fisher J, Harel D, Henzinger TA. 2011. Biology as reactivity. Communications of the ACM. 54(10), 72–82.","short":"J. Fisher, D. Harel, T.A. Henzinger, Communications of the ACM 54 (2011) 72–82.","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>.","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>"},"project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"language":[{"iso":"eng"}],"month":"10"},{"publist_id":"3263","oa_version":"Submitted Version","ec_funded":1,"date_created":"2018-12-11T12:02:51Z","publisher":"ACM","department":[{"_id":"ToHe"}],"title":"A theory of synchronous relational interfaces","publication":"ACM Transactions on Programming Languages and Systems (TOPLAS)","abstract":[{"lang":"eng","text":"Compositional theories are crucial when designing large and complex systems from smaller components. In this work we propose such a theory for synchronous concurrent systems. Our approach follows so-called interface theories, which use game-theoretic interpretations of composition and refinement. These are appropriate for systems with distinct inputs and outputs, and explicit conditions on inputs that must be enforced during composition. Our interfaces model systems that execute in an infinite sequence of synchronous rounds. At each round, a contract must be satisfied. The contract is simply a relation specifying the set of valid input/output pairs. Interfaces can be composed by parallel, serial or feedback composition. A refinement relation between interfaces is defined, and shown to have two main properties: (1) it is preserved by composition, and (2) it is equivalent to substitutability, namely, the ability to replace an interface by another one in any context. Shared refinement and abstraction operators, corresponding to greatest lower and least upper bounds with respect to refinement, are also defined. Input-complete interfaces, that impose no restrictions on inputs, and deterministic interfaces, that produce a unique output for any legal input, are discussed as special cases, and an interesting duality between the two classes is exposed. A number of illustrative examples are provided, as well as algorithms to compute compositions, check refinement, and so on, for finite-state interfaces."}],"year":"2011","has_accepted_license":"1","_id":"3353","type":"journal_article","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","volume":33,"citation":{"ieee":"S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “A theory of synchronous relational interfaces,” <i>ACM Transactions on Programming Languages and Systems (TOPLAS)</i>, vol. 33, no. 4. ACM, 2011.","chicago":"Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory of Synchronous Relational Interfaces.” <i>ACM Transactions on Programming Languages and Systems (TOPLAS)</i>. ACM, 2011. <a href=\"https://doi.org/10.1145/1985342.1985345\">https://doi.org/10.1145/1985342.1985345</a>.","apa":"Tripakis, S., Lickly, B., Henzinger, T. A., &#38; Lee, E. (2011). A theory of synchronous relational interfaces. <i>ACM Transactions on Programming Languages and Systems (TOPLAS)</i>. ACM. <a href=\"https://doi.org/10.1145/1985342.1985345\">https://doi.org/10.1145/1985342.1985345</a>","ama":"Tripakis S, Lickly B, Henzinger TA, Lee E. A theory of synchronous relational interfaces. <i>ACM Transactions on Programming Languages and Systems (TOPLAS)</i>. 2011;33(4). doi:<a href=\"https://doi.org/10.1145/1985342.1985345\">10.1145/1985342.1985345</a>","short":"S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming Languages and Systems (TOPLAS) 33 (2011).","ista":"Tripakis S, Lickly B, Henzinger TA, Lee E. 2011. A theory of synchronous relational interfaces. ACM Transactions on Programming Languages and Systems (TOPLAS). 33(4), 14.","mla":"Tripakis, Stavros, et al. “A Theory of Synchronous Relational Interfaces.” <i>ACM Transactions on Programming Languages and Systems (TOPLAS)</i>, vol. 33, no. 4, 14, ACM, 2011, doi:<a href=\"https://doi.org/10.1145/1985342.1985345\">10.1145/1985342.1985345</a>."},"issue":"4","oa":1,"status":"public","article_number":"14","file_date_updated":"2020-07-14T12:46:09Z","quality_controlled":"1","scopus_import":1,"date_updated":"2021-01-12T07:42:52Z","doi":"10.1145/1985342.1985345","pubrep_id":"85","date_published":"2011-07-01T00:00:00Z","author":[{"first_name":"Stavros","last_name":"Tripakis","full_name":"Tripakis, Stavros"},{"full_name":"Lickly, Ben","first_name":"Ben","last_name":"Lickly"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"full_name":"Lee, Edward","first_name":"Edward","last_name":"Lee"}],"publication_status":"published","file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:16:45Z","relation":"main_file","access_level":"open_access","creator":"system","file_size":775662,"file_name":"IST-2012-85-v1+1_A_theory_of_synchronous_relational_interfaces.pdf","checksum":"5d44a8aa81e33210649beae507602138","file_id":"5235","date_updated":"2020-07-14T12:46:09Z"}],"intvolume":"        33","project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"name":"Design for Embedded Systems","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"language":[{"iso":"eng"}],"month":"07","day":"01","ddc":["000","005"]}]