Ideal Stabilization

Mikhail Nesterenko Sébastien Tixeuil 1
1 NPA - Networks and Performance Analysis
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : We define and explore the concept of ideal stabilization. The program is ideally stabilizing if its every state is legitimate. Ideal stabilization allows the specification designer to prescribe with arbitrary degree of precision not only the fault-free program behavior but also its recovery operation. Specifications may or may not mention all possible states. We identify approaches to designing ideal stabilization to both kinds of specifications. For the first kind, we state the necessary condition for an ideally stabilizing solution. On the basis of this condition we prove that there is no ideally stabilizing solution to the leader election problem. We illustrate the utility of the concept by providing examples of well-known programs and proving them ideally stabilizing. Specifically, we prove ideal stabilization of the conflict manager, the alternator, the propagation of information with feedback and the alternating bit protocol.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01285686
Contributor : Lip6 Publications <>
Submitted on : Wednesday, March 9, 2016 - 4:07:03 PM
Last modification on : Thursday, March 21, 2019 - 1:07:31 PM

Identifiers

Citation

Mikhail Nesterenko, Sébastien Tixeuil. Ideal Stabilization. IEEE AINA 2011, Mar 2011, Biopolis, Singapore. pp.224-231, ⟨10.1109/AINA.2011.28⟩. ⟨hal-01285686⟩

Share

Metrics

Record views

77