Derivation of heard-of predicates from elementary behavioral patterns
From MaRDI portal
Recommendations
- The Heard-Of model: computing in distributed systems with benign faults
- A Reduction Theorem for the Verification of Round-Based Distributed Algorithms
- Communication patterns and input patterns in distributed computing (invited talk)
- Structured Derivation of Semi-Synchronous Algorithms
- The perfectly synchronized round-based model of distributed computing
Cites work
- \textsc{PSync}: a partially synchronous language for fault-tolerant distributed algorithms
- A characterization of oblivious message adversaries for which consensus is solvable
- Approximate consensus in highly dynamic networks: the role of averaging algorithms
- Characterizing asynchronous message-passing models through rounds
- Cutoff bounds for consensus algorithms
- Decomposition of distributed programs into communication-closed layers
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- scientific article; zbMATH DE number 7407798 (Why is no real title available?)
- Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
- The Heard-Of model: computing in distributed systems with benign faults
- Time is not a healer (preliminary version)
- Topological Characterization of Consensus under General Message Adversaries
Cited in
(2)
This page was built for publication: Derivation of heard-of predicates from elementary behavioral patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041279)