Context: Championed by IBM's vision of autonomic computing paper in 2003, the autonomic
computing research field has seen increased research activity over the last 20 years …

LCLs or locally checkable labelling problems (eg maximal independent set, maximal
matching, and vertex colouring) in the LOCAL model of computation are very well …

Consider a computer network that consists of a path with n nodes. The nodes are labeled
with inputs from a constant-sized set, and the task is to find output labels from a constant …

Fault-tolerant distributed algorithms are notoriously hard to get right. In this paper we
introduce an automated method that helps in that process: the designer provides …

We propose a general framework to build certified proofs of distributed self-stabilizing
algorithms with the proof assistant Coq. We first define in Coq the locally shared memory …

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 …

Methods from stochastic dynamical systems theory have been instrumental in understanding
the behaviours of chemical reaction networks (CRNs) arising in natural systems. However …

This work describes an approach for synthesizing state-feedback controllers for discrete-
time systems, taking into account performance aspects. The proposed methodology is based …

This paper investigates the problem of synthesizing parameterized rings that are “self-
stabilizing by construction”. While it is known that the verification of self-stabilization for …