An exercise in proving self-stabilization with a variant function

DOI10.1016/0020-0190(88)90131-7zbMath0663.68010MaRDI QIDQ1115172

Joep L. W. Kessels

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90131-7

zbMATH Keywords

self-stabilization; distributed processing; token passing; bound function; variant function

Mathematics Subject Classification ID

68Q60: Specification and verification (program logics, model checking, etc.)

68N25: Theory of operating systems

68N99: Theory of software

Related Items

A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM, Self-stabilizing token circulation in uniform networks, Proving convergence of self-stabilizing systems using first-order rewriting and regular languages, Tiara: a self-stabilizing deterministic skip list and skip graph, On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms, A self-stabilizing algorithm for constructing spanning trees, A self-stabilizing algorithm for constructing breadth-first trees, A self-stabilizing algorithm for maximal matching, A self-stabilizing distributed algorithm to find the median of a tree graph, Self-stabilizing depth-first token circulation on networks, A self-stabilizing algorithm for coloring bipartite graphs, A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph, Self-stabilizing local \(k\)-placement of replicas with local minimum variance, A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH, On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion, A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring

Cites Work

• A belated proof of self-stabilization
• Self-stabilizing systems in spite of distributed control
• Unnamed Item