Complete axiomatization and decidability of alternating-time temporal logic
DOI10.1016/j.tcs.2005.07.043zbMath1089.03013OpenAlexW2160254449MaRDI QIDQ2368988
Govert van Drimmelen, Valentin F. Goranko
Publication date: 28 April 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.07.043
SatisfiabilityOpen systemsAlternating tree automataAlternating-time temporal logicComplete axiomatizationConcurrent game structures
Applications of game theory (91A80) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Computer science today. Recent trends and developments
- Comparing semantics of logics for multi-agent systems
- ATL Satisfiability is Indeed EXPTIME-complete
- Alternating-time temporal logic
- A Modal Logic for Coalitional Power in Games
- An automata-theoretic approach to branching-time model checking
- Rudiments of \(\mu\)-calculus
This page was built for publication: Complete axiomatization and decidability of alternating-time temporal logic