Parameterized model checking is the problem of deciding if a given formula holds
irrespective of the number of participating processes. A standard approach for solving the …

Structural Invariants for the Verification of Systems with Parameterized Architectures Page 1
Structural Invariants for the Verification of Systems with Parameterized Architectures Marius …

We study the almost-sure reachability problem in a distributed system obtained as the
asynchronous composition of N copies (called processes) of the same automaton (called …

Fault-tolerant distributed algorithms play an increasingly important role in many applications,
and their correct and efficient implementation is notoriously difficult. We present an …

Threshold automata are a computational model that has proven to be versatile in modeling
threshold-based distributed algorithms and enabling their completely automatic …

The last decade has sparked several valiant efforts in deductive verification of distributed
agreement protocols such as consensus and leader election. Oddly, there have been far …

Inspired by distributed applications that use consensus or other agreement protocols for
global coordination, we define a new computational model for parameterized systems that is …

We study cutoff results for parameterized verification and synthesis of guarded protocols, as
introduced by Emerson and Kahlon (2000). Guarded protocols describe systems of …

The problem of learning a computational model from examples has been receiving growing
attention. For the particularly challenging problem of learning models of distributed systems …

We propose an automated method for computing inductive invariants used to proving
deadlock freedom of parametric component-based systems. The method generalizes the …