One-unambiguous regular languages
Information and Computation
"Sometimes" and "not never" revisited: on branching versus linear time (preliminary report)
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Alternating-time temporal logic
Journal of the ACM (JACM)
From Programs to Games: Invariance and Safety for Bisimulation
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Complete axiomatization and decidability of alternating-time temporal logic
Theoretical Computer Science
The Variable Hierarchy of the μ-Calculus Is Strict
Theory of Computing Systems
Alternating-time temporal logics with irrevocable strategies
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We analyse two basic approaches of extending classical logics with quantifiers interpreted via games: Propositional Game Logic of Parikh and Alternating-Time Temporal Logic of Alur, Henzinger, and Kupferman. Although the two approaches are historically remote and they incorporate operationally orthogonal paradigms, we trace the formalisms back to common foundations and argue that they share remarkable similarities in terms of expressive power.