[{"volume":245,"date_updated":"2023-02-23T11:45:42Z","year":"2015","citation":{"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>","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>","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.","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>.","short":"K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, Information and Computation 245 (2015) 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>.","ista":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2015. Randomness for free. Information and Computation. 245(12), 3–16."},"doi":"10.1016/j.ic.2015.06.003","day":"01","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. "}],"page":"3 - 16","quality_controlled":"1","ec_funded":1,"publisher":"Elsevier","_id":"1731","scopus_import":1,"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","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","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"issue":"12","publication_status":"published","date_created":"2018-12-11T11:53:42Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Randomness for free","intvolume":"       245","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1006.0673"}],"status":"public","related_material":{"record":[{"status":"public","id":"3856","relation":"earlier_version"}]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_published":"2015-12-01T00:00:00Z","type":"journal_article","oa":1,"publist_id":"5395","language":[{"iso":"eng"}],"publication":"Information and Computation","oa_version":"Preprint","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"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","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"month":"12"},{"status":"public","related_material":{"record":[{"status":"public","id":"4393","relation":"earlier_version"},{"status":"public","id":"5389","relation":"earlier_version"}]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","type":"journal_article","date_published":"2012-01-06T00:00:00Z","publist_id":"3408","language":[{"iso":"eng"}],"publication":"Theoretical Computer Science","month":"01","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems"}],"oa_version":"None","volume":413,"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.","citation":{"ista":"Cerny P, Henzinger TA, Radhakrishna A. 2012. Simulation distances. Theoretical Computer Science. 413(1), 21–35.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 413 (2012) 21–35.","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>.","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.","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>.","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>","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>"},"year":"2012","date_updated":"2023-02-23T12:24:04Z","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"}],"day":"06","doi":"10.1016/j.tcs.2011.08.002","ec_funded":1,"quality_controlled":"1","page":"21 - 35","publisher":"Elsevier","issue":"1","author":[{"full_name":"Cerny, Pavol","first_name":"Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","first_name":"Arjun"}],"scopus_import":1,"_id":"3249","intvolume":"       413","title":"Simulation distances","pubrep_id":"42","date_created":"2018-12-11T12:02:15Z","department":[{"_id":"ToHe"}],"publication_status":"published"},{"oa":1,"publist_id":"3323","date_published":"2011-07-14T00:00:00Z","type":"conference","main_file_link":[{"url":"https://openlib.tugraz.at/download.php?id=5cb57c8a49344&location=browse","open_access":"1"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11402-N23","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"214373","name":"Design for Embedded Systems","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"month":"07","publication":"6th IEEE International Symposium on Industrial and Embedded Systems","conference":{"name":" SIES: International Symposium on Industrial Embedded Systems","start_date":"2011-06-15","location":"Vasteras, Sweden","end_date":"2011-06-17"},"language":[{"iso":"eng"}],"doi":"10.1109/SIES.2011.5953660","day":"14","abstract":[{"text":"In addition to being correct, a system should be robust, that is, it should behave reasonably even after receiving unexpected inputs. In this paper, we summarize two formal notions of robustness that we have introduced previously for reactive systems. One of the notions is based on assigning costs for failures on a user-provided notion of incorrect transitions in a specification. Here, we define a system to be robust if a finite number of incorrect inputs does not lead to an infinite number of incorrect outputs. We also give a more refined notion of robustness that aims to minimize the ratio of output failures to input failures. The second notion is aimed at liveness. In contrast to the previous notion, it has no concept of recovery from an error. Instead, it compares the ratio of the number of liveness constraints that the system violates to the number of liveness constraints that the environment violates.","lang":"eng"}],"date_updated":"2021-01-12T07:42:36Z","year":"2011","citation":{"mla":"Bloem, Roderick, et al. “Specification-Centered Robustness.” <i>6th IEEE International Symposium on Industrial and Embedded Systems</i>, IEEE, 2011, pp. 176–85, doi:<a href=\"https://doi.org/10.1109/SIES.2011.5953660\">10.1109/SIES.2011.5953660</a>.","short":"R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, 6th IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–185.","ista":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2011. Specification-centered robustness. 6th IEEE International Symposium on Industrial and Embedded Systems.  SIES: International Symposium on Industrial Embedded Systems, 176–185.","ama":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. Specification-centered robustness. In: <i>6th IEEE International Symposium on Industrial and Embedded Systems</i>. IEEE; 2011:176-185. doi:<a href=\"https://doi.org/10.1109/SIES.2011.5953660\">10.1109/SIES.2011.5953660</a>","apa":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., &#38; Jobstmann, B. (2011). Specification-centered robustness. In <i>6th IEEE International Symposium on Industrial and Embedded Systems</i> (pp. 176–185). Vasteras, Sweden: IEEE. <a href=\"https://doi.org/10.1109/SIES.2011.5953660\">https://doi.org/10.1109/SIES.2011.5953660</a>","ieee":"R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Specification-centered robustness,” in <i>6th IEEE International Symposium on Industrial and Embedded Systems</i>, Vasteras, Sweden, 2011, pp. 176–185.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Specification-Centered Robustness.” In <i>6th IEEE International Symposium on Industrial and Embedded Systems</i>, 176–85. IEEE, 2011. <a href=\"https://doi.org/10.1109/SIES.2011.5953660\">https://doi.org/10.1109/SIES.2011.5953660</a>."},"publication_status":"published","date_created":"2018-12-11T12:02:38Z","article_processing_charge":"No","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Specification-centered robustness","_id":"3316","scopus_import":1,"author":[{"full_name":"Bloem, Roderick","first_name":"Roderick","last_name":"Bloem"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Greimel","first_name":"Karin","full_name":"Greimel, Karin"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"}],"publisher":"IEEE","page":"176 - 185","quality_controlled":"1","ec_funded":1},{"language":[{"iso":"eng"}],"month":"04","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"oa_version":"Published Version","has_accepted_license":"1","status":"public","related_material":{"record":[{"status":"public","relation":"later_version","id":"2038"},{"status":"public","id":"3356","relation":"later_version"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"creator":"system","file_id":"5461","relation":"main_file","access_level":"open_access","file_name":"IST-2011-0003_IST-2011-0003.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:41Z","file_size":366281,"checksum":"8491d0d48c4911620ecd5350b413c11e","date_created":"2018-12-12T11:53:00Z"}],"oa":1,"publication_identifier":{"issn":["2664-1690"]},"type":"technical_report","date_published":"2011-04-04T00:00:00Z","publisher":"IST Austria","file_date_updated":"2020-07-14T12:46:41Z","ec_funded":1,"page":"14","pubrep_id":"21","title":"Temporal specifications with accumulative values","alternative_title":["IST Austria Technical Report"],"date_created":"2018-12-12T11:39:02Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publication_status":"published","author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi","last_name":"Boker","full_name":"Boker, Udi"},{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"_id":"5385","ddc":["000","004"],"abstract":[{"lang":"eng","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."}],"day":"04","doi":"10.15479/AT:IST-2011-0003","year":"2011","citation":{"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>.","ieee":"U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, <i>Temporal specifications with accumulative values</i>. IST Austria, 2011.","ama":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. <i>Temporal Specifications with Accumulative Values</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">10.15479/AT:IST-2011-0003</a>","apa":"Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2011). <i>Temporal specifications with accumulative values</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0003\">https://doi.org/10.15479/AT:IST-2011-0003</a>","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.","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>.","short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011."},"date_updated":"2023-02-23T11:23:41Z"},{"language":[{"iso":"eng"}],"project":[{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"214373","name":"Design for Embedded Systems"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version","article_number":"14","month":"07","has_accepted_license":"1","publication":"ACM Transactions on Programming Languages and Systems (TOPLAS)","file":[{"access_level":"open_access","relation":"main_file","creator":"system","file_id":"5235","file_size":775662,"checksum":"5d44a8aa81e33210649beae507602138","date_created":"2018-12-12T10:16:45Z","content_type":"application/pdf","file_name":"IST-2012-85-v1+1_A_theory_of_synchronous_relational_interfaces.pdf","date_updated":"2020-07-14T12:46:09Z"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","oa":1,"publist_id":"3263","type":"journal_article","date_published":"2011-07-01T00:00:00Z","publisher":"ACM","ec_funded":1,"quality_controlled":"1","file_date_updated":"2020-07-14T12:46:09Z","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:02:51Z","publication_status":"published","intvolume":"        33","title":"A theory of synchronous relational interfaces","pubrep_id":"85","scopus_import":1,"_id":"3353","issue":"4","author":[{"first_name":"Stavros","last_name":"Tripakis","full_name":"Tripakis, Stavros"},{"first_name":"Ben","last_name":"Lickly","full_name":"Lickly, Ben"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lee, Edward","first_name":"Edward","last_name":"Lee"}],"volume":33,"ddc":["000","005"],"day":"01","doi":"10.1145/1985342.1985345","abstract":[{"lang":"eng","text":"Compositional theories are crucial when designing large and complex systems from smaller components. In this work we propose such a theory for synchronous concurrent systems. Our approach follows so-called interface theories, which use game-theoretic interpretations of composition and refinement. These are appropriate for systems with distinct inputs and outputs, and explicit conditions on inputs that must be enforced during composition. Our interfaces model systems that execute in an infinite sequence of synchronous rounds. At each round, a contract must be satisfied. The contract is simply a relation specifying the set of valid input/output pairs. Interfaces can be composed by parallel, serial or feedback composition. A refinement relation between interfaces is defined, and shown to have two main properties: (1) it is preserved by composition, and (2) it is equivalent to substitutability, namely, the ability to replace an interface by another one in any context. Shared refinement and abstraction operators, corresponding to greatest lower and least upper bounds with respect to refinement, are also defined. Input-complete interfaces, that impose no restrictions on inputs, and deterministic interfaces, that produce a unique output for any legal input, are discussed as special cases, and an interesting duality between the two classes is exposed. A number of illustrative examples are provided, as well as algorithms to compute compositions, check refinement, and so on, for finite-state interfaces."}],"year":"2011","citation":{"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>.","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.","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>","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>","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."},"date_updated":"2021-01-12T07:42:52Z"},{"ddc":["000","004"],"abstract":[{"lang":"eng","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."}],"day":"21","doi":"10.1109/LICS.2011.33","year":"2011","citation":{"short":"U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.","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>.","ista":"Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.","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>","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>","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."},"date_updated":"2023-02-23T12:23:54Z","publisher":"IEEE","file_date_updated":"2020-07-14T12:46:09Z","ec_funded":1,"pubrep_id":"83","title":"Temporal specifications with accumulative values","date_created":"2018-12-11T12:02:52Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publication_status":"published","author":[{"full_name":"Boker, Udi","first_name":"Udi","last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"last_name":"Kupferman","first_name":"Orna","full_name":"Kupferman, Orna"}],"scopus_import":1,"_id":"3356","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"2038","relation":"later_version"},{"relation":"earlier_version","id":"5385","status":"public"}]},"status":"public","file":[{"file_id":"4960","creator":"system","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:46:09Z","file_name":"IST-2012-83-v1+1_Temporal_specifications_with_accumulative_values.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:12:42Z","checksum":"792128f5455f0f40f1105f0398e05fa9","file_size":225426}],"publist_id":"3259","oa":1,"type":"conference","date_published":"2011-06-21T00:00:00Z","conference":{"location":"Toronto, Canada","end_date":"2011-06-24","start_date":"2011-06-21","name":"LICS: Logic in Computer Science"},"language":[{"iso":"eng"}],"article_number":"5970226","month":"06","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"214373","name":"Design for Embedded Systems","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version","has_accepted_license":"1"},{"publisher":"ACM","conference":{"location":"Taipei; Taiwan","end_date":"2011-10-14","start_date":"2011-10-09","name":"EMSOFT: Embedded Software "},"page":"149 - 154","quality_controlled":"1","ec_funded":1,"language":[{"iso":"eng"}],"oa_version":"None","publication_status":"published","department":[{"_id":"ToHe"}],"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T12:02:53Z","title":"From boolean to quantitative synthesis","month":"10","_id":"3359","author":[{"last_name":"Cerny","first_name":"Pavol","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"}],"acknowledgement":"This work was partially supported by the ERC Advanced Grant QUAREM, the FWF NFN Grant S11402-N23 (RiSE), and the EU NOE Grant ArtistDesign.","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","doi":"10.1145/2038642.2038666","day":"09","abstract":[{"lang":"eng","text":"Motivated by improvements in constraint-solving technology and by the increase of routinely available computational power, partial-program synthesis is emerging as an effective approach for increasing programmer productivity. The goal of the approach is to allow the programmer to specify a part of her intent imperatively (that is, give a partial program) and a part of her intent declaratively, by specifying which conditions need to be achieved or maintained. The task of the synthesizer is to construct a program that satisfies the specification. As an example, consider a partial program where threads access shared data without using any synchronization mechanism, and a declarative specification that excludes data races and deadlocks. The task of the synthesizer is then to place locks into the program code in order for the program to meet the specification.\r\n\r\nIn this paper, we argue that quantitative objectives are needed in partial-program synthesis in order to produce higher-quality programs, while enabling simpler specifications. Returning to the example, the synthesizer could construct a naive solution that uses one global lock for shared data. This can be prevented either by constraining the solution space further (which is error-prone and partly defeats the point of synthesis), or by optimizing a quantitative objective that models performance. Other quantitative notions useful in synthesis include fault tolerance, robustness, resource (memory, power) consumption, and information flow."}],"publist_id":"3256","date_updated":"2021-01-12T07:42:55Z","year":"2011","citation":{"chicago":"Cerny, Pavol, and Thomas A Henzinger. “From Boolean to Quantitative Synthesis,” 149–54. ACM, 2011. <a href=\"https://doi.org/10.1145/2038642.2038666\">https://doi.org/10.1145/2038642.2038666</a>.","ieee":"P. Cerny and T. A. Henzinger, “From boolean to quantitative synthesis,” presented at the EMSOFT: Embedded Software , Taipei; Taiwan, 2011, pp. 149–154.","ama":"Cerny P, Henzinger TA. From boolean to quantitative synthesis. In: ACM; 2011:149-154. doi:<a href=\"https://doi.org/10.1145/2038642.2038666\">10.1145/2038642.2038666</a>","apa":"Cerny, P., &#38; Henzinger, T. A. (2011). From boolean to quantitative synthesis (pp. 149–154). Presented at the EMSOFT: Embedded Software , Taipei; Taiwan: ACM. <a href=\"https://doi.org/10.1145/2038642.2038666\">https://doi.org/10.1145/2038642.2038666</a>","ista":"Cerny P, Henzinger TA. 2011. From boolean to quantitative synthesis. EMSOFT: Embedded Software , 149–154.","mla":"Cerny, Pavol, and Thomas A. Henzinger. <i>From Boolean to Quantitative Synthesis</i>. ACM, 2011, pp. 149–54, doi:<a href=\"https://doi.org/10.1145/2038642.2038666\">10.1145/2038642.2038666</a>.","short":"P. Cerny, T.A. Henzinger, in:, ACM, 2011, pp. 149–154."},"date_published":"2011-10-09T00:00:00Z","type":"conference"},{"publist_id":"3255","oa":1,"date_published":"2011-08-31T00:00:00Z","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","file":[{"access_level":"open_access","relation":"main_file","creator":"system","file_id":"4803","file_size":504270,"checksum":"250603c6be8ccad4fbd4d7b24221f0ee","date_created":"2018-12-12T10:10:17Z","content_type":"application/pdf","file_name":"IST-2012-82-v1+1_Determinizing_discounted-sum_automata.pdf","date_updated":"2020-07-14T12:46:10Z"}],"month":"08","oa_version":"Published Version","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"grant_number":"214373","name":"Design for Embedded Systems","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"}],"has_accepted_license":"1","conference":{"location":"Bergen, Norway","end_date":"2011-09-15","name":"CSL: Computer Science Logic","start_date":"2011-09-12"},"language":[{"iso":"eng"}],"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"}],"doi":"10.4230/LIPIcs.CSL.2011.82","day":"31","date_updated":"2021-01-12T07:42:56Z","citation":{"ista":"Boker U, Henzinger TA. 2011. Determinizing discounted-sum automata. CSL: Computer Science Logic, LIPIcs, vol. 12, 82–96.","mla":"Boker, Udi, and Thomas A. Henzinger. <i>Determinizing Discounted-Sum Automata</i>. Vol. 12, Springer, 2011, pp. 82–96, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2011.82\">10.4230/LIPIcs.CSL.2011.82</a>.","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.","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>.","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>","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>"},"year":"2011","ddc":["004"],"volume":12,"title":"Determinizing discounted-sum automata","pubrep_id":"82","alternative_title":["LIPIcs"],"intvolume":"        12","publication_status":"published","date_created":"2018-12-11T12:02:53Z","department":[{"_id":"ToHe"}],"author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","first_name":"Udi","last_name":"Boker"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"_id":"3360","scopus_import":1,"publisher":"Springer","file_date_updated":"2020-07-14T12:46:10Z","page":"82 - 96","ec_funded":1,"quality_controlled":"1"},{"date_published":"2011-04-01T00:00:00Z","external_id":{"arxiv":["1104.0127"]},"type":"preprint","date_updated":"2020-01-21T13:20:24Z","year":"2011","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>The Decidability Frontier for Probabilistic Automata on Infinite Words</i>. ArXiv.","short":"K. Chatterjee, T.A. Henzinger, M. Tracol, (n.d.).","ista":"Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.","ama":"Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv.","ieee":"K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d."},"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."}],"publist_id":"3251","oa":1,"arxiv":1,"day":"01","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1104.0127"}],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Tracol, Mathieu","last_name":"Tracol","first_name":"Mathieu","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87"}],"_id":"3363","title":"The decidability frontier for probabilistic automata on infinite words","month":"04","oa_version":"Preprint","publication_status":"submitted","project":[{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"name":"Design for Embedded Systems","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"date_created":"2018-12-11T12:02:54Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"language":[{"iso":"eng"}],"page":"19","ec_funded":1,"publisher":"ArXiv"},{"doi":"10.1007/978-3-642-22110-1_20","day":"21","abstract":[{"lang":"eng","text":"We present an algorithmic method for the quantitative, performance-aware synthesis of concurrent programs. The input consists of a nondeterministic partial program and of a parametric performance model. The nondeterminism allows the programmer to omit which (if any) synchronization construct is used at a particular program location. The performance model, specified as a weighted automaton, can capture system architectures by assigning different costs to actions such as locking, context switching, and memory and cache accesses. The quantitative synthesis problem is to automatically resolve the nondeterminism of the partial program so that both correctness is guaranteed and performance is optimal. As is standard for shared memory concurrency, correctness is formalized &quot;specification free&quot;, in particular as race freedom or deadlock freedom. For worst-case (average-case) performance, we show that the problem can be reduced to 2-player graph games (with probabilistic transitions) with quantitative objectives. While we show, using game-theoretic methods, that the synthesis problem is Nexp-complete, we present an algorithmic method and an implementation that works efficiently for concurrent programs and performance models of practical interest. We have implemented a prototype tool and used it to synthesize finite-state concurrent programs that exhibit different programming patterns, for several performance models representing different architectures. "}],"date_updated":"2023-02-23T12:24:01Z","year":"2011","citation":{"ista":"Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. 2011. Quantitative synthesis for concurrent programs. CAV: Computer Aided Verification, LNCS, vol. 6806, 243–259.","short":"P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.","mla":"Cerny, Pavol, et al. <i>Quantitative Synthesis for Concurrent Programs</i>. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 243–59, doi:<a href=\"https://doi.org/10.1007/978-3-642-22110-1_20\">10.1007/978-3-642-22110-1_20</a>.","chicago":"Cerny, Pavol, Krishnendu Chatterjee, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. “Quantitative Synthesis for Concurrent Programs.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:243–59. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22110-1_20\">https://doi.org/10.1007/978-3-642-22110-1_20</a>.","ieee":"P. Cerny, K. Chatterjee, T. A. Henzinger, A. Radhakrishna, and R. Singh, “Quantitative synthesis for concurrent programs,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 243–259.","apa":"Cerny, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., &#38; Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan &#38; S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-22110-1_20\">https://doi.org/10.1007/978-3-642-22110-1_20</a>","ama":"Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. Quantitative synthesis for concurrent programs. In: Gopalakrishnan G, Qadeer S, eds. Vol 6806. Springer; 2011:243-259. doi:<a href=\"https://doi.org/10.1007/978-3-642-22110-1_20\">10.1007/978-3-642-22110-1_20</a>"},"volume":6806,"ddc":["000","004"],"publication_status":"published","article_processing_charge":"No","date_created":"2018-12-11T12:02:55Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"alternative_title":["LNCS"],"title":"Quantitative synthesis for concurrent programs","pubrep_id":"76","intvolume":"      6806","_id":"3366","author":[{"full_name":"Cerny, Pavol","first_name":"Pavol","last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","first_name":"Arjun"},{"full_name":"Singh, Rohit","last_name":"Singh","first_name":"Rohit"}],"publisher":"Springer","editor":[{"full_name":"Gopalakrishnan, Ganesh","last_name":"Gopalakrishnan","first_name":"Ganesh"},{"last_name":"Qadeer","first_name":"Shaz","full_name":"Qadeer, Shaz"}],"page":"243 - 259","quality_controlled":"1","ec_funded":1,"file_date_updated":"2020-07-14T12:46:10Z","publist_id":"3247","oa":1,"date_published":"2011-04-21T00:00:00Z","type":"conference","file":[{"relation":"main_file","access_level":"open_access","creator":"system","file_id":"5174","checksum":"c033689355f45742dc7c99b5af13ce7a","file_size":508946,"date_created":"2018-12-12T10:15:51Z","content_type":"application/pdf","file_name":"IST-2012-76-v1+1_Quantitative_synthesis_for_concurrent_programs.pdf","date_updated":"2020-07-14T12:46:10Z"}],"related_material":{"record":[{"status":"public","id":"5388","relation":"earlier_version"}]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","oa_version":"Submitted Version","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems"}],"month":"04","has_accepted_license":"1","conference":{"end_date":"2011-07-20","location":"Snowbird, USA","start_date":"2011-07-14","name":"CAV: Computer Aided Verification"},"language":[{"iso":"eng"}]},{"year":"2010","citation":{"ista":"Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.","mla":"Chatterjee, Krishnendu, et al. <i>Mean-Payoff Automaton Expressions</i>. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–83, doi:<a href=\"https://doi.org/10.1007/978-3-642-15375-4_19\">10.1007/978-3-642-15375-4_19</a>.","short":"K. Chatterjee, L. Doyen, H. Edelsbrunner, T.A. Henzinger, P. Rannou, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–283.","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.","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>","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>"},"date_updated":"2021-01-12T07:52:40Z","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"}],"day":"18","doi":"10.1007/978-3-642-15375-4_19","ddc":["000","005"],"volume":6269,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rannou","first_name":"Philippe","full_name":"Rannou, Philippe"}],"scopus_import":1,"_id":"3853","intvolume":"      6269","title":"Mean-payoff automaton expressions","pubrep_id":"62","alternative_title":["LNCS"],"department":[{"_id":"KrCh"},{"_id":"HeEd"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:31Z","publication_status":"published","file_date_updated":"2020-07-14T12:46:17Z","quality_controlled":"1","ec_funded":1,"page":"269 - 283","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","date_published":"2010-11-18T00:00:00Z","publist_id":"2328","oa":1,"status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","access_level":"open_access","creator":"system","file_id":"5163","checksum":"4f753ae99d076553fb8733e2c8b390e2","file_size":233260,"date_created":"2018-12-12T10:15:41Z","content_type":"application/pdf","file_name":"IST-2012-62-v1+1_Mean-payoff_automaton_expressions.pdf","date_updated":"2020-07-14T12:46:17Z"}],"has_accepted_license":"1","month":"11","project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"214373","name":"Design for Embedded Systems"}],"oa_version":"Submitted Version","language":[{"iso":"eng"}],"conference":{"name":"CONCUR: Concurrency Theory","start_date":"2010-08-31","end_date":"2010-09-03","location":"Paris, France"}},{"file_date_updated":"2020-07-14T12:46:17Z","page":"258 - 269","quality_controlled":"1","ec_funded":1,"publisher":"Springer","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"_id":"3855","scopus_import":1,"alternative_title":["LNCS"],"pubrep_id":"61","title":"Qualitative analysis of partially-observable Markov Decision Processes","intvolume":"      6281","publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:32Z","ddc":["004"],"volume":6281,"date_updated":"2023-02-23T12:24:22Z","citation":{"short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2010, pp. 258–269.","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.","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>","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>","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.","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>."},"year":"2010","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"}],"doi":"10.1007/978-3-642-15155-2_24","day":"01","language":[{"iso":"eng"}],"conference":{"end_date":"2010-08-27","location":"Brno, Czech Republic","start_date":"2010-08-23","name":"MFCS: Mathematical Foundations of Computer Science"},"has_accepted_license":"1","month":"08","oa_version":"Submitted Version","project":[{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5395"}]},"file":[{"checksum":"b6c82ec82f194e5b0ab7c1c3800e4580","file_size":173948,"date_created":"2018-12-12T10:13:51Z","content_type":"application/pdf","file_name":"IST-2012-61-v1+1_Qualitative_analysis_of_partially-observable_Markov_Decision_Processes.pdf","date_updated":"2020-07-14T12:46:17Z","access_level":"open_access","relation":"main_file","creator":"system","file_id":"5038"}],"date_published":"2010-08-01T00:00:00Z","type":"conference","publist_id":"2326","oa":1},{"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"last_name":"Gimbert","first_name":"Hugo","full_name":"Gimbert, Hugo"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"_id":"3856","scopus_import":1,"title":"Randomness for free","pubrep_id":"60","alternative_title":["LNCS"],"intvolume":"      6281","publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:32Z","page":"246 - 257","quality_controlled":"1","ec_funded":1,"publisher":"Springer","date_updated":"2023-02-23T10:12:00Z","year":"2010","citation":{"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.","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>","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>","ista":"Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2010. Randomness for free. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 246–257.","mla":"Chatterjee, Krishnendu, et al. <i>Randomness for Free</i>. Vol. 6281, Springer, 2010, pp. 246–57, doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_23\">10.1007/978-3-642-15155-2_23</a>.","short":"K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, in:, Springer, 2010, pp. 246–257."},"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. "}],"doi":"10.1007/978-3-642-15155-2_23","day":"06","volume":6281,"acknowledgement":"This research was supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","month":"09","oa_version":"Preprint","project":[{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"name":"Design for Embedded Systems","grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"language":[{"iso":"eng"}],"conference":{"end_date":"2010-08-27","location":"Brno, Czech Republic","name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2010-08-23"},"date_published":"2010-09-06T00:00:00Z","type":"conference","oa":1,"publist_id":"2325","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","related_material":{"record":[{"relation":"later_version","id":"1731","status":"public"}]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1006.0673v1"}]},{"conference":{"start_date":"2010-09-21","name":"ATVA: Automated Technology for Verification and Analysis","location":"Singapore, Singapore","end_date":"2010-09-24"},"language":[{"iso":"eng"}],"project":[{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373","name":"Design for Embedded Systems"}],"oa_version":"None","month":"10","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","related_material":{"record":[{"id":"5392","relation":"earlier_version","status":"public"}]},"publist_id":"2324","type":"conference","date_published":"2010-10-12T00:00:00Z","publisher":"Springer","ec_funded":1,"quality_controlled":"1","page":"1 - 16","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:33Z","publication_status":"published","intvolume":"      6252","title":"Probabilistic Automata on infinite words: decidability and undecidability results","alternative_title":["LNCS"],"pubrep_id":"28","scopus_import":1,"_id":"3857","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"}],"volume":6252,"day":"12","doi":"10.1007/978-3-642-15643-4_1","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"}],"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.","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>.","short":"K. Chatterjee, T.A. Henzinger, in:, Springer, 2010, pp. 1–16.","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.","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>","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>"},"year":"2010","date_updated":"2023-02-23T12:24:14Z"},{"status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2020-07-14T12:46:19Z","content_type":"application/pdf","file_name":"IST-2012-54-v1+1_Robustness_in_the_presence_of_liveness.pdf","date_created":"2018-12-12T10:16:52Z","checksum":"9d204611c8d7855bed8134f8708a0010","file_size":213083,"file_id":"5243","creator":"system","access_level":"open_access","relation":"main_file"}],"oa":1,"publist_id":"2310","date_published":"2010-07-01T00:00:00Z","type":"conference","conference":{"location":"Edinburgh, UK","end_date":"2010-07-19","name":"CAV: Computer Aided Verification","start_date":"2010-07-15"},"language":[{"iso":"eng"}],"month":"07","oa_version":"Submitted Version","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","name":"Design for Embedded Systems","grant_number":"214373"}],"has_accepted_license":"1","ddc":["004"],"volume":6174,"abstract":[{"text":"Systems ought to behave reasonably even in circumstances that are not anticipated in their specifications. We propose a definition of robustness for liveness specifications which prescribes, for any number of environment assumptions that are violated, a minimal number of system guarantees that must still be fulfilled. This notion of robustness can be formulated and realized using a Generalized Reactivity formula. We present an algorithm for synthesizing robust systems from such formulas. For the important special case of Generalized Reactivity formulas of rank 1, our algorithm improves the complexity of [PPS06] for large specifications with a small number of assumptions and guarantees.","lang":"eng"}],"doi":"10.1007/978-3-642-14295-6_36","day":"01","date_updated":"2021-01-12T07:52:47Z","citation":{"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.","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>.","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.","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.","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>","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>"},"year":"2010","publisher":"Springer","editor":[{"full_name":"Touili, Tayssir","last_name":"Touili","first_name":"Tayssir"},{"first_name":"Byron","last_name":"Cook","full_name":"Cook, Byron"},{"full_name":"Jackson, Paul","first_name":"Paul","last_name":"Jackson"}],"file_date_updated":"2020-07-14T12:46:19Z","page":"410 - 424","quality_controlled":"1","ec_funded":1,"title":"Robustness in the presence of liveness","pubrep_id":"54","alternative_title":["LNCS"],"intvolume":"      6174","publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:36Z","author":[{"full_name":"Bloem, Roderick","first_name":"Roderick","last_name":"Bloem"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Greimel, Karin","first_name":"Karin","last_name":"Greimel"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"}],"_id":"3866","scopus_import":1},{"file":[{"date_updated":"2020-07-14T12:46:19Z","content_type":"application/pdf","file_name":"IST-2012-55-v1+1_Expressiveness_Closure_Properties_Quantitative_Languages.pdf","date_created":"2018-12-12T10:17:54Z","checksum":"0243da726476817f2ea33b48b78be696","file_size":216598,"file_id":"5312","creator":"system","relation":"main_file","access_level":"open_access"},{"date_created":"2018-12-12T10:17:55Z","checksum":"5e512b8503a9cb263de26331c4ee9cf2","file_size":302416,"date_updated":"2020-07-14T12:46:19Z","content_type":"application/pdf","file_name":"IST-2016-55-v2+1_1007.4018.pdf","access_level":"open_access","relation":"main_file","file_id":"5313","creator":"system"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"4540","relation":"earlier_version"}]},"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)"},"date_published":"2010-08-30T00:00:00Z","type":"journal_article","oa":1,"publist_id":"2311","language":[{"iso":"eng"}],"publication":"Logical Methods in Computer Science","has_accepted_license":"1","oa_version":"Published Version","project":[{"name":"Design for Embedded Systems","grant_number":"214373","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425"},{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"month":"08","volume":6,"ddc":["000","004"],"date_updated":"2023-02-23T12:15:42Z","year":"2010","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>","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>","ista":"Chatterjee K, Doyen L, Henzinger TA. 2010. Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. 6(3), 1–23.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, Logical Methods in Computer Science 6 (2010) 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>."},"doi":"10.2168/LMCS-6(3:10)2010","day":"30","abstract":[{"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.","lang":"eng"}],"page":"1 - 23","ec_funded":1,"quality_controlled":"1","file_date_updated":"2020-07-14T12:46:19Z","publisher":"International Federation of Computational Logic","_id":"3867","scopus_import":1,"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"issue":"3","publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:36Z","title":"Expressiveness and closure properties for quantitative languages","pubrep_id":"504","intvolume":"         6"},{"_id":"4369","scopus_import":1,"author":[{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","first_name":"Dejan","full_name":"Nickovic, Dejan"},{"first_name":"Nir","last_name":"Piterman","full_name":"Piterman, Nir"}],"publication_status":"published","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:08:30Z","alternative_title":["LNCS"],"title":"From MTL to deterministic timed automata","pubrep_id":"49","intvolume":"      6246","page":"152 - 167","quality_controlled":"1","ec_funded":1,"file_date_updated":"2020-07-14T12:46:27Z","publisher":"Springer","editor":[{"full_name":"Henzinger, Thomas A.","first_name":"Thomas A.","last_name":"Henzinger"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"}],"date_updated":"2021-01-12T07:56:27Z","year":"2010","citation":{"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>","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>","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>.","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.","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>.","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."},"doi":"10.1007/978-3-642-15297-9_13","day":"08","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"}],"volume":6246,"ddc":["004"],"has_accepted_license":"1","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"}],"month":"09","language":[{"iso":"eng"}],"conference":{"location":"Klosterneuburg, Austria","end_date":"2010-09-10","start_date":"2010-09-08","name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"date_published":"2010-09-08T00:00:00Z","type":"conference","oa":1,"publist_id":"1090","file":[{"content_type":"application/pdf","file_name":"IST-2012-49-v1+1_From_MTL_to_deterministic_timed_automata.pdf","date_updated":"2020-07-14T12:46:27Z","file_size":249789,"checksum":"b0ca5f5fbe8a3d20ccbc6f51a344a459","date_created":"2018-12-12T10:13:43Z","creator":"system","file_id":"5028","access_level":"open_access","relation":"main_file"}],"status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"},{"month":"07","oa_version":"Submitted Version","project":[{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"grant_number":"214373","name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"has_accepted_license":"1","conference":{"location":"Edinburgh, UK","end_date":"2010-07-17","start_date":"2010-07-15","name":"CAV: Computer Aided Verification"},"language":[{"iso":"eng"}],"oa":1,"publist_id":"1068","date_published":"2010-07-01T00:00:00Z","type":"conference","related_material":{"record":[{"relation":"earlier_version","id":"5393","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","file":[{"date_created":"2018-12-12T10:16:33Z","checksum":"0b2ef8c4037ffccc6902d93081af24f7","file_size":293605,"date_updated":"2020-07-14T12:46:28Z","content_type":"application/pdf","file_name":"IST-2012-43-v1+1_GIST-_A_solver_for_probabilistic_games.pdf","relation":"main_file","access_level":"open_access","file_id":"5221","creator":"system"}],"alternative_title":["LNCS"],"pubrep_id":"43","title":"GIST: A solver for probabilistic games","intvolume":"      6174","publication_status":"published","date_created":"2018-12-11T12:08:36Z","article_processing_charge":"No","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"},{"last_name":"Radhakrishna","first_name":"Arjun","full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"_id":"4388","scopus_import":1,"publisher":"Springer","file_date_updated":"2020-07-14T12:46:28Z","page":"665 - 669","ec_funded":1,"quality_controlled":"1","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"}],"arxiv":1,"doi":"10.1007/978-3-642-14295-6_57","day":"01","external_id":{"arxiv":["1004.2367"]},"date_updated":"2023-02-23T12:24:17Z","year":"2010","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>.","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.","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>","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>"},"ddc":["004"],"volume":6174},{"type":"book_chapter","date_published":"2010-07-29T00:00:00Z","publist_id":"1064","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","publication":"Time For Verification: Essays in Memory of Amir Pnueli","month":"07","project":[{"name":"COMponent-Based Embedded Systems design Techniques","grant_number":"215543","_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"}],"oa_version":"None","language":[{"iso":"eng"}],"citation":{"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>.","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>","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.","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>."},"year":"2010","date_updated":"2021-01-12T07:56:38Z","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"}],"day":"29","doi":"10.1007/978-3-642-13754-9_3","volume":6200,"author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":1,"_id":"4392","intvolume":"      6200","title":"Quantitative Simulation Games","alternative_title":["LNCS"],"date_created":"2018-12-11T12:08:37Z","department":[{"_id":"ToHe"}],"publication_status":"published","quality_controlled":"1","series_title":"Essays in Memory of Amir Pnueli","ec_funded":1,"page":"42 - 60","editor":[{"full_name":"Manna, Zohar","last_name":"Manna","first_name":"Zohar"},{"first_name":"Doron","last_name":"Peled","full_name":"Peled, Doron"}],"publisher":"Springer"},{"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."}],"doi":"10.1007/978-3-642-15375-4_18","day":"01","date_updated":"2023-02-23T12:24:04Z","citation":{"ista":"Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances. CONCUR: Concurrency Theory, LNCS, vol. 6269, 235–268.","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>.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 235–268.","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>","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>"},"year":"2010","ddc":["005"],"acknowledgement":"This work was partially supported by the European Union project COMBEST and the European Network of Excellence ArtistDesign.","volume":6269,"pubrep_id":"42","alternative_title":["LNCS"],"title":"Simulation distances","intvolume":"      6269","publication_status":"published","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:08:37Z","author":[{"last_name":"Cerny","first_name":"Pavol","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","first_name":"Arjun","full_name":"Radhakrishna, Arjun"}],"_id":"4393","scopus_import":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2020-07-14T12:46:28Z","page":"235 - 268","quality_controlled":"1","ec_funded":1,"oa":1,"publist_id":"1065","date_published":"2010-11-01T00:00:00Z","type":"conference","related_material":{"record":[{"id":"3249","relation":"later_version","status":"public"},{"relation":"earlier_version","id":"5389","status":"public"}]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","file":[{"creator":"system","file_id":"5130","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2012-42-v1+1_Simulation_distances.pdf","date_updated":"2020-07-14T12:46:28Z","checksum":"ea567903676ba8afe0507ee11313dce5","file_size":198913,"date_created":"2018-12-12T10:15:12Z"}],"month":"11","oa_version":"Submitted Version","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"},{"_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems","grant_number":"214373"}],"has_accepted_license":"1","conference":{"name":"CONCUR: Concurrency Theory","start_date":"2010-08-31","location":"Paris, France","end_date":"2010-09-03"},"language":[{"iso":"eng"}]}]