A monoidal view on fixpoint checks
From MaRDI portal
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- A lattice-theoretical view of strategy iteration
- A monoidal view on fixpoint checks
- An algebraic presentation of term graphs, via gs-monoidal categories
- An axiomatization of graphs
- Characteristic logics for behavioural hemimetrics via fuzzy lax extensions
- Coalgebraic behavioral metrics
- Coalgebraic modal logic: soundness, completeness and decidability of local consequence
- Computing probabilistic bisimilarity distances for probabilistic automata
- Expressivity of coalgebraic modal logic: the limits and beyond
- Fixpoint theory -- upside down
- Fixpoint Theory -- Upside Down
- From gs-monoidal to oplax cartesian categories: constructions and functorial completeness
- Graph expressions and graph rewritings
- scientific article; zbMATH DE number 1189283 (Why is no real title available?)
- scientific article; zbMATH DE number 549853 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- scientific article; zbMATH DE number 2221683 (Why is no real title available?)
- Hypergraph construction and its application to the static analysis of concurrent systems
- Metrics for labelled Markov processes
- On the complexity of computing probabilistic bisimilarity
- On-the-fly computation of bisimilarity distances
- Optimal Transport
- Temporal abstract interpretation
- Universal coalgebra: A theory of systems
- Up-to techniques for behavioural metrics via fibrations
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 Q6925633)
