Practically-self-stabilizing vector clocks without scheduling fairness

DOI10.1007/S00236-026-00544-ZMaRDI QIDQ7347237zbMATH OpenFDO

Authors Iosif Salem, Elad M. Schiller

Publication date 14 September 2026

Published in Acta Informatica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00236-026-00544-Z

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Bounded Version Vectors
• Concise version vectors in WinFS
• Distributed systems. Principles and paradigms.
• Introduction to Distributed Self-Stabilizing Algorithms
• Practically stabilizing SWMR atomic memory in message-passing systems
• Practically-self-stabilizing virtual synchrony
• Resettable vector clocks
• Self-stabilization
• Self-stabilization of dynamic systems assuming only read/write atomicity
• Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks
• Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
• Self-stabilizing multivalued consensus in asynchronous crash-prone systems
• Self-stabilizing multivalued consensus in the presence of Byzantine faults and asynchrony
• Self-stabilizing snapshot objects for asynchronous failure-prone networked systems
• Self-stabilizing systems in spite of distributed control
• Snap-stabilization in message-passing systems
• Stabilizing server-based storage in Byzantine asynchronous message-passing systems (extended abstract)
• The availability of quorum systems
• Time, clocks, and the ordering of events in a distributed system
• When consensus meets self-stabilization

This page was built for publication: Practically-self-stabilizing vector clocks without scheduling fairness

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