Skip to Main content Skip to Navigation
Conference papers

Verification of Randomized Consensus Algorithms under Round-Rigid Adversaries

Nathalie Bertrand 1 Igor Konnov 2, 3 Marijana Lazic 4 Josef Widder 5
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
3 MOSEL - Proof-oriented development of computer-based systems
LORIA - FM - Department of Formal Methods
Document type :
Conference papers
Complete list of metadata

Cited literature [3 references]  Display  Hide  Download

https://hal.inria.fr/hal-02191348
Contributor : Nathalie Bertrand Connect in order to contact the contributor
Submitted on : Tuesday, July 23, 2019 - 2:31:23 PM
Last modification on : Wednesday, November 3, 2021 - 8:08:34 AM

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

136

Files downloads

914