Population protocols with unreliable communication

DOI10.1007/978-3-030-89240-1_10zbMath1498.68035arXiv1902.10041OpenAlexW3209137069MaRDI QIDQ2148893

Mikhail Raskin

Publication date: 24 June 2022

Full work available at URL: https://arxiv.org/abs/1902.10041

zbMATH Keywords

expressive powerpopulation protocolsmessage loss

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Related Items (1)

Protocols with constant local storage and unreliable communication

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mediated population protocols
• Passively mobile communicating machines that use restricted space
• Appraising fairness in languages for distributed programming
• Population protocols with faulty interactions: the impact of a leader
• The computational power of population protocols
• The complexity of verifying population protocols
• Computation in networks of passively mobile finite-state sensors
• A Simple Population Protocol for Fast Robust Approximate Majority
• Fast Computation by Population Protocols with a Leader
• Self-stabilizing systems in spite of distributed control
• Verification of Immediate Observation Population Protocols
• Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
• Computation in networks of passively mobile finite-state sensors
• Stable leader election in population protocols requires linear time
• Parameterized Analysis of Immediate Observation Petri Nets

This page was built for publication: Population protocols with unreliable communication