Self-stabilizing timestamps
From MaRDI portal
Publication:1884893
DOI10.1016/S0304-3975(03)00130-0zbMath1070.68011MaRDI QIDQ1884893
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q60: Specification and verification (program logics, model checking, etc.)
68M14: Distributed systems
68M12: Network protocols
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