Term Paper: SELF STABILIZATION IN DISTRIBUTED SYSTEMS
ثبت نشده
چکیده
منابع مشابه
Self-Stabilization in the Distributed Systems of Finite State Machines
The notion of self-stabilization was first proposed by Dijkstra in 1974 in his classic paper. The paper defines a system as self-stabilizing if, starting at any, possibly illegitimate, state the system can automatically adjust itself to eventually converge to a legitimate state in finite amount of time and once in a legitimate state it will remain so unless it incurs a subsequent transient faul...
متن کاملTowards Automatic Convergence Verification of Self-stabilizing Algorithms
The verification of the self-stabilization property of a distributed algorithm is a complicated task. By exploiting certain analogies between self-stabilizing distributed algorithms and globally asymptotically stable feedback systems, techniques originally developed for the verification of feedback system stability can be adopted for the verification of selfstabilization of distributed algorith...
متن کاملModel Checking Self-Stabilising in Embedded Systems with Linear Temporal Logic
Over the past two decades, the use of distributed embedded systems is wide in many applications. One way to guarantee that these systems tolerate transient faults is done by making them self-stabilizing systems, which automatically recover from any transient fault. In this paper we present a formalism of self-stabilization concept based on Linear Temporal Logic (LTL), and model checked the self...
متن کاملFault-Tolerance of Distributed Algorithms: Self-Stabilization and Wait-Freedom
Distributed computation has attracted considerable attention and large-scale distributed systems have been designed and developed. A distributed system inherently has possibility of fault tolerance because of its redundancy. Thus, a great deal of investigation has been made to design faulttolerant distributed algorithms. This paper introduces two promising paradigms, self-stabilization and wait...
متن کاملA Space-Optimal Self-Stabilizing Algorithm for the Maximal Independent Set Problem
Self-stabilization is a theoretical framework of nonmasking fault-tolerant distributed algorithms. In this paper, we propose a self-stabilizing algorithm for the maximal independent set problem in distributed systems assuming the state reading model under the distributed scheduler. Space complexity of proposed algorithm is two-state, and upper bound of time complexity is (n+ 2)(n+ 1)/4 steps, w...
متن کامل