5 citations · 6 across the 4 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.GT2026
Solving Streett and Emerson-Lei Games with Universal Trees
Daniel Hausmann, Marcin Jurdzinski, Nir Piterman
Nearly a decade ago, Calude et al. showed that parity games can be solved in quasi-polynomial time. This result is now understood in terms of universal trees. By reduction to parit…
cs.FL2026★ 1 cited
Fast Obligation Translation and Synthesis
Alexandre Duret-Lutz, Giuseppe De Giacomo, Marcin Jurdzinski +3
Syntactic obligations are a fragment of LTL formulas that translate to deterministic weak -automata (DWA). We show that syntactic obligations can be very efficiently converted t…