Strategy Synthesis for Markov Decision Processes and Branching-Time Logics

DOI10.1007/978-3-540-74407-8_29MaRDI QIDQ3525653zbMATH OpenOpenAlexFDO

Authors Tomáš Brázdil, Vojtech Forejt

Publication date 18 September 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-74407-8_29

Mathematics Subject Classification ID

Temporal logic (03B44) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Markov and semi-Markov decision processes (90C40) Applications of game theory (91A80)

Recommendations

• Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives
• Qualitative Logics and Equivalences for Probabilistic Systems
• Reachability in recursive Markov decision processes
• scientific article; zbMATH DE number 2163041
• Stochastic game logic

Cited in

(5)

• The complexity of synchronizing Markov decision processes
• A dynamic epistemic framework for reasoning about conformant probabilistic plans
• A Temporal Logic for the Interaction of Strategies
• Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives
• Strategy Representation by Decision Trees with Linear Classifiers

This page was built for publication: Strategy Synthesis for Markov Decision Processes and Branching-Time Logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525653)