A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks

DOI10.1016/j.jlamp.2021.100662zbMath1502.68195OpenAlexW3128303183MaRDI QIDQ2043796

Marijana Lazić, Jérémy Ledent, Sergio Rajsbaum, Eric Goubault, Hans P. van Ditmarsch

Publication date: 3 August 2021

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2021.100662

zbMATH Keywords

distributed computingcovering spacescombinatorial topologydynamic epistemic logicequality negation

Mathematics Subject Classification ID

Covering spaces and low-dimensional topology (57M10) Logics of knowledge and belief (including belief change) (03B42) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Communication pattern logic: epistemic and topological views ⋮ Impure Simplicial Complexes: Complete Axiomatization ⋮ A Spatial Logic for Simplicial Models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Action emulation
• A dynamic epistemic logic analysis of the equality negation task
• Logics of communication and change
• Arrow update synthesis
• Covering complexes with applications to algebra
• Locality and checkability in wait-free computing
• The topological structure of asynchronous computability
• A combinatorial characterization of the distributed 1-solvable tasks
• Dynamic Epistemic Logic and Knowledge Puzzles
• Impossibility of distributed consensus with one faulty process
• Three-Processor Tasks Are Undecidable
• All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust
• The expressivity of update logics
• On the robustness of Herlihy's hierarchy

This page was built for publication: A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks