This paper deals with the trade-off between time, workload, and versatility in self-
stabilization, a general and lightweight fault-tolerant concept in distributed computing. In this …

A distributed system is self-stabilizing if, regardless of its initial state, the system is
guaranteed to reach a legitimate (ie, correct) state in finite time. In 2007, Turau proposed the …

Wireless sensor networks (WSNs) achieving environmental sensing are fundamental
communication layer technologies in the Internet of Things. Battery-powered sensor nodes …

An appropriate approach for translating UML to B formal specifications allows one to use
UML and B jointly in a unified, practical and rigorous software development. We formally …

We propose the first polynomial self-stabilizing distributed algorithm for the minimal total
dominating set problem in an arbitrary graph. Then, we generalize the proposed algorithm …

In this paper, we present a deterministic distributed algorithm that computes the maximal 2-
packing set in a geometric outerplanar graph. In a geometric outerplanar graph, all the …

In this chapter, we introduce the self-stabilizing algorithm model and present several
definitive examples that illustrate the simplicity and elegance of this algorithmic paradigm …

In this paper, we address the problem of finding a maximum 2-packing set in a cactus. Let
G=(VG, EG) be an undirected connected graph; then a subset S⊆ VG is a 2-packing set if for …

A 2-packing set for an undirected graph $ G=(V, E) $ is a subset $\mathcal {S}\subset V $
such that any two vertices $ v_1, v_2\in\mathcal {S} $ have no common neighbors. Finding a …

A self-stabilizing distributed algorithm is guaranteed eventually to reach and stay at a
legitimate configuration regardless of the initial configuration of a distributed system. In this …