Composing Codensity Bisimulations
Mayuko Kori, Kazuki Watanabe, Jurriaan Rot, Shin-ya Katsumata
Abstract
Proving compositionality of behavioral equivalence on state-based systems with respect to algebraic operations is a classical and widely studied problem. We study a categorical formulation of this problem, where operations on state-based systems modeled as coalgebras can be elegantly captured through distributive laws between functors. To prove compositionality, it then suffices to show that this distributive law lifts from sets to relations, giving an explanation of how behavioral equivalence on smaller systems can be combined to obtain behavioral equivalence on the composed system.
In this paper, we refine this approach by focusing on so-called codensity lifting of functors, which gives a very generic presentation of various notions of (bi)similarity as well as quantitative notions such as behavioral metrics on probabilistic systems. The key idea is to use codensity liftings both at the level of algebras and coalgebras, using a new generalization of the codensity lifting. The problem of lifting distributive laws then reduces to the abstract problem of constructing distributive laws between codensity liftings, for which we propose a simplified sufficient condition. Our sufficient condition instantiates to concrete proof methods for compositionality of algebraic operations on various types of state-based systems. We instantiate our results to prove compositionality of qualitative and quantitative properties of deterministic automata. We also explore the limits of our approach by including an example of probabilistic systems, where it is unclear whether the sufficient condition holds, and instead we use our setting to give a direct proof of compositionality.
In addition, we propose a compositional variant of Komorida et al.'s codensity games for bisimilarities. A novel feature of this variant is that it can also compose game invariants, which are subsets of winning positions. Under our sufficient condition of the liftability of distributive laws, composed games give an alternative proof of the preservation of bisimilarities under the composition.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 3bed3aa4-3163-47f2-8e74-3a24b60f7828Cited by top-tier papers1
Ask how each one uses itBuilds on4
- Towards a Higher-Order Mathematical Operational SemanticsSergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas et al.POPL 2023 · 15 citations
- Weak Similarity in Higher-Order Mathematical Operational SemanticsHenning Urbat, Stelios Tsampas, Sergey Goncharov, Stefan Milius et al.LICS 2023 · 10 citations
- Graded Monads and Behavioural Equivalence GamesChase Ford, Stefan Milius, Lutz Schröder, Harsh Beohar et al.LICS 2022 · 6 citations
- Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and ApproximationYuichi Komorida, Shin-ya Katsumata, Clemens Kupke, Jurriaan Rot et al.LICS 2021
Related papers
- Behavioural Conformances based on Lax CouplingsPaul Wild, Lutz SchröderLICS 2025 · 1 citation
- Relators and Notions of Simulation RevisitedSergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder et al.LICS 2025 · 1 citation
- Combining probabilistic and non-deterministic choice via weak distributive lawsAlexandre Goy, Daniela PetrisanLICS 2020 · 30 citations
- Behavioural Preorders via Graded MonadsChase Ford, Stefan Milius, Lutz SchröderLICS 2021 · 8 citations
- Conformance Games for Graded SemanticsJonas Forster, Lutz Schröder, Paul WildLICS 2025 · 2 citations
