A Combinatorial Characterization of Self-stabilizing Population Protocols

DOI10.1007/978-3-030-64348-5_13MaRDI QIDQ6487904zbMATH OpenFDO

Authors Rafail Ostrovsky

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-64348-5_13

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A combinatorial characterization of self-stabilizing population protocols
• How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
• Self-stabilization with path algebra
• The computational power of population protocols
• Realization of periodic functions by self-stabilizing population protocols with synchronous handshakes

Cited in

(6)

• Realization of periodic functions by self-stabilizing population protocols with synchronous handshakes
• A combinatorial characterization of self-stabilizing population protocols
• Stably Computing Order Statistics with Arithmetic Population Protocols
• The Power of Global Knowledge on Self-stabilizing Population Protocols
• Constructing Self-stabilizing Oscillators in Population Protocols
• A self-stabilizing transformer for population protocols with covering

This page was built for publication: A Combinatorial Characterization of Self-stabilizing Population Protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487904)