An exercise in proving self-stabilization with a variant function
Information Processing Letters
Parallel program design: a foundation
Parallel program design: a foundation
ACM Computing Surveys (CSUR)
Self-stabilization
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
Distributed Algorithms
Exploitation of Ljapunov Theory for Verifying Self-Stabilizing Algorithms
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
An exercise in proving convergence through transfer functions
ICDCS '99 Workshop on Self-stabilizing Systems
Convex Optimization
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Dependability Engineering of Silent Self-stabilizing Systems
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
r-semi-groups: a generic approach for designing stabilizing silent tasks
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
The verification of the self-stabilization property of a distributed algorithm is a complicated task. By exploiting certain analogies between self-stabilizing distributed algorithms and globally asymptotically stable feedback systems, techniques originally developed for the verification of feedback system stability can be adopted for the verification of self-stabilization of distributed algorithms. In this paper, we show how for a certain subclass of dynamic systems – namely piecewise affine hybrid systems – and distributed algorithms suitable to be modeled in terms of these dynamic systems, a proof of convergence can be obtain fully automatically. Together with some additional non-automated arguments, the complete proof of self-stabilization can be derived.