{"language":[{"iso":"eng"}],"intvolume":"     13244","oa_version":"Published Version","title":"A direct symbolic algorithm for solving stochastic rabin games","quality_controlled":"1","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/978-3-030-99527-0_5"}],"date_published":"2022-03-29T00:00:00Z","day":"29","year":"2022","publisher":"Springer Nature","publication_identifier":{"eisbn":["9783030995270"]},"type":"conference","extern":"1","volume":13244,"date_updated":"2023-02-09T08:58:48Z","abstract":[{"text":"We consider turn-based stochastic 2-player games on graphs with ω-regular winning conditions. We provide a direct symbolic algorithm for solving such games when the winning condition is formulated as a Rabin condition. For a stochastic Rabin game with k pairs over a game graph with n vertices, our algorithm runs in O(nk+2k!) symbolic steps, which improves the state of the art.\r\nWe have implemented our symbolic algorithm, along with performance optimizations including parallellization and acceleration, in a BDD-based synthesis tool called Fairsyn. We demonstrate the superiority of Fairsyn compared to the state of the art on a set of synthetic benchmarks derived from the VLTS benchmark suite and on a control system benchmark from the literature. In our experiments, Fairsyn performed significantly faster with up to two orders of magnitude improvement in computation time.","lang":"eng"}],"publication":"28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","publication_status":"published","alternative_title":["LNCS"],"doi":"10.1007/978-3-030-99527-0_5","author":[{"last_name":"Banerjee","full_name":"Banerjee, Tamajit","first_name":"Tamajit"},{"last_name":"Majumdar","full_name":"Majumdar, Rupak","first_name":"Rupak"},{"first_name":"Kaushik","full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475","last_name":"Mallik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"},{"full_name":"Schmuck, Anne-Kathrin","first_name":"Anne-Kathrin","last_name":"Schmuck"},{"full_name":"Soudjani, Sadegh","first_name":"Sadegh","last_name":"Soudjani"}],"conference":{"location":"Munich, Germany","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2022-04-02","end_date":"2022-04-07"},"_id":"12529","date_created":"2023-02-08T11:43:34Z","month":"03","citation":{"ista":"Banerjee T, Majumdar R, Mallik K, Schmuck A-K, Soudjani S. 2022. A direct symbolic algorithm for solving stochastic rabin games. 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13244, 81–98.","chicago":"Banerjee, Tamajit, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck, and Sadegh Soudjani. “A Direct Symbolic Algorithm for Solving Stochastic Rabin Games.” In <i>28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 13244:81–98. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-030-99527-0_5\">https://doi.org/10.1007/978-3-030-99527-0_5</a>.","apa":"Banerjee, T., Majumdar, R., Mallik, K., Schmuck, A.-K., &#38; Soudjani, S. (2022). A direct symbolic algorithm for solving stochastic rabin games. In <i>28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 13244, pp. 81–98). Munich, Germany: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-99527-0_5\">https://doi.org/10.1007/978-3-030-99527-0_5</a>","mla":"Banerjee, Tamajit, et al. “A Direct Symbolic Algorithm for Solving Stochastic Rabin Games.” <i>28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 13244, Springer Nature, 2022, pp. 81–98, doi:<a href=\"https://doi.org/10.1007/978-3-030-99527-0_5\">10.1007/978-3-030-99527-0_5</a>.","ama":"Banerjee T, Majumdar R, Mallik K, Schmuck A-K, Soudjani S. A direct symbolic algorithm for solving stochastic rabin games. In: <i>28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 13244. Springer Nature; 2022:81-98. doi:<a href=\"https://doi.org/10.1007/978-3-030-99527-0_5\">10.1007/978-3-030-99527-0_5</a>","short":"T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, S. Soudjani, in:, 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2022, pp. 81–98.","ieee":"T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, and S. Soudjani, “A direct symbolic algorithm for solving stochastic rabin games,” in <i>28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Munich, Germany, 2022, vol. 13244, pp. 81–98."},"article_processing_charge":"No","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"81-98","status":"public"}