Characterizing CTL-like logics on finite trees

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.

[1]  Magnus Steinby,et al.  General Varieties of Tree Languages , 1998, Theor. Comput. Sci..

[2]  Zoltán Ésik,et al.  On Logically Defined Recognizable Tree Languages , 2003, FSTTCS.

[3]  Denis Thérien,et al.  Modular temporal logic , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[4]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .

[5]  G. Ricci,et al.  Cascades of tree-automata and computations in universal algebras , 1973, Mathematical systems theory.

[6]  Klaus Schneider,et al.  Verification of Reactive Systems: Formal Methods and Algorithms , 2003 .

[7]  Magnus Steinby.  A theory of tree language varieties , 1992, Tree Automata and Languages.

[8]  Joel VanderWerf.  Wreath products of algebras: Generalizing the Krohn-Rhodes theorem to arbitrary algebras , 1996 .

[9]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[10]  James W. Thatcher,et al.  Generalized finite automata theory with an application to a decision problem of second-order logic , 1968, Mathematical systems theory.

[11]  Jorge Almeida.  On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics , 1990 .

[12]  Uschi Heuter.  Definite tree languages , 1988, Bull. EATCS.

[13]  Howard Straubing.  Finite Automata, Formal Logic, and Circuit Complexity , 1994, Progress in Theoretical Computer Science.

[14]  Zoltán Ésik.  Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators , 2002 .

[15]  Dominique Perrin,et al.  On the Expressive Power of Temporal Logic , 1993, J. Comput. Syst. Sci..

[16]  Saharon Shelah,et al.  On the temporal analysis of fairness , 1980, POPL '80.

[17]  Robert McNaughton,et al.  Counter-Free Automata (M.I.T. research monograph no. 65) , 1971 .

[18]  Thomas Wilke,et al.  Temporal logic and semidirect products: an effective characterization of the until hierarchy , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[19]  Pierre Wolper.  Temporal Logic Can Be More Expressive , 1983, Inf. Control..

[20]  R. McNaughton,et al.  Counter-Free Automata , 1971 .

[21]  Klaus Schneider.  Verification of Reactive Systems , 2004, Texts in Theoretical Computer Science.

[22]  George Gratzer,et al.  Universal Algebra , 1979 .

[23]  Jorge Almeida,et al.  Finite Semigroups and Universal Algebra , 1995 .

[24]  Andreas Podelski,et al.  Tree Automata and Languages , 1992 .

[25]  Mordechai Ben-Ari,et al.  The temporal logic of branching time , 1981, POPL '81.

[26]  Howard Straubing,et al.  Regular Languages Defined with Generalized Quanifiers , 1995, Inf. Comput..