activity
20052023
most citedBetter abstractions for timed automata

35 citations · 151 across the 21 of their papers we have counts for

collaborators

27 papers

cs.LO2023

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…

cs.LO2022

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…

cs.LO2021

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…

cs.LO2020

Characterizing consensus in the Heard-Of model

A. R. Balasubramanian, Igor Walukiewicz

The Heard-Of model is a simple and relatively expressive model of distributed computation. Because of this, it has gained a considerable attention of the verification community. We…

cs.LO2019

Revisiting local time semantics for networks of timed automata

R. Govind, Frédéric Herbreteau, B. Srivathsan +1

We investigate a zone based approach for the reachability problem in timed automata. The challenge is to alleviate the size explosion of the search space when considering networks…

cs.LO2017

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…