Polynomial-Time Verification of PCTL Properties of MDPs with Convex Uncertainties

DOI10.1007/978-3-642-39799-8_35zbMath1435.68202OpenAlexW2098597080WikidataQ57380212 ScholiaQ57380212MaRDI QIDQ2864840

No author found.

Publication date: 26 November 2013

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39799-8_35

zbMATH Keywords

Markov decision processesprobabilistic computation tree logic

Mathematics Subject Classification ID

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 (13)

Robust Control for Dynamical Systems with Non-Gaussian Noise via Formal Abstractions ⋮ Scenario-Based Verification of Uncertain MDPs ⋮ Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities ⋮ The complexity of reachability in parametric Markov decision processes ⋮ Multi-objective Parameter Synthesis in Probabilistic Hybrid Systems ⋮ Parameter synthesis in Markov models: a gentle survey ⋮ Distributionally Robust Strategy Synthesis for Switched Stochastic Systems ⋮ Unnamed Item ⋮ Sampling-Based Verification of CTMCs with Uncertain Rates ⋮ On the Complexity of Reachability in Parametric Markov Decision Processes ⋮ Sequential Convex Programming for the Efficient Verification of Parametric MDPs ⋮ Reachability in parametric interval Markov chains using constraints ⋮ Deniable Functional Encryption

This page was built for publication: Polynomial-Time Verification of PCTL Properties of MDPs with Convex Uncertainties