Ideal Stabilization

Abstract : 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.
Complete list of metadatas

https://hal.sorbonne-universite.fr/hal-00930022
Contributor : Sébastien Tixeuil <>
Submitted on : Tuesday, January 14, 2014 - 11:14:57 AM
Last modification on : Wednesday, August 21, 2019 - 12:12:04 PM

Identifiers

Citation

Mikhail Nesterenko, Sébastien Tixeuil. Ideal Stabilization. International Journal of Grid and Utility Computing, Inderscience, 2013, 4 (4), pp.219-230. ⟨10.1504/IJGUC.2013.057116⟩. ⟨hal-00930022⟩

Share

Metrics

Record views

505