[{"corr_author":"1","quality_controlled":"1","year":"2009","date_created":"2018-12-11T12:09:24Z","citation":{"ama":"Chatterjee K, Doyen L, Henzinger TA. A survey of stochastic games with limsup and liminf objectives. In: Vol 5556. Springer; 2009:1-15. doi:<a href=\"https://doi.org/10.1007/978-3-642-02930-1_1\">10.1007/978-3-642-02930-1_1</a>","ista":"Chatterjee K, Doyen L, Henzinger TA. 2009. A survey of stochastic games with limsup and liminf objectives. ICALP: Automata, Languages and Programming, LNCS, vol. 5556, 1–15.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2009). A survey of stochastic games with limsup and liminf objectives (Vol. 5556, pp. 1–15). Presented at the ICALP: Automata, Languages and Programming, Rhodos, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-642-02930-1_1\">https://doi.org/10.1007/978-3-642-02930-1_1</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey of Stochastic Games with Limsup and Liminf Objectives,” 5556:1–15. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-02930-1_1\">https://doi.org/10.1007/978-3-642-02930-1_1</a>.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 1–15.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of stochastic games with limsup and liminf objectives,” presented at the ICALP: Automata, Languages and Programming, Rhodos, Greece, 2009, vol. 5556, pp. 1–15.","mla":"Chatterjee, Krishnendu, et al. <i>A Survey of Stochastic Games with Limsup and Liminf Objectives</i>. Vol. 5556, Springer, 2009, pp. 1–15, doi:<a href=\"https://doi.org/10.1007/978-3-642-02930-1_1\">10.1007/978-3-642-02930-1_1</a>."},"oa":1,"publist_id":"177","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"A survey of stochastic games with limsup and liminf objectives","ec_funded":1,"file_date_updated":"2020-07-14T12:46:31Z","file":[{"date_updated":"2020-07-14T12:46:31Z","creator":"system","date_created":"2018-12-12T10:13:11Z","file_name":"IST-2012-38-v1+1_A_survey_of_stochastic_games_with_limsup_and_liminf_objectives.pdf","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"4992","file_size":187419,"checksum":"dabb6d24428a000254c95493d9c492e6"}],"publication_status":"published","pubrep_id":"38","status":"public","_id":"4545","intvolume":"      5556","abstract":[{"text":"A stochastic game is a two-player game played oil a graph, where in each state the successor is chosen either by One of the players, or according to a probability distribution. We Survey Stochastic games with limsup and liminf objectives. A real-valued re-ward is assigned to each state, and the value of all infinite path is the limsup (resp. liminf) of all rewards along the path. The value of a stochastic game is the maximal expected value of an infinite path that call he achieved by resolving the decisions of the first player. We present the complexity of computing values of Stochastic games and their subclasses, and the complexity, of optimal strategies in such games. ","lang":"eng"}],"publisher":"Springer","day":"24","page":"1 - 15","volume":5556,"type":"conference","doi":"10.1007/978-3-642-02930-1_1","acknowledgement":"This research was supported in part by the Swiss National Science Foundation under the Indo-Swiss Joint Research Programme, by the European Network of Excellence on Embedded Systems Design (ArtistDesign), by the European projects COMBEST, Quasimodo, Gasics, by the PAI program Moves funded by the Belgian Federal Government, and by the CFV (Federated Center in Verification) funded by the F.R.S.-FNRS.","department":[{"_id":"KrCh"}],"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}],"ddc":["000","005"],"alternative_title":["LNCS"],"date_published":"2009-06-24T00:00:00Z","date_updated":"2024-10-09T20:53:54Z","project":[{"name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"}],"conference":{"name":"ICALP: Automata, Languages and Programming","location":"Rhodos, Greece","start_date":"2009-07-05","end_date":"2009-07-12"},"language":[{"iso":"eng"}],"has_accepted_license":"1","scopus_import":1,"oa_version":"Submitted Version","month":"06"},{"status":"public","abstract":[{"text":"Most specification languages express only qualitative constraints. However, among two implementations that satisfy a given specification, one may be preferred to another. For example, if a specification asks that every request is followed by a response, one may prefer an implementation that generates responses quickly but does not generate unnecessary responses. We use quantitative properties to measure the “goodness” of an implementation. Using games with corresponding quantitative objectives, we can synthesize “optimal” implementations, which are preferred among the set of possible implementations that satisfy a given specification.\r\nIn particular, we show how automata with lexicographic mean-payoff conditions can be used to express many interesting quantitative properties for reactive systems. In this framework, the synthesis of optimal implementations requires the solution of lexicographic mean-payoff games (for safety requirements), and the solution of games with both lexicographic mean-payoff and parity objectives (for liveness requirements). We present algorithms for solving both kinds of novel graph games.","lang":"eng"}],"_id":"4569","intvolume":"      5643","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/0904.2638"}],"arxiv":1,"publication_status":"published","type":"conference","day":"19","page":"140 - 156","volume":5643,"publisher":"Springer","oa":1,"citation":{"ieee":"R. Bloem, K. Chatterjee, T. A. Henzinger, and B. Jobstmann, “Better quality in synthesis through quantitative objectives,” presented at the CAV: Computer Aided Verification, Grenoble, France, 2009, vol. 5643, pp. 140–156.","mla":"Bloem, Roderick, et al. <i>Better Quality in Synthesis through Quantitative Objectives</i>. Vol. 5643, Springer, 2009, pp. 140–56, doi:<a href=\"https://doi.org/10.1007/978-3-642-02658-4_14\">10.1007/978-3-642-02658-4_14</a>.","short":"R. Bloem, K. Chatterjee, T.A. Henzinger, B. Jobstmann, in:, Springer, 2009, pp. 140–156.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Thomas A Henzinger, and Barbara Jobstmann. “Better Quality in Synthesis through Quantitative Objectives,” 5643:140–56. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-02658-4_14\">https://doi.org/10.1007/978-3-642-02658-4_14</a>.","apa":"Bloem, R., Chatterjee, K., Henzinger, T. A., &#38; Jobstmann, B. (2009). Better quality in synthesis through quantitative objectives (Vol. 5643, pp. 140–156). Presented at the CAV: Computer Aided Verification, Grenoble, France: Springer. <a href=\"https://doi.org/10.1007/978-3-642-02658-4_14\">https://doi.org/10.1007/978-3-642-02658-4_14</a>","ista":"Bloem R, Chatterjee K, Henzinger TA, Jobstmann B. 2009. Better quality in synthesis through quantitative objectives. CAV: Computer Aided Verification, LNCS, vol. 5643, 140–156.","ama":"Bloem R, Chatterjee K, Henzinger TA, Jobstmann B. Better quality in synthesis through quantitative objectives. In: Vol 5643. Springer; 2009:140-156. doi:<a href=\"https://doi.org/10.1007/978-3-642-02658-4_14\">10.1007/978-3-642-02658-4_14</a>"},"year":"2009","date_created":"2018-12-11T12:09:31Z","quality_controlled":"1","ec_funded":1,"title":"Better quality in synthesis through quantitative objectives","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"141","date_updated":"2024-10-21T06:03:07Z","project":[{"name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"215543"}],"alternative_title":["LNCS"],"date_published":"2009-06-19T00:00:00Z","author":[{"first_name":"Roderick","last_name":"Bloem","full_name":"Bloem, Roderick"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"}],"month":"06","scopus_import":"1","oa_version":"Preprint","conference":{"location":"Grenoble, France","name":"CAV: Computer Aided Verification","end_date":"2009-07-02","start_date":"2009-06-26"},"language":[{"iso":"eng"}],"external_id":{"arxiv":["0904.2638"]},"acknowledgement":"This research was supported by the Swiss National Science Foundation (Indo-Swiss Research Program and NCCR MICS) and the European Union projects COMBEST and COCONUT.","doi":"10.1007/978-3-642-02658-4_14","department":[{"_id":"KrCh"}]}]