On the Verification of Livelock-Freedom and Self-Stabilization on Parameterized Rings

DOI10.1145/3326456zbMath1433.68254OpenAlexW2951238781WikidataQ127779377 ScholiaQ127779377MaRDI QIDQ4972154

Alex Klinkhamer, Ali Ebnenasir

Publication date: 22 November 2019

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3326456

zbMATH Keywords

distributed programsself-stabilizationprogram verificationparameterized systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12)

Related Items (2)

Verifying Recurrence Properties in Self-stabilization by Checking the Absence of Finite Counterexamples ⋮ Parameterized synthesis of self-stabilizing protocols in symmetric networks

This page was built for publication: On the Verification of Livelock-Freedom and Self-Stabilization on Parameterized Rings