A self-stabilizing transformer for population protocols with covering
From MaRDI portal
Publication:555304
DOI10.1016/j.tcs.2010.09.016zbMath1217.68028OpenAlexW2115286071MaRDI QIDQ555304
Janna Burman, Shay Kutten, Joffroy Beauquier
Publication date: 22 July 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.09.016
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14)
Related Items (8)
Population protocols with faulty interactions: the impact of a leader ⋮ Tight complexity analysis of population protocols with cover times -- the ZebraNet example ⋮ Compact routing messages in self-healing trees ⋮ Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks ⋮ Fault-tolerant simulation of population protocols ⋮ Mediated Population Protocols: Leader Election and Applications ⋮ Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits ⋮ Space-efficient self-stabilizing counting population protocols on mobile sensor networks
Cites Work
- Unnamed Item
- Self-stabilizing extensions for message-passing systems
- The local detection paradigm and its applications to self-stabilization
- The computational power of population protocols
- Computation in networks of passively mobile finite-state sensors
- Fast computation by population protocols with a leader
- Fault-containing self-stabilizing algorithms
- Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
- Self-stabilizing systems in spite of distributed control
- Introduction to Distributed Algorithms
- On utilizing speed in networks of mobile agents
- Computation in networks of passively mobile finite-state sensors
This page was built for publication: A self-stabilizing transformer for population protocols with covering
