Derivation of Heard-of Predicates from Elementary Behavioral Patterns
From MaRDI portal
Publication:5041279
DOI10.1007/978-3-030-50086-3_8OpenAlexW3037081047MaRDI QIDQ5041279
Adam Shimi, Philippe Quéinnec, Aurélie Hurault
Publication date: 13 October 2022
Published in: Formal Techniques for Distributed Objects, Components, and Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.10619
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Decomposition of distributed programs into communication-closed layers
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- Cutoff bounds for consensus algorithms
- A characterization of oblivious message adversaries for which consensus is solvable
- The Heard-Of model: computing in distributed systems with benign faults
- Round-by-round fault detectors (extended abstract)
- PSync: a partially synchronous language for fault-tolerant distributed algorithms
- Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
- Time is not a healer
- Topological Characterization of Consensus under General Message Adversaries
This page was built for publication: Derivation of Heard-of Predicates from Elementary Behavioral Patterns