54 citations · 74 across the 3 of their papers we have counts for
3 papers
cs.GT2023★ 1 cited
The Worst-Case Complexity of Symmetric Strategy Improvement
Tom van Dijk, Georg Loho, Matthew Maat
Symmetric strategy improvement is an algorithm introduced by Schewe et al. (ICALP 2015) that can be used to solve two-player games on directed graphs such as parity games and mean…
cs.LO2022★ 19 cited
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021
Swen Jacobs, Guillermo A. Perez, Remco Abraham +22
We report on the last four editions of the reactive synthesis competition (SYNTCOMP 2018-2021). We briefly describe the evaluation scheme and the experimental setup of SYNTCOMP. Th…
cs.LO2018★ 54 cited
Oink: an Implementation and Evaluation of Modern Parity Game Solvers
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…