Verifying Recurrence Properties in Self-stabilization by Checking the Absence of Finite Counterexamples

DOI10.1007/978-3-319-21741-3_9zbMath1428.68084OpenAlexW2271723404MaRDI QIDQ5207907

Eike Möhlmann, Oday Jubran, Oliver Theel

Publication date: 14 January 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21741-3_9

zbMATH Keywords

recurrenceautomatic verificationself-stabilizationfinite counterexample

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Verifying Recurrence Properties in Self-stabilization by Checking the Absence of Finite Counterexamples

Cites Work

• Unnamed Item
• Self-stabilizing leader election in optimal space under an arbitrary scheduler
• Stabilization, safety, and security of distributed systems. 16th international symposium, SSS 2014, Paderborn, Germany, September 28 -- October 1, 2014. Proceedings
• Synchronous vs. asynchronous unison
• Self-stabilizing systems in spite of distributed control
• Introduction to Distributed Algorithms
• On the Verification of Livelock-Freedom and Self-Stabilization on Parameterized Rings
• ASSESS: A Tool for Automated Synthesis of Distributed Self-stabilizing Algorithms
• Introducing speculation in self-stabilization
• Verifying Recurrence Properties in Self-stabilization by Checking the Absence of Finite Counterexamples
• When graph theory helps self-stabilization

This page was built for publication: Verifying Recurrence Properties in Self-stabilization by Checking the Absence of Finite Counterexamples