Qualitative reachability for open interval Markov chains

DOI10.1007/978-3-030-00250-3_11MaRDI QIDQ1798917zbMATH OpenOpenAlexFDO

Authors Jeremy Sproston

Publication date 23 October 2018

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

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Model checking of open interval Markov chains
• Quantitative analysis of interval Markov chains
• Interval-valued finite Markov chains
• Finite discrete time Markov chains with interval probabilities
• LTL model checking of interval Markov chains

Cited in

(7)

• Reachability in augmented interval Markov chains
• The complexity of reachability in parametric Markov decision processes
• On the Complexity of Reachability in Parametric Markov Decision Processes
• Model checking of open interval Markov chains
• Reachability problems for Markov chains
• Probabilistic timed automata with one clock and initialised clock-dependent probabilities
• Probabilistic timed automata with one clock and initialised clock-dependent probabilities

This page was built for publication: Qualitative reachability for open interval Markov chains

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