Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms (long version) - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Technical Report) Year : 2021

Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms (long version)

Abstract

Distributed algorithms typically run over arbitrary many processes and may involve unboundedly many rounds, making the automated verification of their correctness challenging. Building on domain theory, we introduce a framework that abstracts infinite-state distributed systems that represent distributed algorithms into finite-state guard automata. The soundness of the approach corresponds to the Scott-continuity of the abstraction, which relies on the assumption that the distributed algorithms are layered. Guard automata thus enable the verification of safety and liveness properties of distributed algorithms.
Fichier principal
Vignette du fichier
hal-version.pdf (723.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03283388 , version 1 (10-07-2021)

Identifiers

  • HAL Id : hal-03283388 , version 1

Cite

Nathalie Bertrand, Bastien Thomas, Josef Widder. Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms (long version). [Technical Report] Inria. 2021, pp.1-33. ⟨hal-03283388⟩
43 View
147 Download

Share

Gmail Facebook X LinkedIn More