ویراساینس.
سند علمی

ASSESS: A Tool for Automated Synthesis of Distributed Self-stabilizing Algorithms

Fathiyeh Faghih, Borzoo Bonakdarpour

چکیده

A distributed self-stabilizing system is one that always recovers to its legitimate behavior with no external intervention, even if it is initialized in an arbitrary state. It is well known that designing and reasoning about the correctness of such protocols are highly tedious and complex tasks. We present Assess (Automated Synthesizer for SElf-Stabilizing Systems), a tool that automatically synthesizes distributed self-stabilizing algorithms from their high-level specification. Assess takes as input (1) the network topology of the distributed system, (2) the legitimate behavior of the system (either explicitly as a state predicate, or implicitly as a set of ltl formulas), and (3) a set of high-level requirements such as the timing model (asynchronous or synchronous) and stabilization type (weak, strong, and monotonic). The tool utilizes powerful SMT-solving techniques and returns a self-stabilizing protocol as a set of guarded commands that realize the input specification. Since the output is correct by construction, it will not need any proof correctness. We expect the designers and researchers in the area of self-stabilization to significantly benefit from the tool.

اسناد مشابه

  • Automated Analysis and Optimization of Distributed Self-Stabilizing Algorithms

    سند علمی۲۰۱۵Saba Aflaki, Fathiyeh Faghih, Borzoo Bonakdarpour

    Self-stabilization [14] 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 nu

  • Certification of Distributed Self-Stabilizing Algorithms Using Coq Master Internship

    سند علمی۲۰۱۵Karine Altisen, Pierre Corbineau, Stéphane Devismes

    Scientific Context. Modern distributed systems can be large-scale (e.g., Internet), dynamic (e.g., Peerto-Peer systems), and / or resource constrained (e.g., WSNs — Wireless Sensor Networks). Those characteristics increase the number of faults which may hit the system. For instan

  • Certification of Distributed Self-Stabilizing Algorithms Using Coq

    سند علمی۲۰۱۷Karine Altisen, Pierre Corbineau, Stéphane Devismes

    Scientific Context. Modern distributed systems can be large-scale (e.g., Internet), dynamic (e.g., Peer-toPeer systems), and / or resource constrained (e.g., wireless sensor networks – WSNs). Those characteristics increase the number of faults which may hit the system. For instan

  • Daemon Conversions in Distributed Self-stabilizing Algorithms

    سند علمی۲۰۱۳WALCOMWayne Goddard, Pradip K. Srimani

    We consider protocols to transform a self-stabilizing algorithm for one daemon to one that can run under a different daemon. In the literature, there are several daemons, and several possible attributes of those daemons, and it is customary to detail the choice of daemon one is u

  • CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System

    سند علمی۲۰۱۳DISCSebastian Kniesburges, Andreas Koutsopoulos, Christian Scheideler

    We consider the problem of managing a dynamic heterogeneous storage system in a distributed way so that the amount of data assigned to a host in that system is related to its capacity. Two central problems have to be solved for this: (1) organizing the hosts in an overlay network

  • Distributed Self-Stabilizing Algorithm for Minimum Spanning Tree Construction

    سند علمی۱۹۹۷Euro-ParGheorghe Antonoiu, Pradip K. Srimani

    Minimal Spanning Tree (MST) problem in an arbitrary undirected graph is an important problem in graph theory and has extensive applications. Numerous algorithms are available to compute an MST. Our purpose here is to propose a self-stabilizing distributed algorithm for the MST pr