The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies
Authors:
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 242-257
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Partial-Observation Stochastic Games: How to Win When Belief Fails2012
- Qualitative Analysis of Partially-Observable Markov Decision Processes2010
- On Decision Problems for Probabilistic Büchi Automata2008
- Algorithms for Omega-Regular Games with Imperfect InformationLogical Methods in Computer Science, 2007
- Simple Stochastic Parity Games2003
- Alternating-time temporal logicJournal of the ACM, 2002
- The complexity of probabilistic verificationJournal of the ACM, 1995
- Infinite games played on finite graphsAnnals of Pure and Applied Logic, 1993
- Alternating automata, the weak monadic theory of the tree, and its complexityLecture Notes in Computer Science, 1986
- Trees, automata, and games1982