Graded monads and behavioural equivalence games
From MaRDI portal
Publication:6649498
DOI10.1145/3531130.3533374MaRDI QIDQ6649498
Lutz Schröder, Harsh Beohar, Chase Ford, Barbara König, Stefan Milius
Publication date: 6 December 2024
Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Theory of computing (68Qxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the final sequence of a finitary set functor
- On coalgebras over algebras
- Relating structure and power: comonadic semantics for computational resources (extended abstract)
- Steps and traces
- Trace semantics via determinization
- Graded monads and rings of polynomials
- The quantitative linear-time-branching-time spectrum
- Towards a Formal Theory of Graded Monads
- Simulations and Bisimulations for Coalgebraic Modal Logics
- Checking NFA equivalence with bisimulations up to congruence
- Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
- Coalgebraic Trace Semantics via Forgetful Logics
- Up-To Techniques for Weighted Systems
- Bisimulation, modal logic and model checking games
- Quantitative Algebraic Reasoning
- Generalizing determinization from automata to coalgebras
- (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras
- A final coalgebra theorem
- On Finitary Functors
- The parametric continuation monad
- Generic Trace Semantics and Graded Monads.
- Parametric effect monads and semantics of effect systems
- Generic Trace Semantics via Coinduction
- Bisimulation verification using the up to techniques
This page was built for publication: Graded monads and behavioural equivalence games
