Identifying all preorders on the subdistribution monad
From MaRDI portal
(Redirected from Publication:283773)
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Partial orders, general (06A06) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
- On saturated prefilter monads
- On monad of order-preserving functionals
- Representing preorders with injective monotones
- The order-sobrification monad
- The saturated prefilter monad
- Preorders on monads and coalgebraic simulations
- Order-adjoint monads and injective objects
- Toward a theory of monomial preorders
- Ordinals in Frobenius monads
- Publication:3824405
Cites work
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Bisimulation through probabilistic testing
- Coalgebraic trace semantics for combined possibilitistic and probabilistic systems
- Congruences of convex algebras.
- Distributing probability over non-determinism
- Fixpoint semantics and simulation
- Generic Trace Semantics via Coinduction
- Generic forward and backward simulations. II: Probabilistic simulation
- Preorders on monads and coalgebraic simulations
- Probabilistic systems coalgebraically: a survey
- Simulations in coalgebra
Cited in
(3)
This page was built for publication: Identifying all preorders on the subdistribution monad
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283773)
