A note on the characterization of TL [EF]

DOI10.1016/j.ipl.2006.11.012zbMath1184.68334OpenAlexW1528847705MaRDI QIDQ845961

Zhilin Wu

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.11.012

zbMATH Keywords

formal languagesEhrenfeucht-Fraïssé gametree languagesbranching-time temporal logic

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Some modal aspects of XPath ⋮ Games for Temporal Logics on Trees

Cites Work

• Unnamed Item
• Stutter-invariant temporal properties are expressible without the next-time operator
• An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
• First-order logic on finite trees
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• CONCUR 2004 - Concurrency Theory
• STACS 2005

This page was built for publication: A note on the characterization of TL [EF]