Verifying recurrence properties in self-stabilization by checking the absence of finite counterexamples

DOI10.1007/978-3-319-21741-3_9MaRDI QIDQ5207907zbMATH OpenOpenAlexFDO

Authors Oday Jubran, Eike Möhlmann, 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

recurrenceself-stabilizationautomatic verificationfinite counterexample

Mathematics Subject Classification ID

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

Recommendations

• Towards Automatic Convergence Verification of Self-stabilizing Algorithms
• scientific article; zbMATH DE number 1696676
• Decidability analysis of self-stabilization for infinite-state systems
• A strategy for automatic verification of stabilization of distributed algorithms
• Introducing speculation in self-stabilization, an application to mutual exclusion

Cites work

• ASSESS: a tool for automated synthesis of distributed self-stabilizing algorithms
• Introducing speculation in self-stabilization, an application to mutual exclusion
• Introduction to Distributed Algorithms
• On the verification of livelock-freedom and self-stabilization on parameterized rings
• Self-stabilization
• Self-stabilizing leader election in optimal space under an arbitrary scheduler
• Self-stabilizing systems in spite of distributed control
• Stabilization, safety, and security of distributed systems. 16th international symposium, SSS 2014, Paderborn, Germany, September 28 -- October 1, 2014. Proceedings
• Synchronous vs. asynchronous unison
• Verifying recurrence properties in self-stabilization by checking the absence of finite counterexamples
• When graph theory helps self-stabilization

Cited in

(2)

• scientific article; zbMATH DE number 4194606 (Why is no real title available?)
• Verifying recurrence properties in self-stabilization by checking the absence of finite counterexamples

This page was built for publication: Verifying recurrence properties in self-stabilization by checking the absence of finite counterexamples

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