Perturbation Analysis in Verification of Discrete-Time Markov Chains

DOI10.1007/978-3-662-44584-6_16zbMath1417.68100OpenAlexW1892040981MaRDI QIDQ3190120

Yuan Feng, Taolue Chen, David Samuel Rosenblum, Guoxin Su

Publication date: 15 September 2014

Published in: CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10453/33132

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (5)

Gradient-descent for randomized controllers under partial observability ⋮ The complexity of reachability in parametric Markov decision processes ⋮ Parameter synthesis in Markov models: a gentle survey ⋮ POMDP controllers with optimal budget ⋮ On the Complexity of Reachability in Parametric Markov Decision Processes

This page was built for publication: Perturbation Analysis in Verification of Discrete-Time Markov Chains