Self-stabilizing systems in spite of distributed control

  title={Self-stabilizing systems in spite of distributed control},
  author={E. Dijkstra},
  journal={Commun. ACM},
  • E. Dijkstra
  • Published 1974
  • Computer Science, Mathematics
  • Commun. ACM
  • The synchronization task between loosely coupled cyclic sequential processes (as can be distinguished in, for instance, operating systems) can be viewed as keeping the relation “the system is in a legitimate state” invariant. As a result, each individual process step that could possibly cause violation of that relation has to be preceded by a test deciding whether the process in question is allowed to proceed or has to be delayed. The resulting design is readily—and quite systematically… CONTINUE READING
    2,197 Citations

    Topics from this paper.

    1-1-1994 Self-stabilizing routing protocols
    Automated Synthesis of Distributed Self-Stabilizing Protocols
    • 1
    • Highly Influenced
    • PDF
    Automated Synthesis of Timed and Distributed Fault-Tolerant Systems
    Computing the Stabilization Times of Self-Stabilizing Systems
    • 7
    • Highly Influenced
    • PDF
    Performance Evaluation of Self-stabilizing Algorithms by Probabilistic Model Checking
    Self-Stabilizing ℓ-Exclusion Revisited
    • 1
    • Highly Influenced
    Specification-Based Synthesis of Distributed Self-Stabilizing Protocols
    • 11
    • Highly Influenced
    • PDF
    A Fault-Tolerant Token Passing Algorithm onTree
    A Latency Optimal Superstabilizing Mutual Exclusion Protocol in Unidirectional Rings
    • 17
    • Highly Influenced