Self-stabilizing timestamps

DOI10.1016/S0304-3975(03)00130-0zbMath1070.68011MaRDI QIDQ1884893

Uri Abraham

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

\(\ell\)-exclusion problemmultiwriter atomic register

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14) Network protocols (68M12)

Related Items (3)

When consensus meets self-stabilization ⋮ Practically stabilizing SWMR atomic memory in message-passing systems ⋮ Self-stabilizing distributed algorithm for local mutual inclusion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On interprocess communication and the implementation of multi-writer atomic registers
• Concurrent reading while writing revisited
• On interprocess communication. I: Basic formalism
• Bounded time-stamps
• Simple and efficient bounded concurrent timestamping and the traceable use abstraction
• A New Approach to Proving the Correctness of Multiprocess Programs
• Self-stabilizing systems in spite of distributed control
• Bounded Concurrent Time-Stamping
• How to share concurrent wait-free variables
• A new solution of Dijkstra's concurrent programming problem
• Self-stabilizing \(\ell\)-exclusion

This page was built for publication: Self-stabilizing timestamps