Generating a Family of Byzantine Tolerant Protocol Implementations Using a Meta-Model Architecture

2010/06/17 by Graham Kirby, Kirby, Graham, Alan Dearle +3
Computer Science · Engineering · #Distributed #Distributed systems and fault tolerance #FOS: Computer and information sciences #Modular Robots and Swarm Intelligence #Parallel #Security and Verification in Computing #and Cluster Computing (cs.DC)

paper · pdf · doi:10.48550/arxiv.1006.3452

openalex publication_date 2010/06/17 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/01

Abstract

We describe an approach to modelling a Byzantine tolerant distributed algorithm as a family of related finite state machines, generated from a single meta-model. Various artefacts are generated from each state machine, including diagrams and source-level protocol implementations. The approach allows a state machine formulation to be applied to problems for which it would not otherwise be suitable, increasing confidence in correctness.

Related

• Counter Attack on Byzantine Generals: Parameterized Model Checking of Fault-tolerant Distributed Algorithms
• Boosting Byzantine Protocols in Large Sparse Networks with High System Assumption Coverage
• Cross-Chain State Machine Replication
• Efficient Synchronous Byzantine Consensus
• Alea-BFT: Practical Asynchronous Byzantine Fault Tolerance