Simplicial Models for the Epistemic Logic of Faulty Agents

Eric Goubault, Roman Kniazev, Jeremy Ledent, Sergio Rajsbaum
11/2/2023
cs.LOcs.AIcs.DC

No confident code implementation found for this paper.

Abstract

In recent years, several authors have been investigating simplicial models, a model of epistemic logic based on higher-dimensional structures called simplicial complexes. In the original formulation, simplicial models were always assumed to be pure, meaning that all worlds have the same dimension. This is equivalent to the standard S5n semantics of epistemic logic, based on Kripke models. By removing the assumption that models must be pure, we can go beyond the usual Kripke semantics and study epistemic logics where the number of agents participating in a world can vary. This approach has been developed in a number of papers, with applications in fault-tolerant distributed computing where processes may crash during the execution of a system. A difficulty that arises is that subtle design choices in the definition of impure simplicial models can result in different axioms of the resulting logic. In this paper, we classify those design choices systematically, and axiomatize the corresponding logics. We illustrate them via distributed computing examples of synchronous systems where processes may crash.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{goubault2023simplicial,
  title  = {Simplicial Models for the Epistemic Logic of Faulty Agents},
  author = {Eric Goubault and Roman Kniazev and Jeremy Ledent and Sergio Rajsbaum},
  year   = {2023},
  eprint = {2311.01351},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2311.01351v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2311.01351.svg)](https://codeofpaper.com/paper/2311.01351)

Discussion