Specification-Based Synthesis of Distributed Self-Stabilizing Protocols

Abstract

Abstract. In this paper, we introduce an SMT-based method that automatically synthesizes a distributed self-stabilizing protocol from a given high-level specification and network topology. Unlike existing approaches, where synthesis algorithms require the explicit description of the set of legitimate states, our technique only needs the temporal behavior of the protocol. We extend our approach to synthesize ideal-stabilizing protocols, where every state is legitimate. We also extend our technique to synthesize monotonic-stabilizing protocols, where during recovery, each process can execute an most once one action. Our proposed methods are fully implemented and we report successful synthesis of well-known protocols such as Dijkstra's token ring, a self-stabilizing version of Raymond's mutual exclusion algorithm, ideal-stabilizing leader election and local mutual exclusion, as well as monotonic-stabilizing maximal independent set and distributed Grundy coloring.

Space-Time Universality of Field Calculus

“…By a form of abstraction which releases some constraints on temporal execution (i.e., accepting some delay), field calculus is shown instead to be both universal and message-size efficient. As a key corollary, we proved that field calculus can efficiently implement self-stabilising computations, a class of computations which lately received considerable interest [3,20,26,33,35].…”

“…Stabilisation guarantees that a limit exists, but in general such a limit could highly depend on "transient environmental changes". A stronger property, more useful in practical applications is self-stabilisation [1,20,26,35], additionally guaranteeing full-independence to transient changes as defined in the following.…”

Aggregate centrality measures for IoT-based coordination

“…Systems performing this kind of input/output distributed computation are often referred to as self-stabilising systems [3,50,51,52]. There, the goal is to make transient changes eventually irrelevant, such that as soon as a network becomes static, the result converges to the correct expected value.…”

Verification and Synthesis of Symmetric Uni-Rings for Leads-To Properties

“…Techniques for automated completion of distributed protocols [59,4,58,5] mainly extend program sketching and synthesis-by-examples for distributed programs under strong/weak fairness. Existing automated techniques [6,43,32,17,11,19,24,22,40,23] for the addition of fault tolerance mainly enable the synthesis of fixed-size fault-tolerant protocols from their fault-intolerant versions.…”