Identifying all preorders on the subdistribution monad

DOI10.1016/J.ENTCS.2014.10.017zbMATH Open1337.68192OpenAlexW2002923606WikidataQ113317836 ScholiaQ113317836MaRDI QIDQ283773FDOQ283773

Authors: Tetsuya Sato 

Publication date: 13 May 2016

Full work available at URL: https://doi.org/10.1016/j.entcs.2014.10.017

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
• scientific article; zbMATH DE number 4097364

zbMATH Keywords

monadscoalgebraspreordersprobabilistic bisimulationprobabilistic transition systems

Mathematics Subject Classification ID

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)

Cites Work

• Generic forward and backward simulations. II: Probabilistic simulation
• Title not available (Why is that?)
• Generic Trace Semantics via Coinduction
• Bisimulation through probabilistic testing
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Probabilistic systems coalgebraically: a survey
• Fixpoint semantics and simulation
• Congruences of convex algebras.
• Simulations in coalgebra
• Coalgebraic trace semantics for combined possibilitistic and probabilistic systems
• Preorders on monads and coalgebraic simulations
• Distributing probability over non-determinism

Cited In (3)

• Divergences on monads for relational program logics
• Generic weakest precondition semantics from monads enriched with order
• Preorders on monads and coalgebraic simulations

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)