Fault-tolerant simulation of population protocols
From MaRDI portal
Publication:2220403
DOI10.1007/s00446-020-00377-0zbMath1497.68041arXiv1610.09435OpenAlexW3018780942MaRDI QIDQ2220403
Giovanni Viglietta, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Paola Flocchini, Giuseppe Antonio Di Luna
Publication date: 22 January 2021
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.09435
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Unnamed Item
- A simple population protocol for fast robust approximate majority
- Mediated population protocols
- A self-stabilizing transformer for population protocols with covering
- Passively mobile communicating machines that use restricted space
- How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
- On the convergence of population protocols when population goes to infinity
- Population protocols with faulty interactions: the impact of a leader
- Space-optimal counting in population protocols
- The computational power of population protocols
- Computation in networks of passively mobile finite-state sensors
- Fast computation by population protocols with a leader
- Fast and Exact Majority in Population Protocols
- Mediated Population Protocols: Leader Election and Applications
- Polylogarithmic-Time Leader Election in Population Protocols
- The Dynamics of Probabilistic Population Protocols
- All Symmetric Predicates in NSPACE(n 2) Are Stably Computable by the Mediated Population Protocol Model
- Stably computable predicates are semilinear
- Brief Announcement
- Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
- Speed Faults in Computation by Chemical Reaction Networks
This page was built for publication: Fault-tolerant simulation of population protocols
