A simplicial complex model for dynamic epistemic logic to study distributed task computability
zbMATH Open1498.03045MaRDI QIDQ3384879FDOQ3384879
Authors: Éric Goubault, Jérémy Ledent, Sergio Rajsbaum 
Publication date: 17 December 2021
Full work available at URL: http://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF18.6
Recommendations
- A simplicial complex model for dynamic epistemic logic to study distributed task computability
- A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks
- On knowledge and communication complexity in distributed systems
- On the computational complexity of model checking for dynamic epistemic logic with S5 models
- Symbolic model checking for Dynamic Epistemic Logic — S5 and beyond*
Logics of knowledge and belief (including belief change) (03B42) Logic in computer science (03B70) Homotopical algebra, Quillen model categories, derivators (18N40) Abstract and axiomatic homotopy theory in algebraic topology (55U35) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- The logic of public announcements, common knowledge, and private suspicions
- Title not available (Why is that?)
- Dynamic epistemic logic
- Impossibility of distributed consensus with one faulty process
- An Intuitionistic Epistemic Logic for Sequential Consistency on Shared Memory
- Simulations and reductions for colorless tasks
- A combinatorial characterization of the distributed 1-solvable tasks
- Three-Processor Tasks Are Undecidable
- Title not available (Why is that?)
- The Combinatorial Structure of Wait-Free Solvable Tasks
- Chromatic subdivision of a simplicial complex
- Unbeatable set consensus via topological and combinatorial reasoning
- Collapsibility of read/write models using discrete Morse theory
- Computable obstructions to wait-free computability
- Relating knowledge and coordinated action: the knowledge of preconditions principle
- Interpreted systems and Kripke models for multiagent systems from a categorical perspective
- Reasoning about knowledge and messages in asynchronous multi-agent systems
Cited In (9)
- Networks beyond pairwise interactions: structure and dynamics
- A simplicial complex model for dynamic epistemic logic to study distributed task computability
- Wanted dead or alive: epistemic logic for impure simplicial complexes
- Geometric aspects of multiagent systems
- On knowledge and communication complexity in distributed systems
- Tasks in modular proofs of concurrent algorithms
- A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks
- Communication pattern models: an extension of action models for dynamic-network distributed systems
- Tasks in modular proofs of concurrent algorithms
This page was built for publication: A simplicial complex model for dynamic epistemic logic to study distributed task computability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384879)
