Reachability in augmented interval Markov chains

DOI10.1007/978-3-030-30806-3_7OpenAlexW2971988264MaRDI QIDQ2330593

Ventsislav Chonev

Publication date: 22 October 2019

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

zbMATH Keywords

reachabilityinterval Markov decision processes

Mathematics Subject Classification ID

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

Related Items (7)

The complexity of reachability in parametric Markov decision processes ⋮ Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination ⋮ Parameter synthesis in Markov models: a gentle survey ⋮ Are Parametric Markov Chains Monotonic? ⋮ On the Complexity of Reachability in Parametric Markov Decision Processes ⋮ Counterexample-guided inductive synthesis for probabilistic systems ⋮ Inductive synthesis for probabilistic programs reaches new horizons

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