Supervisory control of a class of discrete event processes
SIAM Journal on Control and Optimization
The complexity of Markov decision processes
Mathematics of Operations Research
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Trace theory for automatic hierarchical verification of speed-independent circuits
Trace theory for automatic hierarchical verification of speed-independent circuits
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The complexity of stochastic games
Information and Computation
Languages, automata, and logic
Handbook of formal languages, vol. 3
Discrete-time control for rectangular hybrid automata
Theoretical Computer Science
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
A dynamic logic of multiprocessing with incomplete information
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Alternating-time temporal logic
Journal of the ACM (JACM)
Realizable and Unrealizable Specifications of Reactive Systems
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Universal games of incomplete information
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Recognizing ?-regular Languages with Probabilistic Automata
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
Theoretical Computer Science
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Inferring Synchronization under Limited Observability
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
On the expressiveness and complexity of randomization in finite state monitors
Journal of the ACM (JACM)
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
The Effect of Tossing Coins in Omega-Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Power of Randomization in Automata on Infinite Strings
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
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
Qualitative analysis of partially-observable Markov decision processes
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
The complexity of partial-observation parity games
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Quantitative synthesis for concurrent programs
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
A lattice theory for solving games of imperfect information
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Antichain algorithms for finite automata
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Temporal-Logic-Based Reactive Mission and Motion Planning
IEEE Transactions on Robotics
Decidable Problems for Probabilistic Automata on Infinite Words
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Towards communication-based steering of complex distributed systems
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
A survey of partial-observation stochastic parity games
Formal Methods in System Design
Hi-index | 0.00 |
We consider two-player stochastic games played on finite graphs with reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1), or positively (i.e., with positive probability), no matter the strategy of the second player. We classify such games according to the information and the power of randomization available to the players. On the basis of information, the game can be one-sided with either (a) player 1, or (b) player 2 having partial observation (and the other player has perfect observation), or two-sided with (c) both players having partial observation. On the basis of randomization, the players (a) may not be allowed to use randomization (pure strategies), or (b) may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) may use full randomization. Our main results for pure strategies are as follows. (1) For one-sided games with player 1 having partial observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strategies are not sufficient, and we present an exponential upper bound on memory both for almostsure and positive winning strategies; we show that the problem of deciding the existence of almost-sure and positive winning strategies for player 1 is EXPTIME-complete. (2) For one-sided games with player 2 having partial observation we show that non-elementary memory is both necessary and sufficient for both almost-sure and positive winning strategies. (3) We show that for the general (two-sided) case finite-memory strategies are sufficient for both positive and almost-sure winning, and at least non-elementary memory is required. We establish the equivalence of the almost-sure winning problems for pure strategies and for randomized strategies with actions invisible. Our equivalence result exhibits serious flaws in previous results of the literature: we show a non-elementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed.