--
Laurence Pilard
(GALAC, LRI)
Summary: We analyse the impact of transient and Byzantine faults on the construction of a maximal matching in a general network.
In particular, we consider the self-stabilizing algorithm called AnonyMatch presented by Cohen et al. in PPL'2016 for computing such a matching.
Since self-stabilization is transient fault tolerant, we ...
