3 citations · 5 across the 6 of their papers we have counts for
3 papers · 1 filter
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…