Probabilistic Self-stabilization
Probabilistic Self-Stabilization is a form of self-stabilization in distributed systems where, starting from any arbitrary state, the system is guaranteed to converge to a legitimate state with probability one, rather than in a deterministic manner, thereby distinguishing it from classical self-stabilization through its reliance on probabilistic transitions and fairness assumptions.
10
Publications
290
Citations
27
Authors
25
Institutions
Publications per year
2017–2026
2
Parents
10
Proof rules for probabilistic loops
Carroll Morgan · Electronic workshops in computing · 1996 · 50 citations · Full text
1–5 of 10
27
3
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 27
25

Centre National de la Recherche Scientifique
Paris, France
4 h-index
10 publications
309 citations
Université Paris-Sud
Orsay, France
4 h-index
9 publications
246 citations
Laboratoire de Recherche en Informatique
Gif-sur-Yvette, France
3 h-index
8 publications
201 citations
Université Paris Cité
Paris, France
2 h-index
3 publications
59 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
2 h-index
3 publications
139 citations
RWTH Aachen University
Aachen, Germany
1 h-index
2 publications
26 citations

University of Glasgow
Glasgow, United Kingdom
1 h-index
1 publications
46 citations
Kyushu University
Fukuoka, Japan
1 h-index
1 publications
45 citations
1–8 of 25
1 publications · 18 citations
1
h-index
1 publications · 15 citations
1
h-index
1 publications · 46 citations
1
h-index
1 publications · 50 citations
1
h-index
1–4