Verifying recurrence properties in self-stabilization by checking the absence of finite counterexamples
DOI10.1007/978-3-319-21741-3_9zbMATH Open1428.68084OpenAlexW2271723404MaRDI QIDQ5207907FDOQ5207907
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
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
Reliability, testing and fault tolerance of networks and computer systems (68M15) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Introduction to Distributed Algorithms
- Self-stabilization
- Self-stabilizing systems in spite of distributed control
- When graph theory helps self-stabilization
- On the Verification of Livelock-Freedom and Self-Stabilization on Parameterized Rings
- 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
- Introducing speculation in self-stabilization
- ASSESS: A Tool for Automated Synthesis of Distributed Self-stabilizing Algorithms
- Verifying Recurrence Properties in Self-stabilization by Checking the Absence of Finite Counterexamples
Cited In (2)
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)
