Strategy Synthesis for Markov Decision Processes and Branching-Time Logics
From MaRDI portal
Publication:3525653
DOI10.1007/978-3-540-74407-8_29zbMath1151.68472OpenAlexW1546990525MaRDI QIDQ3525653
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
Applications of game theory (91A80) Markov and semi-Markov decision processes (90C40) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)
Related Items (2)
Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives ⋮ A dynamic epistemic framework for reasoning about conformant probabilistic plans
This page was built for publication: Strategy Synthesis for Markov Decision Processes and Branching-Time Logics