Bisimulation for Markov Decision Processes through Families of Functional Expressions
From MaRDI portal
Publication:5418971
DOI10.1007/978-3-319-06880-0_17zbMath1408.68100OpenAlexW153160029MaRDI QIDQ5418971
Doina Precup, Norm Ferns, Sophia Knight
Publication date: 2 June 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-06880-0_17
Continuous-time Markov processes on general state spaces (60J25) 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
Robust Control for Dynamical Systems with Non-Gaussian Noise via Formal Abstractions ⋮ Converging from branching to linear metrics on Markov chains
Cites Work
- Metrics for labelled Markov processes
- A calculus of communicating systems
- Stochastic optimal control. The discrete time case
- Bisimulation through probabilistic testing
- On the empirical estimation of integral probability metrics
- Recursively defined metric spaces without contraction
- Bisimulation for labelled Markov processes
- On the Complexity of Computing Probabilistic Bisimilarity
- Bisimulation Metrics for Continuous Markov Decision Processes
- Stochastic Orders Generated by Integrals: a Unified Study
- Integral Probability Metrics and Their Generating Classes of Functions
- Real Analysis and Probability
- On Choosing and Bounding Probability Metrics
- Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
- Approximating Markov Processes by Averaging
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item