A dynamic epistemic logic analysis of the equality negation task

In this paper we study the solvability of the equality negation task in a simple wait-free model where processes communicate by reading and writing shared variables or exchanging messages. In this task, two processes start with a private input value in the set {0,1,2}, and after communicating, each one must decide a binary output value, so that the outputs of the processes are the same if and only if the input values of the processes are different. This task is already known to be unsolvable; our goal here is to prove this result using the dynamic epistemic logic (DEL) approach introduced by Goubault, Ledent and Rajsbaum in GandALF 2018. We show that in fact, there is no epistemic logic formula that explains why the task is unsolvable. We fix this issue by extending the language of our DEL framework, which allows us to construct such a formula, and discuss its utility.

[1]  Sergio Rajsbaum,et al.  A Simplicial Complex Model for Dynamic Epistemic Logic to study Distributed Task Computability , 2018, GandALF.

[2]  Sergio Rajsbaum,et al.  Wait-Free Solvability of Equality Negation Tasks , 2019, DISC.

[3]  Prasad Jayanti.  On the robustness of Herlihy's hierarchy , 1993, PODC '93.

[4]  Vassos Hadzilacos,et al.  All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust , 2000, SIAM J. Comput..

[5]  Amos Israeli,et al.  On processor coordination using asynchronous hardware , 1987, PODC '87.

[6]  Marcin Paprzycki,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..

[7]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[8]  Dmitry N. Kozlov,et al.  Combinatorial Algebraic Topology , 2007, Algorithms and computation in mathematics.

[9]  Lawrence S. Moss,et al.  The Logic of Public Announcements and Common Knowledge and Private Suspicions , 1998, TARK.

[10]  Jelle Gerbrandy,et al.  Dynamic epistemic logic , 1998 .

[11]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[12]  Eli Gafni,et al.  Three-Processor Tasks Are Undecidable , 1999, SIAM J. Comput..

[13]  Maurice Herlihy,et al.  Wait-free synchronization , 1991, TOPL.

[14]  Maurice Herlihy,et al.  The decidability of distributed decision tasks (extended abstract) , 1997, STOC '97.

[15]  Maurice Herlihy,et al.  Distributed Computing Through Combinatorial Topology , 2013 .

[16]  Shmuel Zaks,et al.  A Combinatorial Characterization of the Distributed 1-Solvable Tasks , 1990, J. Algorithms.

[17]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[18]  Maurice Herlihy,et al.  The topological structure of asynchronous computability , 1999, JACM.