1 citations · 1 across the 7 of their papers we have counts for
5 papers · 1 filter
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…
One-clock synthesis problems
Sławomir Lasota, Mathieu Lehaut, Julie Parreaux +1
We study a generalisation of Büchi-Landweber games to the timed setting. The winning condition is specified by a non-deterministic timed automaton, and one of the players can elaps…
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…
Symbolic Solution of Emerson-Lei Games for Reactive Synthesis
Daniel Hausmann, Mathieu Lehaut, Nir Pitermann
Emerson-Lei conditions have recently attracted attention due to their succinctness and compositionality properties. In the current work, we show how infinite-duration games with Em…
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…