Permutation Games for the Weakly Aconjunctive $\mu$-Calculus

Daniel Hausmann, Lutz Schröder, Hans-Peter Deifel

We introduce a natural notion of limit-deterministic parity automata and present a method that uses such automata to construct satisfiability games for the weakly aconjunctive frag…