On the complexity of adding convergence

DOI10.1007/978-3-642-40213-5_2MaRDI QIDQ2948235zbMATH OpenOpenAlexFDO

Authors Alex Klinkhamer, Ali Ebnenasir

Publication date 30 September 2015

Published in Fundamentals of Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40213-5_2

zbMATH Keywords

convergencedistributed programsNP-completenessself-stabilization

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Self-stabilizing extensions for message-passing systems
• Self-stabilization
• Automated constraint-based addition of nonmasking and stabilizing fault-tolerance
• Towards Automatic Convergence Verification of Self-stabilizing Algorithms
• Self-stabilization Preserving Compiler

Cited in

(4)

• Tight bounds on expected time to add correctly and add mostly correctly
• Parameterized synthesis of self-stabilizing protocols in symmetric networks
• Automated synthesis of distributed self-stabilizing protocols
• Parameterized Synthesis of Self-Stabilizing Protocols in Symmetric Rings

This page was built for publication: On the complexity of adding convergence

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