Products of Tree Automata with an Application to Temporal Logic

Authors:
Zoltán Ésik;Szabolcs Iván
Affiliations:
Department of Computer Science, University of Szeged, Hungary and GRLMC, Rovira i Virgili University, Tarragona, Spain. E-mail: ze@inf.u-szeged.hu;Department of Computer Science, University of Szeged, Hungary. E-mail: szabivan@inf.u-szeged.hu
Venue:
Fundamenta Informaticae
Year:
2008

Citing 3
Cited 1

General varieties of tree languages

Theoretical Computer Science
Verification of Reactive Systems: Formal Methods and Algorithms

Verification of Reactive Systems: Formal Methods and Algorithms
Characterizing CTL-like logics on finite trees

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday

Games for Temporal Logics on Trees

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the notion of the Moore product of tree automata as a special case of the cascade product. We give an algebraic characterization of the expressive power of certain CTL-like temporal logics based on the notion of varieties of finite tree automata closed under the Moore product.