Characterizing CTL-like logics on finite trees.

DOI10.1016/j.tcs.2006.01.034zbMath1160.68408OpenAlexW2093913332MaRDI QIDQ2490815

Zoltán Ésik

Publication date: 18 May 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.034

zbMATH Keywords

temporal logictree automatacascade productpseudovariety

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Aperiodicity in Tree Automata ⋮ ALGEBRAIC CHARACTERIZATION OF LOGICALLY DEFINED TREE LANGUAGES ⋮ Recognisability for algebras of infinite trees ⋮ Games for Temporal Logics on Trees ⋮ Algebra for trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
• The temporal logic of branching time
• General varieties of tree languages
• Verification of reactive systems. Formal methods and algorithms.
• Regular languages defined with generalized quantifiers
• Wreath products of algebras: Generalizing the Krohn-Rhodes theorem to arbitrary algebras
• On the expressive power of temporal logic
• Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy
• Temporal logic can be more expressive
• Cascades of tree-automata and computations in universal algebras
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• CONCUR 2004 - Concurrency Theory
• Generalized finite automata theory with an application to a decision problem of second-order logic

This page was built for publication: Characterizing CTL-like logics on finite trees.