Qualitative reachability for open interval Markov chains

DOI10.1007/978-3-030-00250-3_11OpenAlexW2888996394MaRDI QIDQ1798917

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)

Related Items (5)

Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities ⋮ The complexity of reachability in parametric Markov decision processes ⋮ Probabilistic timed automata with clock-dependent probabilities ⋮ Unnamed Item ⋮ On the Complexity of Reachability in Parametric Markov Decision Processes

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