Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 9 of 9 for “"Self-stabilizing algorithms"”.

  1. Automated Analysis and Optimization of Distributed Self-Stabilizing Algorithms

    Self-stabilization [2] is a versatile technique for recovery from erroneous behavior due to transient faults or wrong initialization. A system is self-stabilizing if (1) starting from an arbitrary initial state it can automatically reach a set of legitimate states in a finite number of steps and …

    waterloo Repository record for Automated Analysis and Optimization of Distributed Self-Stabilizing Algorithms (opens in a new tab)

  2. Performance Evaluation of Self-stabilizing Algorithms by Probabilistic Model Checking

    A self-stabilizing protocol is one that starting from any arbitrary initial state recovers to legitimate states in a finite number of steps, and once it stabilizes to a set of legitimate states, it remains there unless it is perturbed by transient faults. The traditional methods existing for …

    waterloo Repository record for Performance Evaluation of Self-stabilizing Algorithms by Probabilistic Model Checking (opens in a new tab)

  3. Fault Tolerance in Distributed Systems Using Self-Stabilization

    Self-stabilization is an optimistic paradigm to provide autonomous resilience against an un-limited number of transient faults in distributed systems. A self-stabilizing system guarantees an eventual return to a legitimate operating state beginning with an unknown initial state, including a state …

    clemson Repository record for Fault Tolerance in Distributed Systems Using Self-Stabilization (opens in a new tab)

  4. A Radio Link Quality Model and Simulation Framework for Improving the Design of Embedded Wireless Systems

    … including node failure and state corruption. Self-stabilizing algorithms can provide recovery in the presence of such faults. These algorithms guarantee the eventual satisfaction of a given state legitimacy predicate regardless of the initial state of the network. Their practical behavior is …

    clemson Repository record for A Radio Link Quality Model and Simulation Framework for Improving the Design of Embedded Wireless Systems (opens in a new tab)

  5. Self-stabilizing tree algorithms

    Designers of distributed algorithms have to contend with the problem of making the algorithms tolerant to several forms of coordination loss, primarily faulty initialization. The processes in a distributed system do not share a global memory and can only get a partial view of the global state. …

    unlv Repository record for Self-stabilizing tree algorithms (opens in a new tab) Download PDF for Self-stabilizing tree algorithms (opens in a new tab)

  6. Self-stabilizing deadlock algorithms in distributed systems

    A self-stabilizing system is a network of processors, which, when started from an arbitrary (and possibly illegal) initial state, always returns to a legal state in a finite number of steps. Self-stabilization is an evolving paradigm in fault-tolerant computing. This research will be the first time …

    unlv Repository record for Self-stabilizing deadlock algorithms in distributed systems (opens in a new tab) Download PDF for Self-stabilizing deadlock algorithms in distributed systems (opens in a new tab)

  7. Self-* distributed query region covering in sensor networks

    … we have designed two fully distributed, robust, self-* solutions to the minimum connected cover of query regions that can cope with both transient faults and sensor crashes. We considered the most general case in which every sensor has a different sensing and communication radius. We have also …

    unlv Repository record for Self-* distributed query region covering in sensor networks (opens in a new tab) Download PDF for Self-* distributed query region covering in sensor networks (opens in a new tab)

  8. Automated Synthesis of Timed and Distributed Fault-Tolerant Systems

    … model, the state of the art lacked synthesis algorithms that can be efficiently implemented. This is in part due to the fact that synthesis is in general a challenging problem and its complexity is significantly magnified in the context of timed systems. We propose an algorithm that takes a …

    waterloo Repository record for Automated Synthesis of Timed and Distributed Fault-Tolerant Systems (opens in a new tab)