The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Stabilizing Communication Protocols
IEEE Transactions on Computers - Special issue on protocol engineering
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Self-stabilization by local checking and correction (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
IEEE Transactions on Software Engineering
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Fault-containing self-stabilizing algorithms
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Self-stabilization
Error-detecting codes and fault-containing self-stabilization
Information Processing Letters
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Finite-state self-stabilizing protocols in message-passing systems
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Automating the Addition of Fault-Tolerance
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
Recursive Restartability: Turning the Reboot Sledgehammer into a Scalpel
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Scalable Self-Stabilization via Composition
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Safety assurance via on-line monitoring
Distributed Computing
Stabilization and pseudo-stabilization
Distributed Computing - Special issue: Self-stabilization
Echo Algorithms: Depth Parallel Operations on General Graphs
IEEE Transactions on Software Engineering
Snap-stabilization in message-passing systems
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Light enabling snap-stabilization of fundamental protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
From self- to snap- stabilization
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
A framework of safe stabilization
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Snap-stabilization in message-passing systems
Journal of Parallel and Distributed Computing
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We propose a new approach to specifying and reasoning about forward recovery fault tolerant programs. We call it ideal stabilisation. The program is ideally stabilising if its every state is legitimate. Ideal stabilisation allows the specification designer to prescribe, with arbitrary degree of precision, not only the fault-free program behaviour but also its recovery operation. Unlike the classic variant, ideal stabilisation is particularly suitable for program composition. Specifications may or may not mention all possible states. We identify approaches to designing ideal stabilisation to both classes of specifications. For the first class, we state the necessary condition for an ideally stabilising solution. On the basis of this condition we prove that there is no ideally stabilising solution to the leader election problem. We illustrate the utility of the concept of ideal stabilisation by providing examples of well-known programs and proving them ideally stabilising. Specifically, we prove ideal stabilisation of the conflict manager, the alternator, the propagation of information with feedback and the alternating bit protocol.