Making Population Protocols Self-stabilizing

  • Authors:
  • Joffroy Beauquier;Janna Burman;Shay Kutten

  • Affiliations:
  • University Paris Sud, LRI, UMR 8623, Orsay F-91405;Dept. of Industrial Engineering & Management, Technion, Haifa, Israel 32000;Dept. of Industrial Engineering & Management, Technion, Haifa, Israel 32000

  • Venue:
  • SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Developing self-stabilizing solutions is considered to be more challenging and complicated than developing classical solutions, where a proper initialization of the variables can be assumed. This remark holds for a large variety of models. Hence, to ease the task of the developers, some automatic techniques have been proposed to design self-stabilizing algorithms. In this paper, we propose an automatic transformer for algorithms in population protocols model . This model introduced recently for networks with a large number of resource-limited mobile agents. For our purposes, we use a variant of this model. Mainly, we assume agents having characteristics (e.g., moving speed, communication radius) affecting their intercommunication "speed" and considered through the notion of cover time . The automatic transformer takes as an input an algorithm solving a static problem and outputs a self-stabilizing algorithm for the same problem. We prove that our transformer is correct and we analyze its stabilization complexity.