34 citations · 78 across the 22 of their papers we have counts for
27 papers
On Parameterized Verification Over Tree Topologies
Romain Delpy, Anca Muscholl, Grégoire Sutre
Parameterized verification of finite-state processes with rendez-vous synchronization is notoriously undecidable when processes are linearly ordered. In this paper we study two kin…
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…
An automata-based approach for synchronizable mailbox communication
Romain Delpy, Anca Muscholl, Grégoire Sutre
We revisit finite-state communicating systems with round-based communication under mailbox semantics. Mailboxes correspond to one FIFO buffer per process (instead of one buffer per…
Finite-valued Streaming String Transducers
Emmanuel Filiot, Ismaël Jecker, Christof Löding +3
A transducer is finite-valued if for some bound k, it maps any given input to at most k outputs. For classical, one-way transducers, it is known since the 80s that finite valuednes…
Model-checking parametric lock-sharing systems against regular constraints
Corto Mascle, Anca Muscholl, Igor Walukiewicz
In parametric lock-sharing systems processes can spawn new processes to run in parallel, and can create new locks. The behavior of every process is given by a pushdown automaton. W…
Distributed controller synthesis for deadlock avoidance
Hugo Gimbert, Corto Mascle, Anca Muscholl +1
We consider the distributed control synthesis problem for systems with locks. The goal is to find local controllers so that the global system does not deadlock. With no restriction…