A monoidal view on fixpoint checks
From MaRDI portal
Publication:6535504
DOI10.1007/978-3-031-36709-0_1zbMATH Open1545.6808MaRDI QIDQ6535504FDOQ6535504
Authors: Paolo Baldan, Richard Eggert, Barbara König, Timo Matt, Tommaso Padoan 
Publication date: 12 January 2024
Recommendations
MV-algebras (06D35) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Monoidal categories, symmetric monoidal categories (18M05)
Cites Work
- Optimal Transport
- Universal coalgebra: A theory of systems
- A lattice-theoretical fixpoint theorem and its applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Metrics for labelled Markov processes
- Coalgebraic modal logic: soundness, completeness and decidability of local consequence
- Expressivity of coalgebraic modal logic: the limits and beyond
- Title not available (Why is that?)
- Introduction to bisimulation and coinduction
- On the complexity of computing probabilistic bisimilarity
- An algebraic presentation of term graphs, via gs-monoidal categories
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fixpoint theory -- upside down
- Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains
- Coalgebraic behavioral metrics
- Up-to techniques for behavioural metrics via fibrations
- Computing probabilistic bisimilarity distances for probabilistic automata
- A Geometric Approach to MV-Algebras
- On-the-fly computation of bisimilarity distances
- A monoidal view on fixpoint checks
- A lattice-theoretical view of strategy iteration
Cited In (1)
This page was built for publication: A monoidal view on fixpoint checks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535504)
