Approximating Euclidean by Imprecise Markov Decision Processes
- 29 October 2020
- book chapter
- Published by Springer Nature
- p. 275-289
Abstract
No abstract availableKeywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Teaching Stratego to Play Ball: Optimal Synthesis for Continuous Space MDPs2019
- Computing Inferences for Large-Scale Continuous-Time Markov Chains by Combining Lumping with Imprecision2018
- Approximate Abstractions of Markov Chains with Interval Decision ProcessesIFAC-PapersOnLine, 2018
- Uppaal Stratego2015
- On the complexity of model checking interval-valued discrete time Markov chainsInformation Processing Letters, 2013
- Partially observable Markov decision processes with imprecise parametersArtificial Intelligence, 2007
- Game-based Abstraction for Markov Decision Processes2006
- Optimal state-space lumping in Markov chainsInformation Processing Letters, 2003
- Markov Decision Processes with Imprecise Transition ProbabilitiesOperations Research, 1994
- A finite characterization of weak lumpable Markov processes. Part I: The discrete time caseStochastic Processes and their Applications, 1991