Approximating Markov Processes by Averaging
From MaRDI portal
Recommendations
Cited in
(18)- Approximating labelled Markov processes
- Analysis of averages over distributions of Markov processes
- A categorical characterization of relative entropy on standard Borel spaces
- Approximating bisimilarity for Markov processes
- A metrized duality theorem for Markov processes
- Approximating labelled Markov processes again!
- Taking it to the limit: approximate reasoning for Markov processes
- Averaging for a Fully Coupled Piecewise-Deterministic Markov Process in Infinite Dimensions
- Measurable stochastics for Brane calculus
- Approximating Markov processes through filtration
- Anatomy of a domain of continuous random variables. II
- Towards a categorical account of conditional probability
- A logical duality for underspecified probabilistic systems
- Probabilistic model checking of labelled Markov processes via finite approximate bisimulations
- Bisimulation for Markov decision processes through families of functional expressions
- Approximating Markov processes by averaging
- A categorical characterization of relative entropy on standard Borel spaces
- Averaging along a Markov chain
This page was built for publication: Approximating Markov Processes by Averaging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5902151)