An Exercise in Proving Self-Stabilization through Ljapunov Functions

Authors:
Affiliations:
Venue:
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Year:
2001

Citing 6
Cited 1

The mutual exclusion problem: partII—statement and solutions

Journal of the ACM (JACM)
An exercise in proving self-stabilization with a variant function

Information Processing Letters
Self-stabilization

ACM Computing Surveys (CSUR)
Introduction to distributed algorithms

Introduction to distributed algorithms
Guarded commands, nondeterminacy and formal derivation of programs

Communications of the ACM
Self-stabilizing systems in spite of distributed control

Communications of the ACM

Lyapunov analysis of neural network stability in an adaptive flight control system

SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: Self-Stabilizing distributed algorithms exhibit interesting analogies with stabilizing feedback systems used in various engineering domains. In this paper we show by Dijkstra's famous token ring algorithm for mutual exclusion serving as an example that methodologies from control theory, namely Ljapunov's "Second Method," can be used to more easily and systematically prove the self-stabilization property of distributed algorithms.