Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games

详细信息    查看全文

• 刊名：Lecture Notes in Computer Science
• 出版年：2017
• 出版时间：2017
• 年：2017
• 卷：10145
• 期：1
• 页码：266-287
• 丛书名：Verification, Model Checking, and Abstract Interpretation
• ISBN：978-3-319-52234-0
• 卷排序：10145

文摘

2.5 player parity games combine the challenges posed by 2.5 player reachability games and the qualitative analysis of parity games. These two types of problems are best approached with different types of algorithms: strategy improvement algorithms for 2.5 player reachability games and recursive algorithms for the qualitative analysis of parity games. We present a method that—in contrast to existing techniques—tackles both aspects with the best suited approach and works exclusively on the 2.5 player game itself. The resulting technique is powerful enough to handle games with several million states.