Partial Product Updates for Agents of Detectable Failure and Logical Obstruction to Task Solvability (2303.16437v2)
Abstract: The logical method proposed by Goubault, Ledent, and Rajsbaum provides a novel way to show the unsolvability of distributed tasks by means of a logical obstruction, which is an epistemic logic formula describing the reason of unsolvability. In this paper, we introduce the notion of partial product update, which refines that of product update in the original logical method, to encompass distributed tasks and protocols modeled by impure simplicial complexes. With this extended notion of partial product update, the original logical method is generalized so that it allows the application of logical obstruction to show unsolvability results in a distributed environment where the failure of agents is detectable. We demonstrate the use of the logical method by giving a concrete logical obstruction and showing that the consensus task is unsolvable by the single-round synchronous message-passing protocol.
- Reasoning About Knowledge. MIT press, 2004.
- Impossibility of distributed consensus with one faulty process. J. ACM, 32(2):374–382, 1985.
- A simplicial complex model for dynamic epistemic logic to study distributed task computability. Inf. Comput., 278:104597, 2021.
- A Simplicial Model for KB4nn{}_{\mbox{n}}start_FLOATSUBSCRIPT n end_FLOATSUBSCRIPT: Epistemic Logic with Agents That May Die. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), volume 219 of LIPIcs, pages 33:1–33:20, 2022.
- Maurice Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124–149, 1991.
- Distributed Computing Through Combinatorial Topology. Morgan Kaufmann, 2013.
- An overview of synchronous message-passing and topology. Electron. Notes Theor. Comput. Sci., 39(2):1–17, 2001.
- Jérémy Ledent. Geometric semantics for asynchronous computability. PhD thesis, University of Paris-Saclay, France, 2019. URL: https://tel.archives-ouvertes.fr/tel-02445180.
- Yutaro Nishida. Impossibility of k𝑘kitalic_k-set agreement via dynamic epistemic logic (in Japanese). In Algebraic system, Logic, Language and Related Areas in Computer Sciences II, volume 2188 of RIMS Kôkyûroku, pages 96–105, Feb. 2020. URL: http://hdl.handle.net/2433/265621.
- Richard P. Stanley. Enumerative Combinatorics, volume 1 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, 2nd edition, 2011.
- Dynamic Epistemic Logic, volume 337 of Synthese Library. Springer, 2008.
- Logical obstruction to set agreement tasks for superset-closed adversaries, 2020. URL: https://arxiv.org/abs/2011.13630.