The Heard-Of model: computing in distributed systems with benign faults

DOI10.1007/s00446-009-0084-6zbMath1267.68151MaRDI QIDQ2377130

André Schiper, Bernadette Charron-Bost

Publication date: 28 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: http://infoscience.epfl.ch/record/159550

zbMATH Keywords

computational model; consensus; benign fault; HO (Heard-Of) model; transmission fault

Mathematics Subject Classification ID

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

68M15: Reliability, testing and fault tolerance of networks and computer systems

Related Items

Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Back to the Coordinated Attack Problem, Derivation of Heard-of Predicates from Elementary Behavioral Patterns, Reachability in Parameterized Systems: All Flavors of Threshold Automata, Untangling Partial Agreement: Iterated x-consensus Simulations, Characterizing Consensus in the Heard-Of Model, Fast Multidimensional Asymptotic and Approximate Consensus, A topological perspective on distributed network algorithms, Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker, Asynchronous Byzantine reliable broadcast with a message adversary, Communication pattern logic: epistemic and topological views, Blockchain in dynamic networks, Power and limits of distributed computing shared memory models, On the performance of a retransmission-based synchronizer, On the impact of link faults on Byzantine agreement, A simple characterization of asynchronous computations, Consensus when all processes may be Byzantine for some time, Verification of consensus algorithms using satisfiability solving, Randomization can be a healer: consensus with dynamic omission failures, Synchronous consensus under hybrid process and link failures, In search of lost time, Cardinality constraints for arrays (decidability results and applications), Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks, Booting clock synchronization in partially synchronous systems with hybrid process and link failures, MinMax algorithms for stabilizing consensus, Consensus in rooted dynamic networks with short-lived stability, A modular framework for verifying versatile distributed systems, Higher-order quantifier elimination, counter simulations and fault-tolerant systems, Making Byzantine consensus live, Synthesis in presence of dynamic links, Synchronization modulo \(P\) in dynamic networks, Valency-based consensus under message adversaries without limit-closure, Fault-tolerant multiparty session types, On the radius of nonsplit graphs and information dissemination in dynamic networks, The firing squad problem revisited, A characterization of oblivious message adversaries for which consensus is solvable, Of choices, failures and asynchrony: the many faces of set agreement, Counting Constraints in Flat Array Fragments, A Characterization of Dynamic Networks Where Consensus Is Solvable, Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults, Unnamed Item, Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms, Synthesis of distributed algorithms with parameterized threshold guards, The Firing Squad Problem Revisited., Continuous Consensus with Failures and Recoveries, Bosco: One-Step Byzantine Asynchronous Consensus, Using Bounded Model Checking to Verify Consensus Algorithms, A Reduction Theorem for the Verification of Round-Based Distributed Algorithms

Cites Work