TY - GEN
T1 - Invited Paper
T2 - 22nd International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2020
AU - Chen, Jiaqi
AU - Dolev, Shlomi
AU - Kutten, Shay
N1 - Funding Information:
S. Dolev—work is supported by the Rita Altura Trust Chair in Computer Science, and is partially supported by a grant from the Ministry of Science and Technology, Israel & the Japan Science and Technology Agency (JST), and the German Research Funding (DFG, Grant#8767581199). S. Kutten—The research of Shay Kutten was supported in part by a grant from the Hiroshi Fujiwara Cyber Security Research Center at the Technion.
Publisher Copyright:
© 2020, Springer Nature Switzerland AG.
PY - 2020/1/1
Y1 - 2020/1/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 whether an RPLS exists. Interestingly, for the anonymous ring, it is known that no token passing algorithm is possible even if the number n is known. Nevertheless, we show that an RPLS is possible. We show that if one drops the assumption that n is known, 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 whether an RPLS exists. Interestingly, for the anonymous ring, it is known that no token passing algorithm is possible even if the number n is known. Nevertheless, we show that an RPLS is possible. We show that if one drops the assumption that n is known, the construction becomes impossible.
KW - Distributed proofs
KW - Distributed reactive systems
KW - Proof Labeling Schemes
UR - http://www.scopus.com/inward/record.url?scp=85097642488&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-64348-5_7
DO - 10.1007/978-3-030-64348-5_7
M3 - Conference contribution
AN - SCOPUS:85097642488
SN - 9783030643478
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 81
EP - 96
BT - Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Proceedings
A2 - Devismes, Stéphane
A2 - Mittal, Neeraj
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 18 November 2020 through 21 November 2020
ER -