The part-time parliament
From MaRDI portal
Publication:5133679
DOI10.1145/3335772.3335939zbMath1455.68033OpenAlexW3021428210MaRDI QIDQ5133679
Publication date: 10 November 2020
Published in: Concurrency: the Works of Leslie Lamport (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3335772.3335939
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14)
Related Items (15)
Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker ⋮ Generalized Paxos made Byzantine (and less complex) ⋮ Synchronous consensus with optimal asynchronous fallback guarantees ⋮ Invited paper: Cross-chain state machine replication ⋮ Reaching consensus in the presence of contention-related crash failures ⋮ Practical settlement bounds for longest-chain consensus ⋮ Reachability in Parameterized Systems: All Flavors of Threshold Automata ⋮ Practically stabilizing SWMR atomic memory in message-passing systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fault-Tolerant Consensus with an Abstract MAC Layer. ⋮ Making Byzantine consensus live ⋮ Protocol combinators for modeling, testing, and execution of distributed systems
This page was built for publication: The part-time parliament
