{"doi":"10.1145/3373718.3394761","quality_controlled":"1","year":"2020","_id":"7955","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"arxiv":["1908.05106"],"isi":["000665014900010"]},"author":[{"full_name":"Ashok, Pranav","last_name":"Ashok","first_name":"Pranav"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Kretinsky, Jan","first_name":"Jan","last_name":"Kretinsky"},{"full_name":"Weininger, Maximilian","first_name":"Maximilian","last_name":"Weininger"},{"full_name":"Winkler, Tobias","first_name":"Tobias","last_name":"Winkler"}],"has_accepted_license":"1","date_updated":"2023-08-21T08:24:36Z","status":"public","acknowledgement":"Pranav Ashok, Jan Křetínský and Maximilian Weininger were funded in part by TUM IGSSE Grant 10.06 (PARSEC) and the German Research Foundation (DFG) project KR 4890/2-1\r\n“Statistical Unbounded Verification”. Krishnendu Chatterjee was supported by the ERC CoG 863818 (ForM-SMArt) and Vienna Science and Technology Fund (WWTF) Project ICT15-\r\n003. Tobias Winkler was supported by the RTG 2236 UnRAVe.","ddc":["000"],"scopus_import":"1","publication":"Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science ","month":"07","citation":{"mla":"Ashok, Pranav, et al. “Approximating Values of Generalized-Reachability Stochastic Games.” <i>Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science </i>, Association for Computing Machinery, 2020, pp. 102–15, doi:<a href=\"https://doi.org/10.1145/3373718.3394761\">10.1145/3373718.3394761</a>.","ista":"Ashok P, Chatterjee K, Kretinsky J, Weininger M, Winkler T. 2020. Approximating values of generalized-reachability stochastic games. Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science . LICS: Symposium on Logic in Computer Science, 102–115.","ieee":"P. Ashok, K. Chatterjee, J. Kretinsky, M. Weininger, and T. Winkler, “Approximating values of generalized-reachability stochastic games,” in <i>Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science </i>, Saarbrücken, Germany, 2020, pp. 102–115.","short":"P. Ashok, K. Chatterjee, J. Kretinsky, M. Weininger, T. Winkler, in:, Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science , Association for Computing Machinery, 2020, pp. 102–115.","ama":"Ashok P, Chatterjee K, Kretinsky J, Weininger M, Winkler T. Approximating values of generalized-reachability stochastic games. In: <i>Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science </i>. Association for Computing Machinery; 2020:102-115. doi:<a href=\"https://doi.org/10.1145/3373718.3394761\">10.1145/3373718.3394761</a>","chicago":"Ashok, Pranav, Krishnendu Chatterjee, Jan Kretinsky, Maximilian Weininger, and Tobias Winkler. “Approximating Values of Generalized-Reachability Stochastic Games.” In <i>Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science </i>, 102–15. Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3373718.3394761\">https://doi.org/10.1145/3373718.3394761</a>.","apa":"Ashok, P., Chatterjee, K., Kretinsky, J., Weininger, M., &#38; Winkler, T. (2020). Approximating values of generalized-reachability stochastic games. In <i>Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science </i> (pp. 102–115). Saarbrücken, Germany: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3373718.3394761\">https://doi.org/10.1145/3373718.3394761</a>"},"isi":1,"publication_status":"published","project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"}],"page":"102-115","day":"08","article_processing_charge":"No","title":"Approximating values of generalized-reachability stochastic games","file_date_updated":"2020-11-25T09:38:14Z","publication_identifier":{"isbn":["9781450371049"]},"date_created":"2020-06-14T22:00:48Z","language":[{"iso":"eng"}],"oa":1,"ec_funded":1,"abstract":[{"text":"Simple stochastic games are turn-based 2½-player games with a reachability objective. The basic question asks whether one player can ensure reaching a given target with at least a given probability. A natural extension is games with a conjunction of such conditions as objective. Despite a plethora of recent results on the analysis of systems with multiple objectives, the decidability of this basic problem remains open. In this paper, we present an algorithm approximating the Pareto frontier of the achievable values to a given precision. Moreover, it is an anytime algorithm, meaning it can be stopped at any time returning the current approximation and its error bound.","lang":"eng"}],"conference":{"location":"Saarbrücken, Germany","end_date":"2020-07-11","start_date":"2020-07-08","name":"LICS: Symposium on Logic in Computer Science"},"date_published":"2020-07-08T00:00:00Z","oa_version":"Published Version","department":[{"_id":"KrCh"}],"file":[{"access_level":"open_access","success":1,"file_id":"8804","content_type":"application/pdf","relation":"main_file","file_name":"2020_LICS_Ashok.pdf","creator":"dernst","checksum":"d0d0288fe991dd16cf5f02598b794240","date_created":"2020-11-25T09:38:14Z","file_size":1001395,"date_updated":"2020-11-25T09:38:14Z"}],"publisher":"Association for Computing Machinery","type":"conference"}