Computing Time Complexity of Population Protocols with Cover Times - The ZebraNet Example

Joffroy Beauquier, Peva Blanchard, Janna Burman, Sylvie Delaët. Computing Time Complexity of Population Protocols with Cover Times - The ZebraNet Example. In Xavier Défago, Franck Petit, Vincent Villain, editors, Stabilization, Safety, and Security of Distributed Systems - 13th International Symposium, SSS 2011, Grenoble, France, October 10-12, 2011. Proceedings. Volume 6976 of Lecture Notes in Computer Science, pages 47-61, Springer, 2011. [doi]

Abstract

Abstract is missing.