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
LORIA - FM - Department of Formal Methods , Inria Nancy - Grand Est, MPII - Max-Planck-Institut für Informatik
3 TUM - Technische Universität München [München]
4 TU Wien - Technische Universität Wien
Keywords : Byzantine faults randomized distributed algorithms parameterized verification counter systems threshold automata
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, October 17, 2019 - 11:36:06 AM

File

main.pdf
Files produced by the author(s)

Identifiers

Collections

UNIV-RENNES1 | CNRS | UNIV-LORRAINE | LORIA | LORIA-FM | CENTRALESUPELEC | IRISA | INRIA | UNIV-RENNES | UR1-UFR-ISTIC | GRID5000

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

49

Files downloads

609

 

 

Contact

archive-ouverte@inria.fr