29 citations · 100 across the 39 of their papers we have counts for
45 papers
Self-stabilizing Byzantine-tolerant Recycling
Chryssis Georgiou, Michel Raynal, Elad M. Schiller
Numerous distributed applications, such as cloud computing and distributed ledgers, necessitate the system to invoke asynchronous consensus objects an unbounded number of times, wh…
The Synchronization Power (Consensus Number) of Access-Control Objects: The Case of AllowList and DenyList
Davide Frey, Mathieu Gestin, Michel Raynal
This article studies the synchronization power of AllowList and DenyList objects under the lens provided by Herlihy's consensus hierarchy. It specifies AllowList and DenyList as di…
Self-stabilizing Total-order Broadcast
Oskar Lundström, Michel Raynal, Elad Michael Schiller
The problem of total-order (uniform reliable) broadcast is fundamental in fault-tolerant distributed computing since it abstracts a broad set of problems requiring processes to uni…
Asynchronous Byzantine Reliable Broadcast With a Message Adversary
Timothé Albouy, Davide Frey, Michel Raynal +1
This paper considers the problem of reliable broadcast in asynchronous authenticated systems, in which n processes communicate using signed messages and up to t processes may behav…
Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms
Damien Imbs, Michel Raynal, Gadi Taubenfeld
This article addresses election in fully anonymous systems made up of asynchronous processes that communicate through atomic read-write registers or atomic read-modify-write re…
Self-stabilizing Byzantine Fault-tolerant Repeated Reliable Broadcast
Romaric Duvignau, Michel Raynal, Elad Michael Schiller
We study a well-known communication abstraction called Byzantine Reliable Broadcast (BRB). This abstraction is central in the design and implementation of fault-tolerant distribute…