159
click to vote
WSS
15 years 4 months ago
2001
Abstract. A data structure is stabilizing if, for any arbitrary (and possibly illegitimate) initial state, any sequence of sufficiently many operations brings the data structure to...
122
click to vote
WSS
15 years 4 months ago
2001
We investigate a new property of computing systems called weak stabilization. Although this property is strictly weaker than the well-known property of stabilization, weak stabiliz...
106
click to vote
WSS
15 years 4 months ago
2001
Abstract. We study a special type of self-stabilizing algorithms composition : the cross-over composition (A B). The cross-over composition is the generalization of the algorithm c...
WSS
15 years 4 months ago
2001 107
click to vote
WSS
15 years 4 months ago
2001
We present a formal specification of the PING protocol, and use three concepts of convergence theory, namely closure, convergence, and protection, to show that this protocol is se...
|