Games for Temporal Logics on Trees

DOI10.1007/978-3-540-70844-5_20zbMath1172.68504OpenAlexW1533366845MaRDI QIDQ3602814

Szabolcs Iván, Zoltán Ésik

Publication date: 12 February 2009

Published in: Implementation and Applications of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70844-5_20

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Temporal logic (03B44)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the characterization of TL [EF]
• Tree algebras and varieties of tree languages
• Using branching time temporal logic to synthesize synchronization skeletons
• General varieties of tree languages
• Modulo-counting quantifiers over finite trees
• Characterizing CTL-like logics on finite trees.
• Characterizing EF and EX tree logics
• AN EXPRESSIVE EXTENSION OF TLC
• An n  ! lower bound on formula size
• STACS 2005

This page was built for publication: Games for Temporal Logics on Trees