The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
The mutual exclusion problem: partII—statement and solutions
Journal of the ACM (JACM)
Parallel program design: a foundation
Parallel program design: a foundation
Token Systems That Self-Stabilize
IEEE Transactions on Computers
Stabilizing Communication Protocols
IEEE Transactions on Computers - Special issue on protocol engineering
Closure and Convergence: A Foundation of Fault-Tolerant Computing
IEEE Transactions on Software Engineering - Special issue on software reliability
Information Processing Letters
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Advanced Concepts in Operating Systems
Advanced Concepts in Operating Systems
IEEE Transactions on Computers
A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Finite-state self-stabilizing protocols in message-passing systems
ICDCS '99 Workshop on Self-stabilizing Systems
Lock-based self-stabilizing distributed mutual exclusion algorithms
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
When graph theory helps self-stabilization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Randomized three-state alternator for uniform rings
Journal of Parallel and Distributed Computing
Distance- k knowledge in self-stabilizing algorithms
Theoretical Computer Science
Self-stabilizing philosophers with generic conflicts
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A Distributed and Deterministic TDMA Algorithm for Write-All-With-Collision Model
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Local Synchronization on Oriented Rings
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Transformations for write-all-with-collision model
Computer Communications
Alternators in read/write atomicity
Information Processing Letters
Journal of Parallel and Distributed Computing
Self-stabilizing philosophers with generic conflicts
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Brief announcement: wait-free dining for eventual weak exclusion
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing atomicity refinement allowing neighborhood concurrency
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Anonymous daemon conversion in self-stabilizing algorithms by randomization in constant space
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
A uniform process alternator for arbitrary topologies
Journal of High Speed Networks
Relationships between communication models in networks using atomic registers
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A tranformational approach for designing scheduler-oblivious self-stabilizing algorithms
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
"Slow is fast" for wireless sensor networks in the presence of message losses
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2
Theoretical Computer Science
Feasibility of Stepwise Design of Multitolerant Programs
ACM Transactions on Software Engineering and Methodology (TOSEM)
Self-stabilizing space optimal synchronization algorithms on trees
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Tiara: A self-stabilizing deterministic skip list and skip graph
Theoretical Computer Science
Self-stabilizing deterministic TDMA for sensor networks
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Time optimal asynchronous self-stabilizing spanning tree
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
Program refinements from an abstract to a concrete model empower designers to reason effectively in the abstract and architects to implement effectively in the concrete. For refinements to be useful, they must not only preserve functionality properties but also dependability properties. In this paper, we focus our attention on refinements that preserve the dependability property of stabilization. Specifically, we present a stabilization-preserving refinement of atomicity from an abstract model where a process can atomically access the state of all its neighbors and update its own state, to a concrete model where a process can only atomically access the state of any one of its neighbors or atomically update its own state. Our refinement is sound and complete with respect to the computations admitted by the abstract model, and induces linear step complexity and constant synchronization delay in the computations admitted by the concrete model. It is based on a bounded-space, stabilizing dining philosophers program in the concrete model. The program is readily extended to: (a) solve stabilization-preserving semantics refinement, (b) solve the stabilizing drinking philosophers problem, and (c) allow further refinement into a message-passing model.