Model Checking of Distributed Algorithms using Synchronous Programs - CNRS - Centre national de la recherche scientifique Access content directly
Conference Papers Year : 2023

Model Checking of Distributed Algorithms using Synchronous Programs


The development of trustworthy self-stabilizing algorithms requires the verification of some key properties with respect to the formal specification of the expected system executions. The atomic-state model (ASM) is the most commonly used computational model to reason on self-stabilizing algorithms. In this work, we propose methods and tools to automatically verify the self-stabilization of distributed algorithms defined in that model. To that goal, we exploit the similarities between the ASM and computational models issued from the synchronous programming area to reuse their associated verification tools, and in particular their model checkers. This allows the automatic verification of all safety (and bounded liveness) properties of any algorithm, regardless of any assumptions on network topologies and execution scheduling.
Fichier principal
Vignette du fichier
main.pdf (229.83 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04172396 , version 1 (27-07-2023)



Erwan Jahier, Karine Altisen, Stéphane Devismes, Gabriel B. Sant'Anna. Model Checking of Distributed Algorithms using Synchronous Programs. 25th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2023), Shlomi Dolev, Baruch Schieber, Oct 2023, Jersey City, NJ, United States. ⟨10.1007/978-3-031-44274-2⟩. ⟨hal-04172396⟩
58 View
93 Download



Gmail Mastodon Facebook X LinkedIn More