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 temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
The complexity of stochastic games
Information and Computation
A subexponential randomized algorithm for the simple stochastic game problem
Information and Computation
The complexity of probabilistic verification
Journal of the ACM (JACM)
The complexity of mean payoff games on graphs
Theoretical Computer Science
Theory of hybrid systems and discrete event systems
Theory of hybrid systems and discrete event systems
Competitive Markov decision processes
Competitive Markov decision processes
Languages, automata, and logic
Handbook of formal languages, vol. 3
Weak alternating automata and tree automata emptiness
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
On the menbership problem for functional and multivalued dependencies in relational databases
ACM Transactions on Database Systems (TODS)
Quantitative solution of omega-regular games380872
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Information and Computation
Alternating-time temporal logic
Journal of the ACM (JACM)
Games, Probability, and the Quantitative µ-Calculus qMµ
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Realizable and Unrealizable Specifications of Reactive Systems
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Synthesis of Uninitialized Systems
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Discrete Subexponential Algorithm for Parity Games
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Small Progress Measures for Solving Parity Games
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
The Control of Synchronous Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
The Control of Synchronous Systems, Part II
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Interface Theories for Component-Based Design
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Abstract Interpretation of Game Properties
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Detecting Errors Before Reaching Them
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Pushdown Processes: Games and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
How much memory is needed to win infinite games?
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Concurrent Omega-Regular Games
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Universal games of incomplete information
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Quantitative stochastic parity games
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
A Landscape with Games in the Background
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Two-player nonzero-sum ω-regular games
CONCUR 2005 - Concurrency Theory
A deterministic subexponential algorithm for solving parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The complexity of quantitative concurrent parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Faster Solutions of Rabin and Streett Games
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Strategy Improvement for Concurrent Reachability Games
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
The complexity of tree automata and logics of programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Optimal strategy synthesis in stochastic Müller games
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Stochastic Müller games are PSPACE-complete
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Strategy improvement and randomized subexponential algorithms for stochastic parity games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Recursive concurrent stochastic games
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
The complexity of stochastic rabin and streett games
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Recursive markov decision processes and recursive stochastic games
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Algorithms for omega-regular games with imperfect information
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Complexity bounds for regular games
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Strategy improvement for stochastic rabin and streett games
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
Two variable vs. linear temporal logic in model checking and games
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Playing stochastic games precisely
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
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 theory of agreements and protection
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
Borel determinacy of concurrent games
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
On Concurrent Games with Payoff
Electronic Notes in Theoretical Computer Science (ENTCS)
From software verification to `everyware' verification
Computer Science - Research and Development
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 summarize classical and recent results about two-player games played on graphs with @w-regular objectives. These games have applications in the verification and synthesis of reactive systems. Important distinctions are whether a graph game is turn-based or concurrent; deterministic or stochastic; zero-sum or not. We cluster known results and open problems according to these classifications.