{"conference":{"location":"Singapore, Singapore","end_date":"2025-06-26","name":"LICS: Logic in Computer Science","start_date":"2025-06-23"},"project":[{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020"}],"quality_controlled":"1","arxiv":1,"oa_version":"Preprint","acknowledgement":"This research was funded in part by the German Research Foundation (DFG) project 427755713 GOPro, the MUNI Award in Science and Humanities (MUNI/I/1757/2021) of the Grant Agency of Masaryk University, the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 101034413, and the ERC Starting Grant DEUCE (101077178).","oa":1,"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2505.21087"}],"article_processing_charge":"No","abstract":[{"lang":"eng","text":"We consider two-player zero-sum concurrent stochastic games (CSGs) played on graphs with reachability and safety objectives. These include degenerate classes such as Markov decision processes or turn-based stochastic games, which can be solved by linear or quadratic programming; however, in practice, value iteration (VI) outperforms the other approaches and is the most implemented method. Similarly, for CSGs, this practical performance makes VI an attractive alternative to the standard theoretical solution via the existential theory of reals.VI starts with an under-approximation of the sought values for each state and iteratively updates them, traditionally terminating once two consecutive approximations are ϵ-close. However, this stopping criterion lacks guarantees on the precision of the approximation, which is the goal of this work. We provide bounded (a.k.a. interval) VI for CSGs: it complements standard VI with a converging sequence of over-approximations and terminates once the over- and under-approximations are ϵ-close."}],"author":[{"full_name":"Grobelna, Marta","last_name":"Grobelna","first_name":"Marta"},{"first_name":"Jan","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-0163-2152","first_name":"Maximilian","id":"02ab0197-cc70-11ed-ab61-918e71f56881","last_name":"Weininger","full_name":"Weininger, Maximilian"}],"publication":"2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science","page":"568-580","_id":"20688","doi":"10.1109/lics65433.2025.00049","title":"Stopping criteria for value iteration on concurrent stochastic reachability and safety games","external_id":{"arxiv":["2505.21087"]},"department":[{"_id":"KrCh"}],"day":"09","publication_identifier":{"eisbn":["9798331579005"]},"year":"2025","OA_place":"repository","ec_funded":1,"publication_status":"published","month":"10","date_updated":"2025-11-26T07:34:19Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","status":"public","publisher":"IEEE","date_published":"2025-10-09T00:00:00Z","date_created":"2025-11-24T14:23:49Z","corr_author":"1","OA_type":"green","scopus_import":"1","citation":{"ista":"Grobelna M, Kretinsky J, Weininger M. 2025. Stopping criteria for value iteration on concurrent stochastic reachability and safety games. 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 568–580.","short":"M. Grobelna, J. Kretinsky, M. Weininger, in:, 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2025, pp. 568–580.","chicago":"Grobelna, Marta, Jan Kretinsky, and Maximilian Weininger. “Stopping Criteria for Value Iteration on Concurrent Stochastic Reachability and Safety Games.” In <i>2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 568–80. IEEE, 2025. <a href=\"https://doi.org/10.1109/lics65433.2025.00049\">https://doi.org/10.1109/lics65433.2025.00049</a>.","ieee":"M. Grobelna, J. Kretinsky, and M. Weininger, “Stopping criteria for value iteration on concurrent stochastic reachability and safety games,” in <i>2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Singapore, Singapore, 2025, pp. 568–580.","mla":"Grobelna, Marta, et al. “Stopping Criteria for Value Iteration on Concurrent Stochastic Reachability and Safety Games.” <i>2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, IEEE, 2025, pp. 568–80, doi:<a href=\"https://doi.org/10.1109/lics65433.2025.00049\">10.1109/lics65433.2025.00049</a>.","ama":"Grobelna M, Kretinsky J, Weininger M. Stopping criteria for value iteration on concurrent stochastic reachability and safety games. In: <i>2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE; 2025:568-580. doi:<a href=\"https://doi.org/10.1109/lics65433.2025.00049\">10.1109/lics65433.2025.00049</a>","apa":"Grobelna, M., Kretinsky, J., &#38; Weininger, M. (2025). Stopping criteria for value iteration on concurrent stochastic reachability and safety games. In <i>2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science</i> (pp. 568–580). Singapore, Singapore: IEEE. <a href=\"https://doi.org/10.1109/lics65433.2025.00049\">https://doi.org/10.1109/lics65433.2025.00049</a>"}}