A meta-modal logic for bisimulations
Logic in Computer Science
2026-04-14 v3 Logic
Abstract
We propose a modal study of the notion of bisimulation. Our contribution is threefold. First, we extend the basic modal language with a new modality , whose intended meaning is universal quantification over all states that are bisimilar to the current one. We show that bisimulations are definable in this object language via frame correspondence. Second, we provide a sound and complete axiomatisation of the class of all pairs of Kripke models that are bisimulation-related. Third, we show that the satisfiability problem of our logic is decidable and PSPACE-complete via a translation to standard modal logic under a simple frame condition. All our results are encoded and verified by Isabelle/HOL.
Cite
@article{arxiv.2507.15117,
title = {A meta-modal logic for bisimulations},
author = {Alfredo Burrieza and Fernando Soler-Toscano and Antonio Yuste-Ginel},
journal= {arXiv preprint arXiv:2507.15117},
year = {2026}
}
Comments
27 pages