Distribution-based bisimulation for labelled Markov processes
From MaRDI portal
Publication:1683448
DOI10.1007/978-3-319-65765-3_10zbMATH Open1494.68184arXiv1706.10049OpenAlexW2963540427MaRDI QIDQ1683448FDOQ1683448
Authors: David N. Jansen, Peng-fei Yang, Lijun Zhang 
Publication date: 1 December 2017
Abstract: In this paper we propose a (sub)distribution-based bisimulation for labelled Markov processes and compare it with earlier definitions of state and event bisimulation, which both only compare states. In contrast to those state-based bisimulations, our distribution bisimulation is weaker, but corresponds more closely to linear properties. We construct a logic and a metric to describe our distribution bisimulation and discuss linearity, continuity and compositional properties.
Full work available at URL: https://arxiv.org/abs/1706.10049
Recommendations
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (11)
- Simulation for lattice-valued doubly labeled transition systems
- Bisimulation on Markov processes over arbitrary measurable spaces
- Bisimilarity of distributionally equivalent Markov transition systems
- Bisimulation for Markov decision processes through families of functional expressions
- Domain theory, testing and simulation for labelled Markov processes
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems
- Bisimulation and Simulation Relations for Markov Chains
- Bisimulation for labelled Markov processes
- Probabilistic bisimulation for realistic schedulers
- Title not available (Why is that?)
- Bisimulations for non-deterministic labelled Markov processes
This page was built for publication: Distribution-based bisimulation for labelled Markov processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1683448)
