On the verification of livelock-freedom and self-stabilization on parameterized rings

DOI10.1145/3326456zbMATH Open1433.68254OpenAlexW2951238781WikidataQ127779377 ScholiaQ127779377MaRDI QIDQ4972154FDOQ4972154

Authors: 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

Recommendations

• A hybrid method for the verification and synthesis of parameterized self-stabilizing protocols
• An approach to the verification of symmetric parameterized distributed systems
• scientific article; zbMATH DE number 1670786
• Tools and Algorithms for the Construction and Analysis of Systems
• scientific article; zbMATH DE number 1863180

zbMATH Keywords

self-stabilizationprogram verificationdistributed programsparameterized 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)

Cited In (4)

• Parameterized Synthesis of Self-Stabilizing Protocols in Symmetric Rings
• Verifying recurrence properties in self-stabilization by checking the absence of finite counterexamples
• Verifying global start-up for a Möbius ring-oscillator
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4972154)