Reachability in augmented interval Markov chains

DOI10.1007/978-3-030-30806-3_7MaRDI QIDQ2330593zbMATH OpenOpenAlexFDO

Authors Ventsislav Chonev

Publication date 22 October 2019

Full work available at URL https://arxiv.org/abs/1701.02996

zbMATH Keywords

interval Markov decision processesreachability

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Markov and semi-Markov decision processes (90C40)

Recommendations

• Qualitative reachability for open interval Markov chains
• LTL model checking of interval Markov chains
• Decision Problems for Interval Markov Chains
• On the complexity of model checking interval-valued discrete time Markov chains

Cited in

(10)

• Counterexample-guided inductive synthesis for probabilistic systems
• Inductive synthesis for probabilistic programs reaches new horizons
• Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
• The complexity of reachability in parametric Markov decision processes
• Are parametric Markov chains monotonic?
• Reachability problems for Markov chains
• On the Complexity of Reachability in Parametric Markov Decision Processes
• Parameter synthesis in Markov models: a gentle survey
• Efficient sensitivity analysis for parametric robust Markov chains
• An oracle-guided approach to constrained policy synthesis under uncertainty

This page was built for publication: Reachability in augmented interval Markov chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2330593)