Supervisory control of a class of discrete event processes
SIAM Journal on Control and Optimization
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Languages, automata, and logic
Handbook of formal languages, vol. 3
Information and Computation
Alternating-time temporal logic
Journal of the ACM (JACM)
Interface Theories for Component-Based Design
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Universal games of incomplete information
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Qualitative Concurrent Stochastic Games with Imperfect Information
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Qualitative Determinacy and Decidability of Stochastic Games with Signals
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
On decision problems for probabilistic Büchi automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Probabilistic automata on finite words: decidable and undecidable problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Probabilistic automata on infinite words: decidability and undecidability results
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Partial-Observation Stochastic Games: How to Win When Belief Fails
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Compositional verification and optimization of interactive markov chains
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
A survey of partial-observation stochastic parity games
Formal Methods in System Design
Solving Partial-Information Stochastic Parity Games
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided partial-observation (one player has partial-observation and the other player has complete-observation); and (c) complete-observation (both players have complete view of the game). We survey the complexity results for the problem of deciding the winner in various classes of partial-observation games with ω-regular winning conditions specified as parity objectives. We present a reduction from the class of parity objectives that depend on sequence of states of the game to the sub-class of parity objectives that only depend on the sequence of observations. We also establish that partial-observation acyclic games are PSPACE-complete.