Alternating automata on infinite trees
Theoretical Computer Science
The complexity of stochastic games
Information and Computation
Reasoning about infinite computations
Information and Computation
Languages, automata, and logic
Handbook of formal languages, vol. 3
Information and Computation - Special issue on FLOC '96
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)
Realizable and Unrealizable Specifications of Reactive Systems
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Small Progress Measures for Solving Parity Games
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Quantitative stochastic parity games
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
On Epistemic Temporal Strategic Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
The complexity of stochastic rabin and streett 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
Game quantification on automatic structures and hierarchical model checking games
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
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
A temporal logic for the interaction of strategies
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
What makes ATL* decidable? a decidable fragment of strategy logic
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Robust weighted timed automata and games
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Automata-theoretic decision of timed games
Theoretical Computer Science
On the Boundary of Behavioral Strategies
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properties of nonzero-sum games in a simple and natural way. We show that the one-alternation fragment of strategy logic is strong enough to express the existence of Nash equilibria and secure equilibria, and subsumes other logics that were introduced to reason about games, such as ATL, ATL^*, and game logic. We show that strategy logic is decidable, by constructing tree automata that recognize sets of strategies. While for the general logic, our decision procedure is nonelementary, for the simple fragment that is used above we show that the complexity is polynomial in the size of the game graph and optimal in the size of the formula (ranging from polynomial to 2EXPTIME depending on the form of the formula).