A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Attracting Tangles to Solve Parity Games
[chapter]
2018
Lecture Notes in Computer Science
Parity games have important practical applications in formal verification and synthesis, especially to solve the model-checking problem of the modal mu-calculus. They are also interesting from the theory perspective, because they are widely believed to admit a polynomial solution, but so far no such algorithm is known. We propose a new algorithm to solve parity games based on learning tangles, which are strongly connected subgraphs for which one player has a strategy to win all cycles in the
doi:10.1007/978-3-319-96142-2_14
fatcat:4qq7sijjwfck5jxnusrkjiekrm