Distributed Computing

, Volume 7, Issue 1, pp 17–26

Self-stabilizing extensions for meassage-passing systems

  • Shmuel Katz
  • Kenneth J. Perry
Special Issue on Self-stabilization

DOI: 10.1007/BF02278852

Cite this article as:
Katz, S. & Perry, K.J. Distrib Comput (1993) 7: 17. doi:10.1007/BF02278852

Summary

A self-stabilizing program eventually resumes normal behavior even if excution begins in, an abnormal initial state. In this paper, we explore the possibility of extending an arbitrary program into a self-stabilizing one. Our contributions are: (1) a formal definition of the concept of one program being aself-stabilizing extension of another; (2) a characterization of what properties may hold in such extensions; (3) a demonstration of the possibility of mechanically creating such extensions. The computtional model used is that of an asynchronous distributed message-passing system whose communication topology is an arbitrary graph. We contrast the difficulties of self-stabilization in thismodel with those of themore common shared-memory models.

Key words

Self-stabilizationMessage-passingSuperimposition

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Shmuel Katz
    • 1
  • Kenneth J. Perry
    • 2
  1. 1.Israel Institute of TechnologyTechnionHaifaIsrael
  2. 2.IBM ResearchYorktown HeigtsUSA