On the complexity of model checking interval-valued discrete time Markov chains
From MaRDI portal
Publication:1943636
DOI10.1016/j.ipl.2013.01.004zbMath1259.68150OpenAlexW2144502731MaRDI QIDQ1943636
Marta Kwiatkowska, Taolue Chen, Tingting Han
Publication date: 20 March 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2013.01.004
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (6)
Parameter Synthesis Algorithms for Parametric Interval Markov Chains ⋮ Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities ⋮ The complexity of reachability in parametric Markov decision processes ⋮ Quantitative analysis of interval Markov chains ⋮ Unnamed Item ⋮ On the Complexity of Reachability in Parametric Markov Decision Processes
This page was built for publication: On the complexity of model checking interval-valued discrete time Markov chains