29 citations · 100 across the 39 of their papers we have counts for
5 papers · 2 filters
Self-stabilizing Byzantine- and Intrusion-tolerant Consensus
Romaric Duvignau, Michel Raynal, Elad Michael Schiller
One of the most celebrated problems of fault-tolerant distributed computing is the consensus problem. It was shown to abstract a myriad of problems in which processes have to agree…
Leader Election in Arbitrarily Connected Networks with Process Crashes and Weak Channel Reliability
Carlos López, Sergio Rajsbaum, Michel Raynal +1
A channel from a process p to a process q satisfies the ADD property if there are constants K and D, unknown to the processes, such that in any sequence of K consecutive messages s…
Self-stabilizing Multivalued Consensus in Asynchronous Crash-prone Systems
Oskar Lundström, Michel Raynal, Elad Michael Schiller
The problem of multivalued consensus is fundamental in the area of fault-tolerant distributed computing since it abstracts a very broad set of agreement problems in which processes…
Byzantine-tolerant Distributed Grow-only Sets: Specification and Applications
Vicent Cholvi, Antonio Fernández Anta, Chryssis Georgiou +3
In order to formalize Distributed Ledger Technologies and their interconnections, a recent line of research work has formulated the notion of Distributed Ledger Object (DLO), which…
Loosely-self-stabilizing Byzantine-tolerant Binary Consensus for Signature-free Message-passing Systems
Chryssis Georgiou, Ioannis Marcoullis, Michel Raynal +1
At PODC 2014, A. Mostéfaoui, H. Moumen, and M. Raynal presented a new and simple randomized signature-free binary consensus algorithm (denoted here MMR) that copes with the net eff…