Characterizing CTL-like logics on finite trees

Authors:
Zoltán Ésik
Affiliations:
Department of Computer Science, University of Szeged, Hungary Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain
Venue:
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Year:
2006

Citing 10
Cited 7

Finite automata, formal logic, and circuit complexity

Finite automata, formal logic, and circuit complexity
Regular languages defined with generalized quantifiers

Information and Computation
General varieties of tree languages

Theoretical Computer Science
Automata, Languages, and Machines

Automata, Languages, and Machines
On the temporal analysis of fairness

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modular Temporal Logic

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy

Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy
Verification of Reactive Systems: Formal Methods and Algorithms

Verification of Reactive Systems: Formal Methods and Algorithms
Counter-Free Automata (M.I.T. research monograph no. 65)

Counter-Free Automata (M.I.T. research monograph no. 65)
Extended temporal logic on finite words and wreath product of monoids with distinguished generators

DLT'02 Proceedings of the 6th international conference on Developments in language theory

Products of Tree Automata with an Application to Temporal Logic

Fundamenta Informaticae
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics

Fundamenta Informaticae
Games for Temporal Logics on Trees

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Aperiodicity in tree automata

CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Recognisability for algebras of infinite trees

Theoretical Computer Science
Products of Tree Automata with an Application to Temporal Logic

Fundamenta Informaticae
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We associate a modal operator with each language belonging to a given class of regular tree languages and use the cascade product of tree automata to give an algebraic characterization of the expressive power of the resulting logic.