A belated proof of self-stabilization
From MaRDI portal
Publication:1083187
DOI10.1007/BF01843566zbMath0604.68015MaRDI QIDQ1083187
No author found.
Publication date: 1986
Published in: Distributed Computing (Search for Journal in Brave)
Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)
Related Items (40)
Reliable synchronization in distributed systems ⋮ SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE ⋮ SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS ⋮ A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph ⋮ On distributed snapshots ⋮ A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM ⋮ An exercise in proving self-stabilization with a variant function ⋮ Self-stabilizing algorithms for minimal dominating sets and maximal independent sets ⋮ On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion ⋮ An efficient fault-containing self-stabilizing algorithm for the shortest path problem ⋮ 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 ⋮ Binary self-stabilization in distributed systems ⋮ A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model ⋮ A self-stabilizing algorithm for constructing breadth-first trees ⋮ SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS ⋮ A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets ⋮ Game theoretic analysis of self-stabilizing systems on arrays ⋮ SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS ⋮ A self-stabilizing algorithm for maximal matching ⋮ A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity ⋮ SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS ⋮ A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity ⋮ On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms ⋮ A self-stabilizing algorithm for coloring bipartite graphs ⋮ Self-Stabilizing Domination Algorithms ⋮ Parameterized synthesis of self-stabilizing protocols in symmetric networks ⋮ Parameterized Synthesis of Self-Stabilizing Protocols in Symmetric Rings ⋮ Unnamed Item ⋮ Quasi-self-stabilization of a distributed system assuming read/write atomicity ⋮ A self-stabilizing algorithm which finds a 2-center of a tree ⋮ 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-stabilization of dynamic systems assuming only read/write atomicity ⋮ A self-stabilizing algorithm for coloring planar graphs ⋮ Self-stabilizing depth-first token circulation on networks ⋮ A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph ⋮ A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
Cites Work
This page was built for publication: A belated proof of self-stabilization
