Characterizing CTL-like logics on finite trees.

DOI10.1016/j.tcs.2006.01.034zbMath1160.68408MaRDI 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 logic; tree automata; cascade product; pseudovariety

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item