A belated proof of self-stabilization
type: Item
instance of: scholarly article
title: A belated proof of self-stabilization
zbMATH Open document ID: 0604.68015
DOI: 10.1007/BF01843566
published in: Distributed Computing
publication date: 1986-01-01T00:00:00Z
review text: A self-stabilizing system is one that, independently of its initial state, will exhibit its desired behaviour after a finite number of steps. As such, self-stabilization can be viewed as the ultimate form of error recovery. In 1973, the problem was posed and solved by the author for the case of a distributed solution to the mutual exclusion problem; his solutions were published without a proof of their correctness. For the correctness of his nicest solution, the author has now supplied an elegant argument. The paper is of commendable brevity.
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 3976301
zbMATH Keywords: proof of program correctness
zbMATH Keywords: self-stabilizing system
zbMATH Keywords: error recovery
zbMATH Keywords: mutual exclusion problem
MaRDI profile type: Publication
cites work: Self-stabilizing systems in spite of distributed control
Recommended article: An exercise in proving self-stabilization with a variant function
Recommended article: The instability of self-stabilization
Recommended article: Self-stabilization with r-operators
Recommended article: Self-stabilization
Recommended article: Self-stabilization with r-Operators Revisited
Recommended article: Self-stabilizing systems in spite of high dynamics
Recommended article: Stochastic self-stabilization
Recommended article: Some comments on stabilizability
author: Edsger W. Dijkstra
description: scientific article; zbMATH DE number 3976301