TY - UNPB

T1 - Reactive Proof Labeling Schemes for Distributed Decision

AU - Chen, Jiaqi

AU - Dolev, Shlomi

AU - Kutten, Shay

PY - 2020/11/1

Y1 - 2020/11/1

N2 - We generalize the definition of Proof Labeling Schemes to reactive
systems, that is, systems where the configuration is supposed to keep
changing forever. As an example, we address the main classical test case
of reactive tasks, namely, the task of token passing. Different RPLSs
are given for the cases that the network is assumed to be a tree or an
anonymous ring, or a general graph, and the sizes of RPLSs' labels are
analyzed. We also address the question of whether an RPLS exists. First,
on the positive side, we show that there exists an RPLS for any
distributed task for a family of graphs with unique identities. For the
case of anonymous networks (even for the special case of rings),
interestingly, it is known that no token passing algorithm is possible
even if the number n of nodes is known. Nevertheless, we show that an
RPLS is possible. On the negative side, we show that if one drops the
assumption that n is known, then the construction becomes impossible.

AB - We generalize the definition of Proof Labeling Schemes to reactive
systems, that is, systems where the configuration is supposed to keep
changing forever. As an example, we address the main classical test case
of reactive tasks, namely, the task of token passing. Different RPLSs
are given for the cases that the network is assumed to be a tree or an
anonymous ring, or a general graph, and the sizes of RPLSs' labels are
analyzed. We also address the question of whether an RPLS exists. First,
on the positive side, we show that there exists an RPLS for any
distributed task for a family of graphs with unique identities. For the
case of anonymous networks (even for the special case of rings),
interestingly, it is known that no token passing algorithm is possible
even if the number n of nodes is known. Nevertheless, we show that an
RPLS is possible. On the negative side, we show that if one drops the
assumption that n is known, then the construction becomes impossible.

KW - Computer Science - Distributed

KW - Parallel

KW - and Cluster Computing

M3 - Preprint

BT - Reactive Proof Labeling Schemes for Distributed Decision

ER -