Composing Codensity Bisimulations
Mayuko Kori, Kazuki Watanabe, Jurriaan Rot, Shin-ya Katsumata
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper4
- Towards a Higher-Order Mathematical Operational SemanticsSergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas 等POPL 2023 · 被引用 15 次
- Weak Similarity in Higher-Order Mathematical Operational SemanticsHenning Urbat, Stelios Tsampas, Sergey Goncharov, Stefan Milius 等LICS 2023 · 被引用 10 次
- Graded Monads and Behavioural Equivalence GamesChase Ford, Stefan Milius, Lutz Schröder, Harsh Beohar 等LICS 2022 · 被引用 6 次
- Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and ApproximationYuichi Komorida, Shin-ya Katsumata, Clemens Kupke, Jurriaan Rot 等LICS 2021
相关 Paper
- Behavioural Conformances based on Lax CouplingsPaul Wild, Lutz SchröderLICS 2025 · 被引用 1 次
- Relators and Notions of Simulation RevisitedSergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder 等LICS 2025 · 被引用 1 次
- Combining probabilistic and non-deterministic choice via weak distributive lawsAlexandre Goy, Daniela PetrisanLICS 2020 · 被引用 30 次
- Behavioural Preorders via Graded MonadsChase Ford, Stefan Milius, Lutz SchröderLICS 2021 · 被引用 8 次
- Conformance Games for Graded SemanticsJonas Forster, Lutz Schröder, Paul WildLICS 2025 · 被引用 2 次
