A simplicial model for KB4n : epistemic logic with agents that may die

Goubault, Éric and Ledent, Jérémy and Rajsbaum, Sergio; Berenbrink, Petra and Monmege, Benjamin, eds. (2022) A simplicial model for KB4n : epistemic logic with agents that may die. In: 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics, LIPIcs, 219 . Schloss Dagstuhl - Leibniz-Zentrum für Informatik, FRA, 33:1--33:20. ISBN 9783959772228 (https://doi.org/10.4230/LIPIcs.STACS.2022.33)

[thumbnail of Goubault-etal-STACS2022-A-simplicial-model-for-KB4n]
Preview
 Text. Filename: Goubault_etal_STACS2022_A_simplicial_model_for_KB4n.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo
Download (1MB)| Preview

Abstract

The standard semantics of multi-agent epistemic logic S5n is based on Kripke models whose accessibility relations are reflexive, symmetric and transitive. This one dimensional structure contains implicit higher-dimensional information beyond pairwise interactions, that we formalized as pure simplicial models in a previous work in Information and Computation 2021 [10]. Here we extend the theory to encompass simplicial models that are not necessarily pure. The corresponding class of Kripke models are those where the accessibility relation is symmetric and transitive, but might not be reflexive. Such models correspond to the epistemic logic KB4n. Impure simplicial models arise in situations where two possible worlds may not have the same set of agents. We illustrate it with distributed computing examples of synchronous systems where processes may crash.

ORCID iDs

Goubault, Éric, Ledent, Jérémy ORCID logoORCID: https://orcid.org/0000-0001-7375-4725 and Rajsbaum, Sergio; Berenbrink, Petra and Monmege, Benjamin
CORE (COnnecting REpositories)