A belated proof of self-stabilization
Distributed Computing
An exercise in proving self-stabilization with a variant function
Information Processing Letters
Uniform self-stabilizing rings
ACM Transactions on Programming Languages and Systems (TOPLAS)
Minimal and complete word unification
Journal of the ACM (JACM)
Memory-efficient self stabilizing protocols for general networks
Proceedings of the 4th international workshop on Distributed algorithms
Handbook of theoretical computer science (vol. B)
IEEE Transactions on Software Engineering
String-rewriting systems
A self-stabilizing algorithm for maximal matching
Information Processing Letters
Adaptivity through distributed convergence
Adaptivity through distributed convergence
ACM Computing Surveys (CSUR)
An alternative solution to a problem on self-stabilization
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing with graph rewriting systems with priorities
Theoretical Computer Science
Introduction to distributed algorithms
Introduction to distributed algorithms
On the recognition of families of graphs with local computations
Information and Computation
A self-stabilizing leader election algorithm for tree graphs
Journal of Parallel and Distributed Computing
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
Journal of the ACM (JACM)
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Uniform Deterministic Self-Stabilizing Ring-Orientation on Odd-Length Rings
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Termination of Linear Rewriting Systems (Preliminary Version)
Proceedings of the 8th Colloquium on Automata, Languages and Programming
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Symbolic Model Checking with Rich ssertional Languages
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
The Triumph and Tribulation of System Stabilization
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
An exercise in proving convergence through transfer functions
ICDCS '99 Workshop on Self-stabilizing Systems
Self-stabilizing extensions for message-passing systems
Distributed Computing - Special issue: Self-stabilization
Proving Self-Stabilization with a Proof Assistant
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Unavoidable Configurations of Parameterized Rings of Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
| Hi-index | 0.00 |
In the framework of self-stabilizing systems, the convergence proof is generally done by exhibiting a measure that strictly decreases until a legitimate configuration is reached. The discovery of such a measure is very specific and requires a deep understanding of the studied transition system. In contrast we propose here a simple method for proving convergence, which regards self-stabilizing systems as string rewrite systems, and adapts a procedure initially designed by Dershowitz for proving termination of string rewrite systems. In order to make the method terminate more often, we also propose an adapted procedure that manipulates "schemes", i.e. regular sets of words, and incorporates a process of scheme generalization. The interest of the method is illustrated on several nontrivial examples.