Dijkstra’s concept of self-stabilization assumes that faults can only affect the variables of a program. We study the notion of self-stabilization if faults can also affect (i.e., augment) the program code of a system. A code stabilizing system automatically recovers from (almost) arbitrary perturbations of its program code. We prove some lower bounds for code stabilizing systems and argue that...

Over the past two decades, the use of distributed embedded systems is wide in many applications. One way to guarantee that these systems tolerate transient faults is done by making them self-stabilizing systems, which automatically recover from any transient fault. In this paper we present a formalism of self-stabilization concept based on Linear Temporal Logic (LTL), and model checked the self...

Let G be the group of projectivities stabilizing a unital U in PG(2, q2). In this paper, we prove that U is a classical unital if and only if there are two points in U such that the stabilizer of these two points in G has order q2 − 1.

We consider dilaton stabilization with R invariance, which insures a vanishing cosmological constant at the scale of stabilization. We construct a few models which accommodate weak gauge couplings with large or small gauge groups. Matter condensation plays a central role in the dilaton stabilization.

Kutten and Patt-Shamir have proposed a method for fast recovery of the output of a non-reactive, distributed protocol: if f < n=2 processors are corrupted from a legitimate global state, then the method recovers the output in O(f) time. The proposed method leaves open the case f n=2. This note presents a technique to handle also the case of f n=2, again recovering the output in O(f) time. The r...

A randomized uniform self-stabilizing protocol that provides each (anonymous) processor of a uniform system with a distinct identiier is presented. The protocol uses a predeened xed amount of memory and stabilizes within expected (d) time, where d is the actual diameter of the network.