1 citations · 2 across the 4 of their papers we have counts for
10 papers
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…
sweap: Reactive Synthesis for Infinite-State Integer Problems
Shaun Azzopardi, Luca Di Stefano, Nir Piterman
Recent years have seen a significant increase in the interest in reactive synthesis from specifications that relate to infinite state spaces. We present sweap, a tool for synthesis…
Adding Reconfiguration to Zielonka's Asynchronous Automata
Mathieu Lehaut, Nir Piterman
We study an extension of Zielonka's (fixed) asynchronous automata called reconfigurable asynchronous automata where processes can dynamically change who they communicate with. We s…
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…
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…
From Trees to Tree-Like: Distribution and Synthesis for Asynchronous Automata
Mathieu Lehaut, Anca Muscholl, Nir Piterman
We revisit constructions for distribution and synthesis of Zielonka's asynchronous automata in restricted settings. We show first a simple, quadratic, distribution construction for…