[{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","grant_number":"214373"},{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"}],"oa_version":"Preprint","quality_controlled":"1","_id":"1731","publist_id":"5395","volume":245,"oa":1,"date_updated":"2023-02-23T11:45:42Z","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"first_name":"Hugo","last_name":"Gimbert","full_name":"Gimbert, Hugo"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"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 (both players interact simultaneously); and (b) turn-based (both 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. In this work 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","citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free.” <i>Information and Computation</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ic.2015.06.003\">https://doi.org/10.1016/j.ic.2015.06.003</a>.","ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” <i>Information and Computation</i>, vol. 245, no. 12. Elsevier, pp. 3–16, 2015.","apa":"Chatterjee, K., Doyen, L., Gimbert, H., &#38; Henzinger, T. A. (2015). Randomness for free. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2015.06.003\">https://doi.org/10.1016/j.ic.2015.06.003</a>","short":"K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, Information and Computation 245 (2015) 3–16.","ista":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2015. Randomness for free. Information and Computation. 245(12), 3–16.","mla":"Chatterjee, Krishnendu, et al. “Randomness for Free.” <i>Information and Computation</i>, vol. 245, no. 12, Elsevier, 2015, pp. 3–16, doi:<a href=\"https://doi.org/10.1016/j.ic.2015.06.003\">10.1016/j.ic.2015.06.003</a>.","ama":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. Randomness for free. <i>Information and Computation</i>. 2015;245(12):3-16. doi:<a href=\"https://doi.org/10.1016/j.ic.2015.06.003\">10.1016/j.ic.2015.06.003</a>"},"related_material":{"record":[{"status":"public","id":"3856","relation":"earlier_version"}]},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1006.0673"}],"title":"Randomness for free","ec_funded":1,"year":"2015","doi":"10.1016/j.ic.2015.06.003","page":"3 - 16","issue":"12","publication":"Information and Computation","status":"public","intvolume":"       245","type":"journal_article","day":"01","date_created":"2018-12-11T11:53:42Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"language":[{"iso":"eng"}],"publisher":"Elsevier","scopus_import":1,"date_published":"2015-12-01T00:00:00Z","month":"12"},{"doi":"10.1016/j.tcs.2011.08.002","year":"2012","ec_funded":1,"title":"Simulation distances","pubrep_id":"42","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"4393"},{"status":"public","id":"5389","relation":"earlier_version"}]},"citation":{"ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” <i>Theoretical Computer Science</i>, vol. 413, no. 1. Elsevier, pp. 21–35, 2012.","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2012). Simulation distances. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2011.08.002\">https://doi.org/10.1016/j.tcs.2011.08.002</a>","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances.” <i>Theoretical Computer Science</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.tcs.2011.08.002\">https://doi.org/10.1016/j.tcs.2011.08.002</a>.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Simulation distances. <i>Theoretical Computer Science</i>. 2012;413(1):21-35. doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.08.002\">10.1016/j.tcs.2011.08.002</a>","mla":"Cerny, Pavol, et al. “Simulation Distances.” <i>Theoretical Computer Science</i>, vol. 413, no. 1, Elsevier, 2012, pp. 21–35, doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.08.002\">10.1016/j.tcs.2011.08.002</a>.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 413 (2012) 21–35.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2012. Simulation distances. Theoretical Computer Science. 413(1), 21–35."},"publication_status":"published","abstract":[{"text":"Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of &quot;fit&quot; or &quot;desirability&quot;. We extend the simulation preorder to the quantitative setting by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the implementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes.","lang":"eng"}],"author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","full_name":"Cerny, Pavol","first_name":"Pavol"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"3408","date_updated":"2023-02-23T12:24:04Z","volume":413,"_id":"3249","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"214373","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"quality_controlled":"1","oa_version":"None","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was partially supported by the ERC Advanced Grant QUAREM, the FWF NFN Grant S11402-N23 (RiSE), the European Union project COMBEST and the European Network of Excellence Artist Design.","month":"01","date_published":"2012-01-06T00:00:00Z","scopus_import":1,"publisher":"Elsevier","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:02:15Z","day":"06","type":"journal_article","intvolume":"       413","status":"public","publication":"Theoretical Computer Science","issue":"1","page":"21 - 35"},{"file":[{"file_name":"IST-2016-86-v2+1_1011.0688_3_.pdf","file_size":588863,"date_created":"2018-12-12T10:16:42Z","checksum":"3480e1594bbef25ff7462fa93a8a814e","date_updated":"2020-07-14T12:46:07Z","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"5231","creator":"system"}],"date_created":"2018-12-11T12:02:37Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"scopus_import":1,"publisher":"International Federation of Computational Logic","date_published":"2011-12-14T00:00:00Z","month":"12","file_date_updated":"2020-07-14T12:46:07Z","publication":"Logical Methods in Computer Science","issue":"4","status":"public","intvolume":"         7","type":"journal_article","day":"14","ddc":["000","005"],"related_material":{"record":[{"relation":"earlier_version","id":"3876","status":"public"}]},"tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png"},"title":"Timed parity games: Complexity and robustness","pubrep_id":"506","ec_funded":1,"doi":"10.2168/LMCS-7(4:8)2011","year":"2011","project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"}],"oa_version":"Published Version","quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3315","date_updated":"2023-02-23T11:46:35Z","volume":7,"oa":1,"publist_id":"3324","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Vinayak","full_name":"Prabhu, Vinayak","last_name":"Prabhu"}],"abstract":[{"lang":"eng","text":"We consider two-player games played in real time on game structures with clocks where the objectives of players are described using parity conditions. The games are concurrent in that at each turn, both players independently propose a time delay and an action, and the action with the shorter delay is chosen. To prevent a player from winning by blocking time, we restrict each player to play strategies that ensure that the player cannot be responsible for causing a zeno run. First, we present an efficient reduction of these games to turn-based (i.e., not concurrent) finite-state (i.e., untimed) parity games. Our reduction improves the best known complexity for solving timed parity games. Moreover, the rich class of algorithms for classical parity games can now be applied to timed parity games. The states of the resulting game are based on clock regions of the original game, and the state space of the finite game is linear in the size of the region graph. Second, we consider two restricted classes of strategies for the player that represents the controller in a real-time synthesis problem, namely, limit-robust and bounded-robust winning strategies. Using a limit-robust winning strategy, the controller cannot choose an exact real-valued time delay but must allow for some nonzero jitter in each of its actions. If there is a given lower bound on the jitter, then the strategy is bounded-robust winning. We show that exact strategies are more powerful than limit-robust strategies, which are more powerful than bounded-robust winning strategies for any bound. For both kinds of robust strategies, we present efficient reductions to standard timed automaton games. These reductions provide algorithms for the synthesis of robust real-time controllers."}],"citation":{"ama":"Chatterjee K, Henzinger TA, Prabhu V. Timed parity games: Complexity and robustness. <i>Logical Methods in Computer Science</i>. 2011;7(4). doi:<a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">10.2168/LMCS-7(4:8)2011</a>","mla":"Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.” <i>Logical Methods in Computer Science</i>, vol. 7, no. 4, International Federation of Computational Logic, 2011, doi:<a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">10.2168/LMCS-7(4:8)2011</a>.","ista":"Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 7(4).","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science 7 (2011).","ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity and robustness,” <i>Logical Methods in Computer Science</i>, vol. 7, no. 4. International Federation of Computational Logic, 2011.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Prabhu, V. (2011). Timed parity games: Complexity and robustness. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">https://doi.org/10.2168/LMCS-7(4:8)2011</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2011. <a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">https://doi.org/10.2168/LMCS-7(4:8)2011</a>."},"publication_status":"published"},{"author":[{"first_name":"Udi","last_name":"Boker","full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"}],"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"}],"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>.","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>","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.","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>","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>."},"publication_status":"published","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","grant_number":"215543"},{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","grant_number":"214373"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["2664-1690"]},"_id":"5385","oa":1,"date_updated":"2023-02-23T11:23:41Z","title":"Temporal specifications with accumulative values","pubrep_id":"21","ec_funded":1,"doi":"10.15479/AT:IST-2011-0003","year":"2011","ddc":["000","004"],"related_material":{"record":[{"status":"public","relation":"later_version","id":"2038"},{"id":"3356","relation":"later_version","status":"public"}]},"alternative_title":["IST Austria Technical Report"],"status":"public","type":"technical_report","day":"04","file_date_updated":"2020-07-14T12:46:41Z","page":"14","language":[{"iso":"eng"}],"publisher":"IST Austria","date_published":"2011-04-04T00:00:00Z","month":"04","file":[{"content_type":"application/pdf","relation":"main_file","file_id":"5461","creator":"system","date_updated":"2020-07-14T12:46:41Z","access_level":"open_access","file_name":"IST-2011-0003_IST-2011-0003.pdf","file_size":366281,"date_created":"2018-12-12T11:53:00Z","checksum":"8491d0d48c4911620ecd5350b413c11e"}],"date_created":"2018-12-12T11:39:02Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"has_accepted_license":"1"},{"ddc":["000","005"],"article_number":"14","pubrep_id":"85","title":"A theory of synchronous relational interfaces","doi":"10.1145/1985342.1985345","year":"2011","ec_funded":1,"_id":"3353","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","grant_number":"214373"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms"}],"quality_controlled":"1","date_updated":"2021-01-12T07:42:52Z","volume":33,"publist_id":"3263","oa":1,"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."}],"author":[{"first_name":"Stavros","last_name":"Tripakis","full_name":"Tripakis, Stavros"},{"first_name":"Ben","last_name":"Lickly","full_name":"Lickly, Ben"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"last_name":"Lee","full_name":"Lee, Edward","first_name":"Edward"}],"publication_status":"published","citation":{"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>.","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.","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>","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.","short":"S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming Languages and Systems (TOPLAS) 33 (2011).","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>.","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>"},"file":[{"access_level":"open_access","date_updated":"2020-07-14T12:46:09Z","file_size":775662,"file_name":"IST-2012-85-v1+1_A_theory_of_synchronous_relational_interfaces.pdf","checksum":"5d44a8aa81e33210649beae507602138","date_created":"2018-12-12T10:16:45Z","relation":"main_file","content_type":"application/pdf","file_id":"5235","creator":"system"}],"date_created":"2018-12-11T12:02:51Z","has_accepted_license":"1","department":[{"_id":"ToHe"}],"publisher":"ACM","scopus_import":1,"language":[{"iso":"eng"}],"month":"07","date_published":"2011-07-01T00:00:00Z","issue":"4","publication":"ACM Transactions on Programming Languages and Systems (TOPLAS)","file_date_updated":"2020-07-14T12:46:09Z","intvolume":"        33","status":"public","day":"01","type":"journal_article"},{"file_date_updated":"2020-07-14T12:46:09Z","day":"21","type":"conference","status":"public","has_accepted_license":"1","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"conference":{"start_date":"2011-06-21","name":"LICS: Logic in Computer Science","location":"Toronto, Canada","end_date":"2011-06-24"},"file":[{"date_updated":"2020-07-14T12:46:09Z","access_level":"open_access","file_name":"IST-2012-83-v1+1_Temporal_specifications_with_accumulative_values.pdf","file_size":225426,"date_created":"2018-12-12T10:12:42Z","checksum":"792128f5455f0f40f1105f0398e05fa9","content_type":"application/pdf","relation":"main_file","file_id":"4960","creator":"system"}],"date_created":"2018-12-11T12:02:52Z","month":"06","date_published":"2011-06-21T00:00:00Z","publisher":"IEEE","scopus_import":1,"language":[{"iso":"eng"}],"oa":1,"publist_id":"3259","date_updated":"2023-02-23T12:23:54Z","_id":"3356","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","project":[{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"grant_number":"215543","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"grant_number":"214373","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"publication_status":"published","citation":{"chicago":"Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” IEEE, 2011. <a href=\"https://doi.org/10.1109/LICS.2011.33\">https://doi.org/10.1109/LICS.2011.33</a>.","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. <a href=\"https://doi.org/10.1109/LICS.2011.33\">https://doi.org/10.1109/LICS.2011.33</a>","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications with accumulative values. In: IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/LICS.2011.33\">10.1109/LICS.2011.33</a>","mla":"Boker, Udi, et al. <i>Temporal Specifications with Accumulative Values</i>. 5970226, IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/LICS.2011.33\">10.1109/LICS.2011.33</a>."},"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"}],"author":[{"first_name":"Udi","full_name":"Boker, Udi","last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Orna","full_name":"Kupferman, Orna","last_name":"Kupferman"}],"article_number":"5970226","related_material":{"record":[{"status":"public","relation":"later_version","id":"2038"},{"status":"public","relation":"earlier_version","id":"5385"}]},"ddc":["000","004"],"doi":"10.1109/LICS.2011.33","year":"2011","ec_funded":1,"pubrep_id":"83","title":"Temporal specifications with accumulative values"},{"title":"Determinizing discounted-sum automata","pubrep_id":"82","year":"2011","doi":"10.4230/LIPIcs.CSL.2011.82","ec_funded":1,"ddc":["004"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"alternative_title":["LIPIcs"],"abstract":[{"text":"A discounted-sum automaton (NDA) is a nondeterministic finite automaton with edge weights, which values a run by the discounted sum of visited edge weights. More precisely, the weight in the i-th position of the run is divided by lambda^i, where the discount factor lambda is a fixed rational number greater than 1. Discounted summation is a common and useful measuring scheme, especially for infinite sequences, which reflects the assumption that earlier weights are more important than later weights. Determinizing automata is often essential, for example, in formal verification, where there are polynomial algorithms for comparing two deterministic NDAs, while the equivalence problem for NDAs is not known to be decidable. Unfortunately, however, discounted-sum automata are, in general, not determinizable: it is currently known that for every rational discount factor 1 &lt; lambda &lt; 2, there is an NDA with lambda (denoted lambda-NDA) that cannot be determinized. We provide positive news, showing that every NDA with an integral factor is determinizable. We also complete the picture by proving that the integers characterize exactly the discount factors that guarantee determinizability: we show that for every non-integral rational factor lambda, there is a nondeterminizable lambda-NDA. Finally, we prove that the class of NDAs with integral discount factors enjoys closure under the algebraic operations min, max, addition, and subtraction, which is not the case for general NDAs nor for deterministic NDAs. This shows that for integral discount factors, the class of NDAs forms an attractive specification formalism in quantitative formal verification. All our results hold equally for automata over finite words and for automata over infinite words. ","lang":"eng"}],"author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi","full_name":"Boker, Udi","last_name":"Boker"},{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"citation":{"ama":"Boker U, Henzinger TA. Determinizing discounted-sum automata. In: Vol 12. Springer; 2011:82-96. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2011.82\">10.4230/LIPIcs.CSL.2011.82</a>","mla":"Boker, Udi, and Thomas A. Henzinger. <i>Determinizing Discounted-Sum Automata</i>. Vol. 12, Springer, 2011, pp. 82–96, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2011.82\">10.4230/LIPIcs.CSL.2011.82</a>.","ista":"Boker U, Henzinger TA. 2011. Determinizing discounted-sum automata. CSL: Computer Science Logic, LIPIcs, vol. 12, 82–96.","short":"U. Boker, T.A. Henzinger, in:, Springer, 2011, pp. 82–96.","ieee":"U. Boker and T. A. Henzinger, “Determinizing discounted-sum automata,” presented at the CSL: Computer Science Logic, Bergen, Norway, 2011, vol. 12, pp. 82–96.","apa":"Boker, U., &#38; Henzinger, T. A. (2011). Determinizing discounted-sum automata (Vol. 12, pp. 82–96). Presented at the CSL: Computer Science Logic, Bergen, Norway: Springer. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2011.82\">https://doi.org/10.4230/LIPIcs.CSL.2011.82</a>","chicago":"Boker, Udi, and Thomas A Henzinger. “Determinizing Discounted-Sum Automata,” 12:82–96. Springer, 2011. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2011.82\">https://doi.org/10.4230/LIPIcs.CSL.2011.82</a>."},"publication_status":"published","_id":"3360","quality_controlled":"1","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"call_identifier":"FP7","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:42:56Z","oa":1,"volume":12,"publist_id":"3255","scopus_import":1,"publisher":"Springer","language":[{"iso":"eng"}],"month":"08","date_published":"2011-08-31T00:00:00Z","conference":{"start_date":"2011-09-12","name":"CSL: Computer Science Logic","end_date":"2011-09-15","location":"Bergen, Norway"},"file":[{"file_size":504270,"file_name":"IST-2012-82-v1+1_Determinizing_discounted-sum_automata.pdf","checksum":"250603c6be8ccad4fbd4d7b24221f0ee","date_created":"2018-12-12T10:10:17Z","access_level":"open_access","date_updated":"2020-07-14T12:46:10Z","relation":"main_file","content_type":"application/pdf","creator":"system","file_id":"4803"}],"date_created":"2018-12-11T12:02:53Z","has_accepted_license":"1","department":[{"_id":"ToHe"}],"intvolume":"        12","status":"public","day":"31","type":"conference","page":"82 - 96","file_date_updated":"2020-07-14T12:46:10Z"},{"ec_funded":1,"date_published":"2011-04-01T00:00:00Z","year":"2011","month":"04","language":[{"iso":"eng"}],"external_id":{"arxiv":["1104.0127"]},"title":"The decidability frontier for probabilistic automata on infinite words","publisher":"ArXiv","main_file_link":[{"url":"https://arxiv.org/abs/1104.0127","open_access":"1"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:02:54Z","type":"preprint","citation":{"ista":"Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.","short":"K. Chatterjee, T.A. Henzinger, M. Tracol, (n.d.).","mla":"Chatterjee, Krishnendu, et al. <i>The Decidability Frontier for Probabilistic Automata on Infinite Words</i>. ArXiv.","ama":"Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv.","ieee":"K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv."},"day":"01","publication_status":"submitted","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mathieu","full_name":"Tracol, Mathieu","last_name":"Tracol","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87"}],"status":"public","abstract":[{"lang":"eng","text":"We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi, and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present a complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words."}],"page":"19","publist_id":"3251","oa":1,"date_updated":"2020-01-21T13:20:24Z","arxiv":1,"project":[{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","grant_number":"214373"}],"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3363"},{"citation":{"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>.","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.","ista":"Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.","short":"K. Chatterjee, L. Doyen, H. Edelsbrunner, T.A. Henzinger, P. Rannou, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–283.","mla":"Chatterjee, Krishnendu, et al. <i>Mean-Payoff Automaton Expressions</i>. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–83, doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">10.1007/978-3-642-15375-4_19</a>.","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>"},"publication_status":"published","abstract":[{"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.","lang":"eng"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Philippe","full_name":"Rannou, Philippe","last_name":"Rannou"}],"volume":6269,"date_updated":"2021-01-12T07:52:40Z","publist_id":"2328","oa":1,"_id":"3853","oa_version":"Submitted Version","project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","call_identifier":"FP7","grant_number":"214373"}],"quality_controlled":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/978-3-642-15375-4_19","year":"2010","ec_funded":1,"title":"Mean-payoff automaton expressions","pubrep_id":"62","alternative_title":["LNCS"],"ddc":["000","005"],"day":"18","type":"conference","intvolume":"      6269","status":"public","file_date_updated":"2020-07-14T12:46:17Z","page":"269 - 283","month":"11","date_published":"2010-11-18T00:00:00Z","scopus_import":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"KrCh"},{"_id":"HeEd"},{"_id":"ToHe"}],"conference":{"start_date":"2010-08-31","name":"CONCUR: Concurrency Theory","end_date":"2010-09-03","location":"Paris, France"},"date_created":"2018-12-11T12:05:31Z","file":[{"checksum":"4f753ae99d076553fb8733e2c8b390e2","date_created":"2018-12-12T10:15:41Z","file_size":233260,"file_name":"IST-2012-62-v1+1_Mean-payoff_automaton_expressions.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:17Z","creator":"system","file_id":"5163","relation":"main_file","content_type":"application/pdf"}]},{"page":"258 - 269","file_date_updated":"2020-07-14T12:46:17Z","day":"01","type":"conference","intvolume":"      6281","status":"public","has_accepted_license":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"conference":{"location":"Brno, Czech Republic","end_date":"2010-08-27","name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2010-08-23"},"file":[{"content_type":"application/pdf","relation":"main_file","creator":"system","file_id":"5038","file_name":"IST-2012-61-v1+1_Qualitative_analysis_of_partially-observable_Markov_Decision_Processes.pdf","file_size":173948,"date_created":"2018-12-12T10:13:51Z","checksum":"b6c82ec82f194e5b0ab7c1c3800e4580","date_updated":"2020-07-14T12:46:17Z","access_level":"open_access"}],"date_created":"2018-12-11T12:05:32Z","month":"08","date_published":"2010-08-01T00:00:00Z","scopus_import":1,"publisher":"Springer","language":[{"iso":"eng"}],"date_updated":"2023-02-23T12:24:22Z","publist_id":"2326","volume":6281,"oa":1,"_id":"3855","oa_version":"Submitted Version","project":[{"grant_number":"215543","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"214373"}],"quality_controlled":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"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>","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.","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.","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>."},"publication_status":"published","abstract":[{"text":"We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observation-based strategy relies on partial information about the history of a play, namely, on the past sequence of observations. We consider qualitative analysis problems: given a POMDP with a parity objective, decide whether there exists an observation-based strategy to achieve the objective with probability 1 (almost-sure winning), or with positive probability (positive winning). Our main results are twofold. First, we present a complete picture of the computational complexity of the qualitative analysis problem for POMDPs with parity objectives and its subclasses: safety, reachability, Büchi, and coBüchi objectives. We establish several upper and lower bounds that were not known in the literature. Second, we give optimal bounds (matching upper and lower bounds) for the memory required by pure and randomized observation-based strategies for each class of objectives.","lang":"eng"}],"author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"alternative_title":["LNCS"],"related_material":{"record":[{"id":"5395","relation":"earlier_version","status":"public"}]},"ddc":["004"],"doi":"10.1007/978-3-642-15155-2_24","year":"2010","ec_funded":1,"title":"Qualitative analysis of partially-observable Markov Decision Processes","pubrep_id":"61"},{"page":"246 - 257","day":"06","type":"conference","intvolume":"      6281","status":"public","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"conference":{"start_date":"2010-08-23","location":"Brno, Czech Republic","end_date":"2010-08-27","name":"MFCS: Mathematical Foundations of Computer Science"},"date_created":"2018-12-11T12:05:32Z","month":"09","date_published":"2010-09-06T00:00:00Z","scopus_import":1,"publisher":"Springer","language":[{"iso":"eng"}],"volume":6281,"publist_id":"2325","date_updated":"2023-02-23T10:12:00Z","oa":1,"_id":"3856","project":[{"grant_number":"215543","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373"}],"oa_version":"Preprint","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","citation":{"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.","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>","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>","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."},"publication_status":"published","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. "}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"full_name":"Gimbert, Hugo","last_name":"Gimbert","first_name":"Hugo"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"}],"alternative_title":["LNCS"],"main_file_link":[{"url":"https://arxiv.org/abs/1006.0673v1","open_access":"1"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"1731"}]},"doi":"10.1007/978-3-642-15155-2_23","year":"2010","ec_funded":1,"title":"Randomness for free","pubrep_id":"60"},{"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"}],"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","citation":{"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.","short":"K. Chatterjee, T.A. Henzinger, in:, Springer, 2010, pp. 1–16.","ama":"Chatterjee K, Henzinger TA. Probabilistic Automata on infinite words: decidability and undecidability results. In: Vol 6252. Springer; 2010:1-16. doi:<a href=\"https://doi.org/10.1007/978-3-642-15643-4_1\">10.1007/978-3-642-15643-4_1</a>","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>.","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.","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>"},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7"},{"grant_number":"214373","call_identifier":"FP7","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"oa_version":"None","quality_controlled":"1","_id":"3857","volume":6252,"date_updated":"2023-02-23T12:24:14Z","publist_id":"2324","pubrep_id":"28","title":"Probabilistic Automata on infinite words: decidability and undecidability results","ec_funded":1,"year":"2010","doi":"10.1007/978-3-642-15643-4_1","related_material":{"record":[{"id":"5392","relation":"earlier_version","status":"public"}]},"alternative_title":["LNCS"],"status":"public","intvolume":"      6252","type":"conference","day":"12","page":"1 - 16","language":[{"iso":"eng"}],"publisher":"Springer","scopus_import":1,"date_published":"2010-10-12T00:00:00Z","month":"10","date_created":"2018-12-11T12:05:33Z","conference":{"name":"ATVA: Automated Technology for Verification and Analysis","location":"Singapore, Singapore","end_date":"2010-09-24","start_date":"2010-09-21"},"department":[{"_id":"KrCh"},{"_id":"ToHe"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"}],"_id":"3862","extern":"1","date_updated":"2022-03-21T08:20:03Z","publist_id":"2318","oa":1,"volume":11,"article_processing_charge":"No","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"lang":"eng","text":"Quantitative generalizations of classical languages, which assign to each word a real number instead of a Boolean value, have applications in modeling resource-constrained computation. We use weighted automata (finite automata with transition weights) to define several natural classes of quantitative languages over finite and infinite words; in particular, the real value of an infinite run is computed as the maximum, limsup, liminf, limit average, or discounted sum of the transition weights. We define the classical decision problems of automata theory (emptiness, universality, language inclusion, and language equivalence) in the quantitative setting and study their computational complexity. As the decidability of the language-inclusion problem remains open for some classes of weighted automata, we introduce a notion of quantitative simulation that is decidable and implies language inclusion. We also give a complete characterization of the expressive power of the various classes of weighted automata. In particular, we show that most classes of weighted automata cannot be determinized."}],"publication_status":"published","citation":{"short":"K. Chatterjee, L. Doyen, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 11 (2010).","ista":"Chatterjee K, Doyen L, Henzinger TA. 2010. Quantitative languages. ACM Transactions on Computational Logic (TOCL). 11(4), 23.","mla":"Chatterjee, Krishnendu, et al. “Quantitative Languages.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 11, no. 4, 23, ACM, 2010, doi:<a href=\"https://doi.org/10.1145/1805950.1805953\">10.1145/1805950.1805953</a>.","ama":"Chatterjee K, Doyen L, Henzinger TA. Quantitative languages. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2010;11(4). doi:<a href=\"https://doi.org/10.1145/1805950.1805953\">10.1145/1805950.1805953</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Quantitative Languages.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2010. <a href=\"https://doi.org/10.1145/1805950.1805953\">https://doi.org/10.1145/1805950.1805953</a>.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Quantitative languages,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 11, no. 4. ACM, 2010.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2010). Quantitative languages. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/1805950.1805953\">https://doi.org/10.1145/1805950.1805953</a>"},"ddc":["004"],"article_number":"23","pubrep_id":"57","title":"Quantitative languages","ec_funded":1,"year":"2010","doi":"10.1145/1805950.1805953","file_date_updated":"2020-07-14T12:46:18Z","issue":"4","publication":"ACM Transactions on Computational Logic (TOCL)","status":"public","intvolume":"        11","type":"journal_article","day":"01","file":[{"date_created":"2018-12-12T10:16:41Z","checksum":"f2e50bbd6871fba0aec30bd9625a1ee7","file_name":"IST-2012-57-v1+1_Quantitative_languages.pdf","file_size":169136,"date_updated":"2020-07-14T12:46:18Z","access_level":"open_access","creator":"system","file_id":"5230","content_type":"application/pdf","relation":"main_file"}],"date_created":"2018-12-11T12:05:34Z","has_accepted_license":"1","language":[{"iso":"eng"}],"publisher":"ACM","scopus_import":"1","date_published":"2010-07-01T00:00:00Z","month":"07"},{"date_published":"2010-10-01T00:00:00Z","month":"10","language":[{"iso":"eng"}],"publisher":"Elsevier","scopus_import":1,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"has_accepted_license":"1","date_created":"2018-12-11T12:05:35Z","file":[{"date_updated":"2020-07-14T12:46:18Z","access_level":"open_access","file_name":"IST-2012-58-v1+1_Strategy_construction_for_parity_games_with_imperfect_information.pdf","file_size":287496,"date_created":"2018-12-12T10:17:44Z","checksum":"29d146e4f8049dbb7f80bbf7ea3700ed","content_type":"application/pdf","relation":"main_file","file_id":"5300","creator":"system"}],"type":"journal_article","day":"01","status":"public","intvolume":"       208","file_date_updated":"2020-07-14T12:46:18Z","page":"1206 - 1220","issue":"10","publication":"Information and Computation","ec_funded":1,"doi":"10.1016/j.ic.2009.09.006","year":"2010","pubrep_id":"58","title":"Strategy construction for parity games with imperfect information","ddc":["005"],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"3880"}]},"publication_status":"published","citation":{"short":"D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, Information and Computation 208 (2010) 1206–1220.","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.","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>.","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>","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>.","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.","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>"},"author":[{"first_name":"Dietmar","last_name":"Berwanger","full_name":"Berwanger, Dietmar"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","last_name":"De Wulf","full_name":"De Wulf, Martin"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"}],"abstract":[{"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.","lang":"eng"}],"volume":208,"date_updated":"2023-02-23T11:46:47Z","oa":1,"publist_id":"2319","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","project":[{"grant_number":"215543","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version","_id":"3863"},{"pubrep_id":"54","title":"Robustness in the presence of liveness","ec_funded":1,"year":"2010","doi":"10.1007/978-3-642-14295-6_36","ddc":["004"],"alternative_title":["LNCS"],"author":[{"full_name":"Bloem, Roderick","last_name":"Bloem","first_name":"Roderick"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Karin","last_name":"Greimel","full_name":"Greimel, Karin"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"}],"abstract":[{"lang":"eng","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."}],"publication_status":"published","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>.","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.","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>","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.","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.","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>","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>."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","project":[{"name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543"},{"grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems"}],"quality_controlled":"1","_id":"3866","volume":6174,"publist_id":"2310","oa":1,"date_updated":"2021-01-12T07:52:47Z","editor":[{"last_name":"Touili","full_name":"Touili, Tayssir","first_name":"Tayssir"},{"full_name":"Cook, Byron","last_name":"Cook","first_name":"Byron"},{"full_name":"Jackson, Paul","last_name":"Jackson","first_name":"Paul"}],"language":[{"iso":"eng"}],"publisher":"Springer","scopus_import":1,"date_published":"2010-07-01T00:00:00Z","month":"07","date_created":"2018-12-11T12:05:36Z","file":[{"content_type":"application/pdf","relation":"main_file","creator":"system","file_id":"5243","file_name":"IST-2012-54-v1+1_Robustness_in_the_presence_of_liveness.pdf","file_size":213083,"date_created":"2018-12-12T10:16:52Z","checksum":"9d204611c8d7855bed8134f8708a0010","date_updated":"2020-07-14T12:46:19Z","access_level":"open_access"}],"conference":{"start_date":"2010-07-15","name":"CAV: Computer Aided Verification","end_date":"2010-07-19","location":"Edinburgh, UK"},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"has_accepted_license":"1","status":"public","intvolume":"      6174","type":"conference","day":"01","page":"410 - 424","file_date_updated":"2020-07-14T12:46:19Z"},{"citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2010. <a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">https://doi.org/10.2168/LMCS-6(3:10)2010</a>.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure properties for quantitative languages,” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3. International Federation of Computational Logic, pp. 1–23, 2010.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2010). Expressiveness and closure properties for quantitative languages. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">https://doi.org/10.2168/LMCS-6(3:10)2010</a>","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, Logical Methods in Computer Science 6 (2010) 1–23.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2010. Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. 6(3), 1–23.","mla":"Chatterjee, Krishnendu, et al. “Expressiveness and Closure Properties for Quantitative Languages.” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3, International Federation of Computational Logic, 2010, pp. 1–23, doi:<a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">10.2168/LMCS-6(3:10)2010</a>.","ama":"Chatterjee K, Doyen L, Henzinger TA. Expressiveness and closure properties for quantitative languages. <i>Logical Methods in Computer Science</i>. 2010;6(3):1-23. doi:<a href=\"https://doi.org/10.2168/LMCS-6(3:10)2010\">10.2168/LMCS-6(3:10)2010</a>"},"publication_status":"published","abstract":[{"lang":"eng","text":"Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit-average, or discounted-sum of the transition weights. The value of a word w is the supremum of the values of the runs over w. We study expressiveness and closure questions about these quantitative languages. We first show that the set of words with value greater than a threshold can be omega-regular for deterministic limit-average and discounted-sum automata, while this set is always omega-regular when the threshold is isolated (i.e., some neighborhood around the threshold contains no word). In the latter case, we prove that the omega-regular language is robust against small perturbations of the transition weights. We next consider automata with transition weights 0 or 1 and show that they are as expressive as general weighted automata in the limit-average case, but not in the discounted-sum case. Third, for quantitative languages L-1 and L-2, we consider the operations max(L-1, L-2), min(L-1, L-2), and 1 - L-1, which generalize the boolean operations on languages, as well as the sum L-1 + L-2. We establish the closure properties of all classes of quantitative languages with respect to these four operations."}],"author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-02-23T12:15:42Z","oa":1,"volume":6,"publist_id":"2311","_id":"3867","oa_version":"Published Version","quality_controlled":"1","project":[{"name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"214373"},{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","grant_number":"215543"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","year":"2010","doi":"10.2168/LMCS-6(3:10)2010","ec_funded":1,"title":"Expressiveness and closure properties for quantitative languages","pubrep_id":"504","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png"},"related_material":{"record":[{"id":"4540","relation":"earlier_version","status":"public"}]},"ddc":["000","004"],"day":"30","type":"journal_article","intvolume":"         6","status":"public","publication":"Logical Methods in Computer Science","issue":"3","page":"1 - 23","file_date_updated":"2020-07-14T12:46:19Z","month":"08","date_published":"2010-08-30T00:00:00Z","scopus_import":1,"publisher":"International Federation of Computational Logic","language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:36Z","file":[{"file_id":"5312","creator":"system","content_type":"application/pdf","relation":"main_file","date_created":"2018-12-12T10:17:54Z","checksum":"0243da726476817f2ea33b48b78be696","file_name":"IST-2012-55-v1+1_Expressiveness_Closure_Properties_Quantitative_Languages.pdf","file_size":216598,"date_updated":"2020-07-14T12:46:19Z","access_level":"open_access"},{"access_level":"open_access","date_updated":"2020-07-14T12:46:19Z","file_size":302416,"file_name":"IST-2016-55-v2+1_1007.4018.pdf","checksum":"5e512b8503a9cb263de26331c4ee9cf2","date_created":"2018-12-12T10:17:55Z","relation":"main_file","content_type":"application/pdf","creator":"system","file_id":"5313"}]},{"ddc":["004"],"alternative_title":["LNCS"],"title":"From MTL to deterministic timed automata","pubrep_id":"49","year":"2010","doi":"10.1007/978-3-642-15297-9_13","ec_funded":1,"_id":"4369","project":[{"grant_number":"215543","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","call_identifier":"FP7","grant_number":"214373"}],"oa_version":"Submitted Version","quality_controlled":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","editor":[{"first_name":"Thomas A.","full_name":"Henzinger, Thomas A.","last_name":"Henzinger"},{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"}],"volume":6246,"publist_id":"1090","oa":1,"date_updated":"2021-01-12T07:56:27Z","abstract":[{"text":"In this paper we propose a novel technique for constructing timed automata from properties expressed in the logic mtl, under bounded-variability assumptions. We handle full mtl and include all future operators. Our construction is based on separation of the continuous time monitoring of the input sequence and discrete predictions regarding the future. The separation of the continuous from the discrete allows us to determinize our automata in an exponential construction that does not increase the number of clocks. This leads to a doubly exponential construction from mtl to deterministic timed automata, compared with triply exponential using existing approaches. We offer an alternative to the existing approach to linear real-time model checking, which has never been implemented. It further offers a unified framework for model checking, runtime monitoring, and synthesis, in an approach that can reuse tools, implementations, and insights from the discrete setting.","lang":"eng"}],"author":[{"first_name":"Dejan","full_name":"Nickovic, Dejan","last_name":"Nickovic","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Piterman","full_name":"Piterman, Nir","first_name":"Nir"}],"citation":{"chicago":"Nickovic, Dejan, and Nir Piterman. “From MTL to Deterministic Timed Automata.” edited by Thomas A. Henzinger and Krishnendu Chatterjee, 6246:152–67. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">https://doi.org/10.1007/978-3-642-15297-9_13</a>.","apa":"Nickovic, D., &#38; Piterman, N. (2010). From MTL to deterministic timed automata. In T. A. Henzinger &#38; K. Chatterjee (Eds.) (Vol. 6246, pp. 152–167). 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_13\">https://doi.org/10.1007/978-3-642-15297-9_13</a>","ieee":"D. Nickovic and N. Piterman, “From MTL to deterministic timed automata,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria, 2010, vol. 6246, pp. 152–167.","short":"D. Nickovic, N. Piterman, in:, T.A. Henzinger, K. Chatterjee (Eds.), Springer, 2010, pp. 152–167.","ista":"Nickovic D, Piterman N. 2010. From MTL to deterministic timed automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6246, 152–167.","mla":"Nickovic, Dejan, and Nir Piterman. <i>From MTL to Deterministic Timed Automata</i>. Edited by Thomas A. Henzinger and Krishnendu Chatterjee, vol. 6246, Springer, 2010, pp. 152–67, doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">10.1007/978-3-642-15297-9_13</a>.","ama":"Nickovic D, Piterman N. From MTL to deterministic timed automata. In: Henzinger TA, Chatterjee K, eds. Vol 6246. Springer; 2010:152-167. doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">10.1007/978-3-642-15297-9_13</a>"},"publication_status":"published","conference":{"start_date":"2010-09-08","location":"Klosterneuburg, Austria","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","end_date":"2010-09-10"},"date_created":"2018-12-11T12:08:30Z","file":[{"checksum":"b0ca5f5fbe8a3d20ccbc6f51a344a459","date_created":"2018-12-12T10:13:43Z","file_size":249789,"file_name":"IST-2012-49-v1+1_From_MTL_to_deterministic_timed_automata.pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:27Z","file_id":"5028","creator":"system","relation":"main_file","content_type":"application/pdf"}],"has_accepted_license":"1","department":[{"_id":"ToHe"}],"scopus_import":1,"publisher":"Springer","language":[{"iso":"eng"}],"month":"09","date_published":"2010-09-08T00:00:00Z","file_date_updated":"2020-07-14T12:46:27Z","page":"152 - 167","intvolume":"      6246","status":"public","day":"08","type":"conference"},{"alternative_title":["LNCS"],"related_material":{"record":[{"relation":"earlier_version","id":"5393","status":"public"}]},"ddc":["004"],"doi":"10.1007/978-3-642-14295-6_57","year":"2010","ec_funded":1,"pubrep_id":"43","external_id":{"arxiv":["1004.2367"]},"title":"GIST: A solver for probabilistic games","arxiv":1,"date_updated":"2023-02-23T12:24:17Z","oa":1,"volume":6174,"publist_id":"1068","article_processing_charge":"No","_id":"4388","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"},{"grant_number":"214373","call_identifier":"FP7","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa_version":"Submitted Version","publication_status":"published","citation":{"ista":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2010. GIST: A solver for probabilistic games. CAV: Computer Aided Verification, LNCS, vol. 6174, 665–669.","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, in:, Springer, 2010, pp. 665–669.","mla":"Chatterjee, Krishnendu, et al. <i>GIST: A Solver for Probabilistic Games</i>. Vol. 6174, Springer, 2010, pp. 665–69, doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">10.1007/978-3-642-14295-6_57</a>.","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. GIST: A solver for probabilistic games. In: Vol 6174. Springer; 2010:665-669. doi:<a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">10.1007/978-3-642-14295-6_57</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. “GIST: A Solver for Probabilistic Games,” 6174:665–69. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">https://doi.org/10.1007/978-3-642-14295-6_57</a>.","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Radhakrishna, A. (2010). GIST: A solver for probabilistic games (Vol. 6174, pp. 665–669). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14295-6_57\">https://doi.org/10.1007/978-3-642-14295-6_57</a>","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, “GIST: A solver for probabilistic games,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 665–669."},"abstract":[{"text":"GIST is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with ω-regular objectives; and (b) synthesizes reasonable environment assumptions for synthesis of unrealizable specifications. Our tool provides the first and efficient implementations of several reduction-based techniques to solve turn-based probabilistic games, and uses the analysis of turn-based probabilistic games for synthesizing environment assumptions for unrealizable specifications.","lang":"eng"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"}],"has_accepted_license":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"conference":{"end_date":"2010-07-17","name":"CAV: Computer Aided Verification","location":"Edinburgh, UK","start_date":"2010-07-15"},"file":[{"creator":"system","file_id":"5221","relation":"main_file","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:46:28Z","checksum":"0b2ef8c4037ffccc6902d93081af24f7","date_created":"2018-12-12T10:16:33Z","file_size":293605,"file_name":"IST-2012-43-v1+1_GIST-_A_solver_for_probabilistic_games.pdf"}],"date_created":"2018-12-11T12:08:36Z","month":"07","date_published":"2010-07-01T00:00:00Z","publisher":"Springer","scopus_import":1,"language":[{"iso":"eng"}],"page":"665 - 669","file_date_updated":"2020-07-14T12:46:28Z","day":"01","type":"conference","intvolume":"      6174","status":"public"},{"publisher":"Springer","scopus_import":1,"language":[{"iso":"eng"}],"month":"07","date_published":"2010-07-29T00:00:00Z","date_created":"2018-12-11T12:08:37Z","department":[{"_id":"ToHe"}],"intvolume":"      6200","status":"public","day":"29","type":"book_chapter","series_title":"Essays in Memory of Amir Pnueli","publication":"Time For Verification: Essays in Memory of Amir Pnueli","page":"42 - 60","title":"Quantitative Simulation Games","doi":"10.1007/978-3-642-13754-9_3","year":"2010","ec_funded":1,"alternative_title":["LNCS"],"abstract":[{"text":"While a boolean notion of correctness is given by a preorder on systems and properties, a quantitative notion of correctness is defined by a distance function on systems and properties, where the distance between a system and a property provides a measure of “fit” or “desirability.” In this article, we explore several ways how the simulation preorder can be generalized to a distance function. This is done by equipping the classical simulation game between a system and a property with quantitative objectives. In particular, for systems that satisfy a property, a quantitative simulation game can measure the “robustness” of the satisfaction, that is, how much the system can deviate from its nominal behavior while still satisfying the property. For systems that violate a property, a quantitative simulation game can measure the “seriousness” of the violation, that is, how much the property has to be modified so that it is satisfied by the system. These distances can be computed in polynomial time, since the computation reduces to the value problem in limit average games with constant weights. Finally, we demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes. ","lang":"eng"}],"author":[{"first_name":"Pavol","full_name":"Cerny, Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","citation":{"apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2010). Quantitative Simulation Games. In Z. Manna &#38; D. Peled (Eds.), <i>Time For Verification: Essays in Memory of Amir Pnueli</i> (Vol. 6200, pp. 42–60). Springer. <a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">https://doi.org/10.1007/978-3-642-13754-9_3</a>","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative Simulation Games,” in <i>Time For Verification: Essays in Memory of Amir Pnueli</i>, vol. 6200, Z. Manna and D. Peled, Eds. Springer, 2010, pp. 42–60.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Simulation Games.” In <i>Time For Verification: Essays in Memory of Amir Pnueli</i>, edited by Zohar Manna and Doron Peled, 6200:42–60. Essays in Memory of Amir Pnueli. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">https://doi.org/10.1007/978-3-642-13754-9_3</a>.","mla":"Cerny, Pavol, et al. “Quantitative Simulation Games.” <i>Time For Verification: Essays in Memory of Amir Pnueli</i>, edited by Zohar Manna and Doron Peled, vol. 6200, Springer, 2010, pp. 42–60, doi:<a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">10.1007/978-3-642-13754-9_3</a>.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Quantitative Simulation Games. In: Manna Z, Peled D, eds. <i>Time For Verification: Essays in Memory of Amir Pnueli</i>. Vol 6200. Essays in Memory of Amir Pnueli. Springer; 2010:42-60. doi:<a href=\"https://doi.org/10.1007/978-3-642-13754-9_3\">10.1007/978-3-642-13754-9_3</a>","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010.Quantitative Simulation Games. In: Time For Verification: Essays in Memory of Amir Pnueli. LNCS, vol. 6200, 42–60.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Z. Manna, D. Peled (Eds.), Time For Verification: Essays in Memory of Amir Pnueli, Springer, 2010, pp. 42–60."},"_id":"4392","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","grant_number":"215543"},{"name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"214373"}],"oa_version":"None","quality_controlled":"1","editor":[{"last_name":"Manna","full_name":"Manna, Zohar","first_name":"Zohar"},{"first_name":"Doron","last_name":"Peled","full_name":"Peled, Doron"}],"volume":6200,"date_updated":"2021-01-12T07:56:38Z","publist_id":"1064"},{"oa":1,"date_updated":"2023-02-23T12:24:04Z","volume":6269,"publist_id":"1065","quality_controlled":"1","oa_version":"Submitted Version","project":[{"grant_number":"215543","call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","call_identifier":"FP7","grant_number":"214373"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was partially supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","_id":"4393","citation":{"chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances,” 6269:235–68. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">https://doi.org/10.1007/978-3-642-15375-4_18</a>.","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 235–268.","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2010). Simulation distances (Vol. 6269, pp. 235–268). 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_18\">https://doi.org/10.1007/978-3-642-15375-4_18</a>","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–268.","ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances. CONCUR: Concurrency Theory, LNCS, vol. 6269, 235–268.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Simulation distances. In: Vol 6269. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:235-268. doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">10.1007/978-3-642-15375-4_18</a>","mla":"Cerny, Pavol, et al. <i>Simulation Distances</i>. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–68, doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_18\">10.1007/978-3-642-15375-4_18</a>."},"publication_status":"published","author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","full_name":"Cerny, Pavol","last_name":"Cerny"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"lang":"eng","text":"Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of “fit” or “desirability.” We extend the simulation preorder to the quantitative setting, by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the implementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes."}],"alternative_title":["LNCS"],"ddc":["005"],"related_material":{"record":[{"relation":"later_version","id":"3249","status":"public"},{"status":"public","relation":"earlier_version","id":"5389"}]},"ec_funded":1,"doi":"10.1007/978-3-642-15375-4_18","year":"2010","title":"Simulation distances","pubrep_id":"42","page":"235 - 268","file_date_updated":"2020-07-14T12:46:28Z","type":"conference","day":"01","status":"public","intvolume":"      6269","department":[{"_id":"ToHe"}],"has_accepted_license":"1","date_created":"2018-12-11T12:08:37Z","file":[{"date_updated":"2020-07-14T12:46:28Z","access_level":"open_access","file_name":"IST-2012-42-v1+1_Simulation_distances.pdf","file_size":198913,"date_created":"2018-12-12T10:15:12Z","checksum":"ea567903676ba8afe0507ee11313dce5","content_type":"application/pdf","relation":"main_file","creator":"system","file_id":"5130"}],"conference":{"end_date":"2010-09-03","name":"CONCUR: Concurrency Theory","location":"Paris, France","start_date":"2010-08-31"},"date_published":"2010-11-01T00:00:00Z","month":"11","language":[{"iso":"eng"}],"scopus_import":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"}]