Skip to Main content Skip to Navigation
New interface
Reports (Research report)

Ideal Stabilization

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.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Sébastien Tixeuil Connect in order to contact the contributor
Submitted on : Wednesday, June 10, 2009 - 3:22:26 PM
Last modification on : Wednesday, October 26, 2022 - 8:16:13 AM
Long-term archiving on: : Friday, June 11, 2010 - 12:35:00 AM


Files produced by the author(s)


  • HAL Id : inria-00394118, version 1
  • ARXIV : 0906.1947


Mikhail Nesterenko, Sébastien Tixeuil. Ideal Stabilization. [Research Report] ???. 2009, pp.15. ⟨inria-00394118⟩



Record views


Files downloads