Simple Fixpoint Iteration To Solve Parity Games
| Autor: | Dijk, Tom van, Rubbens, Bob, Leroux, Jérôme, Raskin, Jean-François |
|---|---|
| Přispěvatelé: | Formal Methods and Tools |
| Jazyk: | angličtina |
| Rok vydání: | 2019 |
| Předmět: |
FOS: Computer and information sciences
Computer Science - Logic in Computer Science Computer Science::Computer Science and Game Theory Theoretical computer science Computer science lcsh:Mathematics Formal equivalence checking D.2.4 Fixed point lcsh:QA1-939 F.4.1 lcsh:QA75.5-76.95 Logic in Computer Science (cs.LO) Parity game Reactive synthesis TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS lcsh:Electronic computers. Computer science Parity (mathematics) Time complexity |
| Zdroj: | Electronic Proceedings in Theoretical Computer Science, Vol 305, Iss Proc. GandALF 2019, Pp 123-139 (2019) Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2019: Bordeaux, France, 2-3rd September 2019, 123-139 STARTPAGE=123;ENDPAGE=139;TITLE=Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2019 |
| ISSN: | 2075-2180 |
| Popis: | A naive way to solve the model-checking problem of the mu-calculus uses fixpoint iteration. Traditionally however mu-calculus model-checking is solved by a reduction in linear time to a parity game, which is then solved using one of the many algorithms for parity games. We now consider a method of solving parity games by means of a naive fixpoint iteration. Several fixpoint algorithms for parity games have been proposed in the literature. In this work, we introduce an algorithm that relies on the notion of a distraction. The idea is that this offers a novel perspective for understanding parity games. We then show that this algorithm is in fact identical to two earlier published fixpoint algorithms for parity games and thus that these earlier algorithms are the same. Furthermore, we modify our algorithm to only partially recompute deeper fixpoints after updating a higher set and show that this modification enables a simple method to obtain winning strategies. We show that the resulting algorithm is simple to implement and offers good performance on practical parity games. We empirically demonstrate this using games derived from model-checking, equivalence checking and reactive synthesis and show that our fixpoint algorithm is the fastest solution for model-checking games. In Proceedings GandALF 2019, arXiv:1909.05979 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|