Self-stabilizing systems in spite of distributed control
From MaRDI portal
Publication:4061976
DOI10.1145/361179.361202zbMath0305.68048OpenAlexW2111132249WikidataQ55899050 ScholiaQ55899050MaRDI QIDQ4061976
Publication date: 1974
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/361179.361202
Related Items
Existence of home states in Petri nets is decidable, The expressive power of snap-stabilization, Competitive self-stabilizing \(k\)-clustering, HEX: scaling honeycombs is easier than scaling clock trees, Amorphous computing: examples, mathematics and theory, A belated proof of self-stabilization, Multitolerant barrier synchronization, Magnifying computing gaps. Establishing encrypted communication over unidirectional channels, Four-state stabilizing phase clock for unidirectional rings of odd size, Alternators in read/write atomicity, Randomized uniform self-stabilizing mutual exclusion, A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems, An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity, On the costs of self-stabilization, The TTA's approach to resilience after transient upsets, On distributed snapshots, Synthesis of large dynamic concurrent programs from dynamic specifications, An exercise in proving self-stabilization with a variant function, Distributed minimum dominating set approximations in restricted families of graphs, Self-stabilizing algorithms for minimal dominating sets and maximal independent sets, A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees, Groups synchronizing a transformation of non-uniform kernel, The snap-stabilizing message forwarding algorithm on tree topologies, Building self-stabilizing overlay networks with the transitive closure framework, Self-stabilizing labeling and ranking in ordered trees, The computational power of simple protocols for self-awareness on graphs, Corona: a stabilizing deterministic message-passing skip list, Spanders: distributed spanning expanders, Self-stabilizing algorithms for minimal global powerful alliance sets in graphs, Bounds on Herman's algorithm, Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks, Tiara: a self-stabilizing deterministic skip list and skip graph, Self-stabilizing gathering with strong multiplicity detection, A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs, An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs, Self-stabilizing minimum degree spanning tree within one from the optimal degree, A self-stabilizing algorithm to maximal 2-packing with improved complexity, Assurance of dynamic adaptation in distributed systems, Probabilistic self-stabilization, Loosely-stabilizing leader election in a population protocol model, A unified approach for studying the properties of transition systems, An \(O(n)\)-time self-stabilizing leader election algorithm, Feasibility analysis for robustness quantification by symbolic model checking, Self-stabilizing Byzantine asynchronous unison, Robust and scalable middleware for selfish-computer systems, Synchronous vs. asynchronous unison, Distance-\(k\) knowledge in self-stabilizing algorithms, Re-Chord: a self-stabilizing chord overlay network, A self-stabilizing algorithm for constructing spanning trees, Stabilizing leader election in partial synchronous systems with crash failures, A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs, A self-stabilizing \(k\)-clustering algorithm for weighted graphs, Snap-stabilization in message-passing systems, Binary self-stabilization in distributed systems, Maximum metric spanning tree made Byzantine tolerant, A self-stabilizing algorithm for constructing breadth-first trees, An exercise in fault-containment: Self-stabilizing leader election, A nearly optimal upper bound for the self-stabilization time in Herman's algorithm, Fast and compact self-stabilizing verification, computation, and fault detection of an MST, A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets, A distributed self-stabilizing solution to the dining philosophers problem, Self-stabilizing silent disjunction in an anonymous network, A self-stabilizing algorithm for maximal matching, Self-stabilizing leader election in polynomial steps, A self-stabilizing algorithm for edge monitoring in wireless sensor networks, Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks, A self-stabilizing algorithm for cut problems in synchronous networks, Dynamic FTSS in asynchronous systems: the case of unison, Game authority for robust and scalable distributed selfish-computer systems, Automated constraint-based addition of nonmasking and stabilizing fault-tolerance, A self-stabilizing transformer for population protocols with covering, How to improve snap-stabilizing point-to-point communication space complexity?, Nash equilibria in stabilizing systems, Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures, Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs, Timer-based composition of fault-containing self-stabilizing protocols, A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks, A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem, Self-stabilizing leader election in optimal space under an arbitrary scheduler, Stabilization of max-min fair networks without per-flow state, Secure and self-stabilizing clock synchronization in sensor networks, Self-stabilizing leader election in dynamic networks, On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms, Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model, Empire of colonies: Self-stabilizing and self-organizing distributed algorithm, A new self-stabilizing maximal matching algorithm, Rapid almost-complete broadcasting in faulty networks, Stabilizing maximum matching in bipartite networks, Linear time self-stabilizing colorings, Analysis of toggle protocols, Quasi-self-stabilization of a distributed system assuming read/write atomicity, Complexities of some interesting problems on spanning trees, A space-efficient self-stabilizing algorithm for measuring the size of ring networks, Stabilizing mobile philosophers, Self-stabilizing coloration in anonymous planar networks, Developing topology discovery in Event-B, Arbres avec un nombre maximum de sommets pendants, Homeostasis in synchronous distributed computation, a formal view, A self-stabilizing algorithm for the shortest path problem assuming the distributed demon, On the expected time for Herman's probabilistic self-stabilizing algorithm, Synthesizing optimal bias in randomized self-stabilization, \textit{Renaissance}: a self-stabilizing distributed SDN control plane using in-band communications, On the effects of noise and speed on computations, On the mutual-exclusion problem -- a quest for minimal solutions, Stabilizing observers, A short note on the approximability of the maximum leaves spanning tree problem, A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem, Self-stabilizing timestamps, Search by a metamorphic robotic system in a finite 2D square grid, A self-stabilizing Hashed Patricia Trie, Self-stabilizing smoothing and balancing networks, Practically-self-stabilizing virtual synchrony, Distributed edge coloration for bipartite networks, Proof labeling schemes, Greedy distributed optimization of multi-commodity flows, Bounded self-stabilizing Petri nets, Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos, A highly safe self-stabilizing mutual exclusion algorithm, Population protocols with unreliable communication, A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph, A self-stabilizing algorithm for strong fairness, The local detection paradigm and its applications to self-stabilization, On the computational power of self-stabilizing systems, A stochastic equilibrium model of internet pricing, Compact routing messages in self-healing trees, Fault-containing self-stabilization in asynchronous systems with constant fault-gap, On space complexity of self-stabilizing leader election in mediated population protocol, Leader-based de-anonymization of an anonymous read/write memory, Probabilistic verification of Herman's self-stabilisation algorithm, Three tokens in Herman's algorithm, Stabilizing data-link over non-FIFO channels with optimal fault-resilience, Team assembling problem for asynchronous heterogeneous mobile robots, Preserving stabilization while \textit{practically} bounding state space using incorruptible partially synchronized clocks, Coupling and self-stabilization, An efficient fault-containing self-stabilizing algorithm for the shortest path problem, Snap-stabilization and PIF in tree networks, Transient fault detectors, Fault-containing self-stabilizing distributed protocols, HyperTree for self-stabilizing peer-to-peer systems, When consensus meets self-stabilization, Automation of fault-tolerant graceful degradation, Self-stabilizing repeated balls-into-bins, Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative, Game theoretic analysis of self-stabilizing systems on arrays, Optimality of wait-free atomic multiwriter variables, Synthesizing robust systems, Self-stabilization: Randomness to reduce space, On optimal attraction in discrete-event processes, A note on the parallel runtime of self-stabilizing graph linearization, Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits, Distributed transactional memory for general networks, An efficient write-all algorithm for fail-stop PRAM without initialized memory, Space-efficient asynchronous consensus without shared memory initialization, Coordination without communication: the case of the flocking problem, Recoverable mutual exclusion, Towards a universal approach for the finite departure problem in overlay networks, A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon, Ascending runs in dependent uniformly distributed random variables: application to wireless networks, The synchronization of independent processes, The first fully polynomial stabilizing algorithm for BFS tree construction, A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity, A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets, Self-stabilization (in spite of distributed control) in tree-structured systems, A self-stabilizing algorithm for coloring bipartite graphs, A self-stabilizing algorithm for detecting fundamental cycles in a graph, Parameterized synthesis of self-stabilizing protocols in symmetric networks, Self-stabilizing ring orientation using constant space, A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments, Prime numbers as a tool to design distributed algorithms, Optimized silent self-stabilizing scheme for tree-based constructions, Stabilizing time-adaptive protocols, Distributed backup placement, Monotonic self-stabilization and its application to robust and adaptive pattern formation, Loosely-stabilizing maximal independent set algorithms with unreliable communications, 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, Local mending, A self-stabilizing enumeration algorithm., Factorizing fault tolerance., Self-stabilization of dynamic systems assuming only read/write atomicity, Self-stabilizing extensions for message-passing systems, Self-stabilization over unreliable communication media, Stabilization and pseudo-stabilization, Convergence of iteration systems, A self-stabilizing algorithm for coloring planar graphs, Self-stabilizing depth-first token circulation on networks, Safe and stabilizing distributed multi-path cellular flows, A deterministic worst-case message complexity optimal solution for resource discovery, Self-stabilizing distributed algorithm for local mutual inclusion, Optimal 1-fair alternators, Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps, Identity assignment in uniform synchronous rings, Elements of security: Closure, convergence, and protection, A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs, A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph, Self-stabilizing depth-first search, A self-stabilizing algorithm for the shortest path problem in a distributed system, Self-stabilization with path algebra, The epigenetic consensus problem, On probabilistic snap-stabilization, Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast, The triumph and tribulation of system stabilization, A Simple 2-Approximation for Maximum-Leaf Spanning Tree, Load balancing: An exercise in constrained convergence, A uniform self-stabilizing minimum diameter spanning tree algorithm, Deterministic, constant space, self-stabilizing leader election on uniform rings, Self-stabilizing systems in spite of high dynamics, On specifications and proofs of timed circuits, Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast, Self-stabilizing 2-minimal dominating set algorithms based on loop composition, Neighborhood mutual remainder: self-stabilizing distributed implementation and applications, Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles, Why3-do: the way of harmonious distributed system proofs, Squeezing streams and composition of self-stabilizing algorithms, Self-stabilizing indulgent zero-degrading binary consensus, A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States, Distributed Self-Stabilizing MIS with Few States and Weak Communication, Self-stabilization of wait-free shared memory objects, Self-stabilizing Distributed Protocol Switching, A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph, Self-stabilizing \(\ell\)-exclusion, Self-stabilizing robots in highly dynamic environments, Optimal Broadcast with Partial Knowledge, A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given, SKIP +, Leader Election in Sparse Dynamic Networks with Churn, Reliable synchronization in distributed systems, Effective multicast programming in large scale distributed systems, SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE, RELIABLE COMMUNICATION ON EMULATED CHANNELS RESILIENT TO TRANSIENT FAULTS, SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS, On self-stabilizing wait-free clock synchronization, A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks, Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs, Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler, Argumentation through a distributed self-stabilizing approach, Analysis of Distributed Token Circulation Algorithm with Faulty Random Number Generator, Effective storage capacity of labeled graphs, Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip, Self-stabilisation of Cellular Automata on Tilings, Generating effective symmetry-breaking predicates for search problems, Maintenance goals of agents in a dynamic environment: formulation and policy construction, An anonymous self-stabilizing algorithm for 1-maximal independent set in trees, A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM, EVENTUAL DETERMINISM: USING PROBABILISTIC MEANS TO ACHIEVE DETERMINISTIC ENDS, Control problems in a temporal logic framework, Unnamed Item, Coordination Games on Weighted Directed Graphs, Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees, Maintaining balanced trees for structured distributed streaming systems, Self-stabilizing algorithm for two disjoint minimal dominating sets, A combinatorial characterization of self-stabilizing population protocols, Weak vs. Self vs. Probabilistic Stabilization, Unison, canon, and sluggish clocks in networks controlled by a synchronizer, A self-stabilizing algorithm for the st-order problem, The Power of Global Knowledge on Self-stabilizing Population Protocols, Certification of an exact worst-case self-stabilization time, A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks, Primitive groups, graph endomorphisms and synchronization, Effective Search for a Naval Mine with Application to Distributed Failure Detection, On the Performance of Beauquier and Debas’ Self-stabilizing Algorithm for Mutual Exclusion, Self-stabilizing Cuts in Synchronous Networks, A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives, Analysis of a memory-efficient self-stabilizing BFS spanning tree construction, Location functions for self-stabilizing Byzantine tolerant swarms, Protocols with constant local storage and unreliable communication, Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks, Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs, A self-stabilizing algorithm for finding weighted centroid in trees, Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs, A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring, Self-stabilizing multi-token rings, Design and analysis of dynamic leader election protocols in broadcast networks, A self-stabilizing algorithm for the maximum flow problem, Self-stabilizing token circulation in uniform networks, Self-stabilizing depth-first token circulation in arbitrary rooted networks, Proving convergence of self-stabilizing systems using first-order rewriting and regular languages, Self-stabilization with r-operators, Torus orientation, A self-stabilizing quorum-based protocol for maxima computing, Universal dynamic synchronous self-stabilization, Alternators on uniform rings of odd size, Unnamed Item, Self-Stabilizing and Self-Organizing Virtual Infrastructures for Mobile Networks, SELF-STABILIZING k-out-of-ℓ EXCLUSION IN TREE NETWORKS, Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems, A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model, A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler, SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS, SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS, RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES, A multiple random walks based self-stabilizingk-exclusion algorithm in ad hoc networks, SELF STABILIZATION IN DISTRIBUTED KNOT DETECTION, Partially Ordered Knowledge Sharing and Fractionated Systems in the Context of other Models for Distributed Computing, On Stabilization in Herman’s Algorithm, SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS, Stabilization of Information Sharing for Queries Answering in Multiagent Systems, A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET, A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity, A fault-tolerant communication mechanism for cooperative robots, SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS, Solving CSPs with Naming Games, A note on leader election in directed split-stars and directed alternating group graphs, Unnamed Item, ANALYSIS OF THE AVERAGE EXECUTION TIME FOR A SELF-STABILIZING LEADER ELECTION ALGORITHM, A self‐stabilizing token‐based k‐out‐of‐ℓ exclusion algorithm, Verifying Recurrence Properties in Self-stabilization by Checking the Absence of Finite Counterexamples, Automated Analysis of Impact of Scheduling on Performance of Self-stabilizing Protocols, Self-Stabilizing Domination Algorithms, Oblivious Collaboration, A Framework for Certified Self-Stabilization, Parameterized Synthesis of Self-Stabilizing Protocols in Symmetric Rings, Unnamed Item, A self-stabilizing graph algorithm: Finding the cutting center of a tree, Self-Stabilizing Prefix Tree Based Overlay Networks, A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm, Loosely-Stabilizing Leader Election in Population Protocol Model, On Finding Directed Trees with Many Leaves, Optimal Broadcast with Partial Knowledge, Unnamed Item, An optimal self-stabilizing strarvation-free alternator, A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH, Efficient token-based control in rings., New Self-Stabilizing Algorithms for Minimal Weakly Connected Dominating Sets, A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery, SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM
