A monoidal view on fixpoint checks
From MaRDI portal
Publication:6535504
DOI10.1007/978-3-031-36709-0_1zbMATH Open1545.6808MaRDI QIDQ6535504
Tommaso Padoan, Timo Matt, Barbara König, Richard Eggert, Paolo Baldan
Publication date: 12 January 2024
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) MV-algebras (06D35) Monoidal categories, symmetric monoidal categories (18M05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Metrics for labelled Markov processes
- Universal coalgebra: A theory of systems
- Coalgebraic modal logic: soundness, completeness and decidability of local consequence
- An algebraic presentation of term graphs, via gs-monoidal categories
- Fixpoint theory -- upside down
- Expressivity of coalgebraic modal logic: the limits and beyond
- A lattice-theoretical fixpoint theorem and its applications
- On the Complexity of Computing Probabilistic Bisimilarity
- Introduction to Bisimulation and Coinduction
- Up-To Techniques for Behavioural Metrics via Fibrations
- A Geometric Approach to MV-Algebras
- Optimal Transport
- A monoidal view on fixpoint checks
- A lattice-theoretical view of strategy iteration
Related Items (1)
This page was built for publication: A monoidal view on fixpoint checks
