Reachability in Recursive Markov Decision Processes

DOI10.1007/11817949_24zbMath1151.68509OpenAlexW1506542859MaRDI QIDQ5756595

Václav Brožek, Tomáš Brázdil, Vojtěch Forejt, Antonín Kučera

Publication date: 4 September 2007

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

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.178.6733

Mathematics Subject Classification ID

Games involving graphs (91A43) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Approximating the Termination Value of One-Counter MDPs and Stochastic Games

This page was built for publication: Reachability in Recursive Markov Decision Processes