1 citations · 1 across the 5 of their papers we have counts for
6 papers
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…
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…
Emerson-Lei and Manna-Pnueli Games for LTLf+ and PPLTL+ Synthesis
Daniel Hausmann, Shufang Zhu, Gianmarco Parretti +3
Recently, the Manna-Pnueli Hierarchy has been used to define the temporal logics LTLfp and PPLTLp, which allow to use finite-trace LTLf/PPLTL techniques in infinite-trace settings…
Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology
Daniel Hausmann, Mathieu Lehaut, Nir Piterman
We study how to distribute trace languages in a setting where processes communicate via reconfigurable communication channels. That is, the different processes can connect and disc…
Faster and Smaller Solutions of Obliging Games
Daniel Hausmann, Nir Piterman
Obliging games have been introduced in the context of the game perspective on reactive synthesis in order to enforce a degree of cooperation between the to-be-synthesized system an…
Doubly Fair Parity Games
Daniel Hausmann, Nir Piterman, Irmak Sağlam +1
We consider two-player games over finite graphs in which both players are restricted by fairness constraints on their moves. Given a two player game graph and a set of fa…