34 citations · 78 across the 22 of their papers we have counts for
10 papers · 1 filter
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…
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…
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…
Active Learning for Sound Negotiations
Anca Muscholl, Igor Walukiewicz
We present two active learning algorithms for sound deterministic negotiations. Sound deterministic negotiations are models of distributed systems, a kind of Petri nets or Zielonka…
Static Analysis of Deterministic Negotiations
Javier Esparza, Anca Muscholl, Igor Walukiewicz
Negotiation diagrams are a model of concurrent computation akin to workflow Petri nets. Deterministic negotiation diagrams, equivalent to the much studied and used free-choice work…