{"publication":"28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","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"}],"doi":"10.1007/978-3-030-99527-0_5","year":"2022","date_created":"2023-02-08T11:43:34Z","citation":{"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.","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.","mla":"Banerjee, Tamajit, et al. “A Direct Symbolic Algorithm for Solving Stochastic Rabin Games.” 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 13244, Springer Nature, 2022, pp. 81–98, doi:10.1007/978-3-030-99527-0_5.","apa":"Banerjee, T., Majumdar, R., Mallik, K., Schmuck, A.-K., & Soudjani, S. (2022). A direct symbolic algorithm for solving stochastic rabin games. In 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13244, pp. 81–98). Munich, Germany: Springer Nature. https://doi.org/10.1007/978-3-030-99527-0_5","chicago":"Banerjee, Tamajit, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck, and Sadegh Soudjani. “A Direct Symbolic Algorithm for Solving Stochastic Rabin Games.” In 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 13244:81–98. Springer Nature, 2022. https://doi.org/10.1007/978-3-030-99527-0_5.","ieee":"T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, and S. Soudjani, “A direct symbolic algorithm for solving stochastic rabin games,” in 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Munich, Germany, 2022, vol. 13244, pp. 81–98.","ama":"Banerjee T, Majumdar R, Mallik K, Schmuck A-K, Soudjani S. A direct symbolic algorithm for solving stochastic rabin games. In: 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 13244. Springer Nature; 2022:81-98. doi:10.1007/978-3-030-99527-0_5"},"day":"29","article_processing_charge":"No","publication_status":"published","scopus_import":"1","oa_version":"Published Version","type":"conference","publication_identifier":{"eisbn":["9783030995270"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/978-3-030-99527-0_5"}],"publisher":"Springer Nature","page":"81-98","volume":13244,"status":"public","extern":"1","conference":{"end_date":"2022-04-07","start_date":"2022-04-02","location":"Munich, Germany","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 13244","month":"03","language":[{"iso":"eng"}],"quality_controlled":"1","date_updated":"2023-02-09T08:58:48Z","date_published":"2022-03-29T00:00:00Z","oa":1,"_id":"12529","title":"A direct symbolic algorithm for solving stochastic rabin games","author":[{"full_name":"Banerjee, Tamajit","last_name":"Banerjee","first_name":"Tamajit"},{"full_name":"Majumdar, Rupak","last_name":"Majumdar","first_name":"Rupak"},{"id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","orcid":"0000-0001-9864-7475","first_name":"Kaushik","last_name":"Mallik","full_name":"Mallik, Kaushik"},{"first_name":"Anne-Kathrin","last_name":"Schmuck","full_name":"Schmuck, Anne-Kathrin"},{"first_name":"Sadegh","last_name":"Soudjani","full_name":"Soudjani, Sadegh"}]}