Probabilistic Bisimulation: Naturally on Distributions

DOI10.1007/978-3-662-44584-6_18zbMath1417.68130arXiv1404.5084OpenAlexW2176767353MaRDI QIDQ3190122

Jan Křetínský, Jan Krčál, Holger Hermanns

Publication date: 15 September 2014

Published in: CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.5084

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (13)

Model independent approach to probabilistic models ⋮ Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies ⋮ Unnamed Item ⋮ The complexity of synchronizing Markov decision processes ⋮ Confluence reduction for Markov automata ⋮ The quest for minimal quotients for probabilistic and Markov automata ⋮ Unnamed Item ⋮ Probabilistic Bisimulation for Realistic Schedulers ⋮ Unnamed Item ⋮ Trace Refinement in Labelled Markov Decision Processes ⋮ Termination in Convex Sets of Distributions ⋮ Unnamed Item ⋮ Bounds for synchronizing Markov decision processes

This page was built for publication: Probabilistic Bisimulation: Naturally on Distributions