Identifying all preorders on the subdistribution monad

DOI10.1016/j.entcs.2014.10.017zbMath1337.68192OpenAlexW2002923606WikidataQ113317836 ScholiaQ113317836MaRDI QIDQ283773

Tetsuya Sato

Publication date: 13 May 2016

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

zbMATH Keywords

coalgebrasmonadspreordersprobabilistic bisimulationprobabilistic transition systems

Mathematics Subject Classification ID

Partial orders, general (06A06) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Generic weakest precondition semantics from monads enriched with order ⋮ Divergences on monads for relational program logics

Cites Work

• Probabilistic systems coalgebraically: a survey
• Bisimulation through probabilistic testing
• Fixpoint semantics and simulation
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Congruences of convex algebras.
• Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems
• Generic Forward and Backward Simulations II: Probabilistic Simulation
• Preorders on Monads and Coalgebraic Simulations
• Generic Trace Semantics via Coinduction
• Distributing probability over non-determinism
• Unnamed Item
• Unnamed Item

This page was built for publication: Identifying all preorders on the subdistribution monad