Verifying randomized Byzantine agreement

DOI10.1007/3-540-36135-9_13MaRDI QIDQ4422079zbMATH OpenFDO

Authors Marta Kwiatkowska, Gethin Norman

Publication date 3 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2529/25290194.htm

zbMATH Keywords

Induction and compositional model checkingprobabilistic model checkingrandomized distributed algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12) Distributed systems (68M14)

Recommendations

• Random oracles in constantipole
• Automated verification of a randomized distributed consensus protocol using cadence SMV and PRISM
• Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• On Optimal Probabilistic Asynchronous Byzantine Agreement

Cited in

(10)

• Layered reasoning for randomized distributed algorithms
• Verifying team formation protocols with probabilistic model checking
• Byzantine Agreement Using Partial Authentication
• Non-determinism in Byzantine fault-tolerant replication
• On the composition of authenticated Byzantine Agreement
• scientific article; zbMATH DE number 1154413 (Why is no real title available?)
• Automated verification of a randomized distributed consensus protocol using cadence SMV and PRISM
• Verification of randomized consensus algorithms under round-rigid adversaries
• Verification of consensus algorithms using satisfiability solving
• Quantitative analysis with the probabilistic model checker PRISM

Describes a project that uses

Uses Software

• PRISM

This page was built for publication: Verifying randomized Byzantine agreement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4422079)