activity
20232026
most citedDistribution of Reconfiguration Languages maintaining Tree-like Communication Topology

1 citations · 1 across the 5 of their papers we have counts for

collaborators
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.LO2026

Symbolic Synthesis for LTLf+ Obligations

Giuseppe De Giacomo, Christian Hagemeier, Daniel Hausmann +1

We study synthesis for obligation properties expressed in LTLfp, the extension of LTLf to infinite traces. Obligation properties are positive Boolean combinations of safety and gua…