Bisimulation for probabilistic transition systems: A coalgebraic approach

DOI10.1007/3-540-63165-8_202zbMath1401.68236OpenAlexW1907364945MaRDI QIDQ4571977

E. P. de Vink, Jan J. M. M. Rutten

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/4629

zbMATH Keywords

coalgebraBorel measurebisimulationfinal coalgebraultrametric spaceprobabilistic transition system

Mathematics Subject Classification ID

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

Related Items

Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey, Deciding bisimilarity and similarity for probabilistic processes., On the structure of categories of coalgebras, Approximating Markov Processes by Averaging, Bisimulation and Simulation Relations for Markov Chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving reflexive domain equations in a category of complete metric spaces
• Bisimulation through probabilistic testing
• Reactive, generative, and stratified models of probabilistic processes
• Terminal coalgebras in well-founded set theory
• Hybrid automata with finite bisimulations
• A final coalgebra theorem