3 citations · 4 across the 2 of their papers we have counts for
5 papers · 1 filter
Symbolic Parity Game Solvers that Yield Winning Strategies
Oebele Lijzenga, Tom van Dijk
Parity games play an important role for LTL synthesis as evidenced by recent breakthroughs on LTL synthesis, which rely in part on parity game solving. Yet state space explosion re…
Simple Fixpoint Iteration To Solve Parity Games
Tom van Dijk, Bob Rubbens
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…
A Parity Game Tale of Two Counters
Tom van Dijk
Parity games are simple infinite games played on finite graphs with a winning condition that is expressive enough to capture nested least and greatest fixpoints. Through their tigh…
Revisiting Decision Diagrams for SAT
Tom van Dijk, Rüdiger Ehlers, Armin Biere
Symbolic variants of clause distribution using decision diagrams to eliminate variables in SAT were shown to perform well on hard combinatorial instances. In this paper we revisit…
Attracting Tangles to Solve Parity Games
Tom van Dijk
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 inte…