3 citations · 5 across the 6 of their papers we have counts for
8 papers
Accountability and Reconfiguration: Self-Healing Lattice Agreement
Luciano Freitas de Souza, Petr Kuznetsov, Thibault Rieutord +1
An accountable distributed system provides means to detect deviations of system components from their expected behavior. It is natural to complement fault detection with a reconfig…
On Finality in Blockchains
Emmanuelle Anceaume, Antonella Pozzo, Thibault Rieutord +1
There exist many forms of Blockchain finality conditions, from deterministic to probabilistic terminations. To favor availability against consistency in the face of partitions, mos…
On Decidability of 2-process Affine Models
Petr Kuznetsov, Thibault Rieutord
An affine model of computation is defined as a subset of iterated immediate-snapshot runs, capturing a wide variety of shared-memory systems, such as wait-freedom, t-resilience, k-…
An Asynchronous Computability Theorem for Fair Adversaries
Petr Kuznetsov, Thibault Rieutord, Yuan He
This paper proposes a simple topological characterization of a large class of fair adversarial models via affine tasks: sub-complexes of the second iteration of the standard chroma…
Reconfigurable Lattice Agreement and Applications
Petr Kuznetsov, Thibault Rieutord, Sara Tucci-Piergiovanni
Reconfiguration is one of the central mechanisms in distributed systems. Due to failures and connectivity disruptions, the very set of service replicas (or servers) and their roles…
Progress-Space Tradeoffs in Single-Writer Memory Implementations
Damien Imbs, Petr Kuznetsov, Thibault Rieutord
Most algorithms designed for shared-memory distributed systems assume the single-writer multi-reader (SWMR) setting where each process is provided with a unique register readable b…
Agreement Functions for Distributed Computing Models
Petr Kuznetsov, Thibault Rieutord
The paper proposes a surprisingly simple characterization of a large class of models of distributed computing, via an agreement function: for each set of processes, the function de…
Read-Write Memory and k-Set Consensus as an Affine Task
Eli Gafni, Yuan He, Petr Kuznetsov +1
The wait-free read-write memory model has been characterized as an iterated \emph{Immediate Snapshot} (IS) task. The IS task is \emph{affine}---it can be defined as a (sub)set of s…