In 1973 Dijkstra introduced to computer science the notion of self-stabilization in the context
of distributed systems. He defined a system as self-stabilizing when “regardless of its initial …

The question of what can be computed, and how efficiently, is at the core of computer
science. Not surprisingly, in distributed systems and networking research, an equally …

A network protocol consists of a program for each network node. Each program consists of
code and inputs as well as local state. The global state of the network consists of the local …

An Introduction to Distributed Algorithms takes up some of the main concepts and
algorithms, ranging from basic to advanced techniques and applications, that underlie the …

A distributed system is self-stabilizing if it can be started in any possible global state. Once
started the system regains its consistency by itself, without any kind of outside intervention …

We explore the notion of distributed program checking as a means of making a distributed
algorithm selfstabilizing. We describe a compiler that converts a deterministic synchronous …

In the network synchronization model, each node maintains a local pulse counter such that
the advance of the pulse numbers simulates the advance of a clock in a synchronous …

A new paradigm for the design of self-stabilizing distributed algorithms, called local
detection, is introduced. The essence of the paradigm is in defining a local condition based …

Local certification consists in assigning labels to the vertices of a network to certify that some
given property is satisfied, in such a way that the labels can be checked locally. In the last …

We describe a method for transforming asynchronous network protocols into protocols that
can sustain any transient fault, ie, become self-stabilizing. We combine the known notion of …