Verification of Randomized Consensus Algorithms under Round-Rigid Adversaries

Nathalie Bertrand 1 Igor Konnov 2 Marijana Lazic 3 Josef Widder 4
1 SUMO - SUpervision of large MOdular and distributed systems
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
2 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
MPII - Max-Planck-Institut für Informatik, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Document type :
Conference papers
Complete list of metadatas

Cited literature [3 references]  Display  Hide  Download

https://hal.inria.fr/hal-02191348
Contributor : Nathalie Bertrand <>
Submitted on : Tuesday, July 23, 2019 - 2:31:23 PM
Last modification on : Thursday, September 19, 2019 - 12:56:52 PM

File

main.pdf
Files produced by the author(s)

Identifiers

Citation

Nathalie Bertrand, Igor Konnov, Marijana Lazic, Josef Widder. Verification of Randomized Consensus Algorithms under Round-Rigid Adversaries. CONCUR 2019 - 30th International Conference on Concurrency Theory, Aug 2019, Amsterdam, Netherlands. pp.1-16, ⟨10.4230/LIPIcs.CONCUR.2019.33⟩. ⟨hal-02191348⟩

Share

Metrics

Record views

38

Files downloads

521