An exercise in proving self-stabilization with a variant function
From MaRDI portal
Publication:1115172
DOI10.1016/0020-0190(88)90131-7zbMath0663.68010OpenAlexW1970730976MaRDI QIDQ1115172
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
Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25) Theory of software (68N99)
Related Items
A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph ⋮ A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM ⋮ Tiara: a self-stabilizing deterministic skip list and skip 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 ⋮ Self-stabilizing token circulation in uniform networks ⋮ Proving convergence of self-stabilizing systems using first-order rewriting and regular languages ⋮ A self-stabilizing algorithm for constructing spanning trees ⋮ A self-stabilizing algorithm for constructing breadth-first trees ⋮ A self-stabilizing algorithm for maximal matching ⋮ On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms ⋮ A self-stabilizing algorithm for coloring bipartite graphs ⋮ Monotonic self-stabilization and its application to robust and adaptive pattern formation ⋮ A self-stabilizing distributed algorithm to find the median of a tree graph ⋮ A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH ⋮ Self-stabilizing depth-first token circulation on networks ⋮ Self-stabilizing local \(k\)-placement of replicas with local minimum variance
Cites Work
This page was built for publication: An exercise in proving self-stabilization with a variant function
