Characterizing EF and EX tree logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3170, Issue , 2004, Pages 131-145

  Bojańczyk, Mikolaj ^a   Walukiewicz, Igor ^b  

^a UNIVERSITY OF WARSAW   (Poland)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

EXPRESSIVE POWER; FORBIDDEN PATTERN; OPTIMAL ALGORITHM; TREE LANGUAGES; TREE LOGIC;

FORESTRY;

EID: 21144450783     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28644-8_9     Document Type: Article

References (18)

1. E. A. Emerson and J. Y. Halpern. 'Sometimes' and 'not never' revisited: on branching versus linear time temporal logic. Journal of the ACM, 33(1):151-178, 1986.
2. J. Esparza. Decidability of model-checking for infinite-state concurrent systems. Acta Information, 34:85-107, 1997.
3. M. Fischer and R. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18:194-211, 1979.
4. M. Franceschet, L. Afanasiev, M. de Rijke, and M. Marx. CTL model checking for processing simple XPath queries. In Temporal Presentation and Reasoning.
5. C. Koch G. Gottlob. Monadic queries over tree-structured data. In Logic in Computer Science, pages 189-202, 2002.
6. T. Hafer and W. Thomas. Computation tree logic CTL and path quantifiers in the monadic theory of the binary tree. In International Colloquium on Automata, Languages and Programming, volume 267 of Lecture Notes in Computer Science, pages 260-279, 1987.
7. U. Heuter. First-order properties of trees, star-free expressions, and aperiodicity. In Symposium on Theoretical Aspects of Computer Science, volume 294 of Lecture Notes in Computer Science, pages 136-148, 1988.
8. F. Neven. Automata, logic, and XML. In Julian C. Bradfield, editor, Computer Science Logic, volume 2471 of Lecture Notes in Computer Science, pages 2-26, 2002.
9. D. Niwinski. Fixed points vs. infinte generation. In Logic in Computer Science, pages 402-409, 1988.
10. M. Otto. Eliminating recursion in the μ-calculus. In Symposium on Theoretical Aspects of Computer Science, volume 1563 of Lecture Notes in Computer Science, pages 531-540, 1999.
11. A. Potthoff. First-order logic on finite trees. In Theory and Practice of Software Development, volume 915 of Lecture Notes in Computer Science, pages 125-139, 1995.
12. M. P. Schützenberger. On finite monoids having only trivial subgroups. Information and Control, 8:190-194, 1965.
13. H. Seidl. Deciding equivalence of finite tree automata. SIAM Journal of Computing, 19:424-437, 1990.
14. H. Straubing. Finite Automata, Formal Languages, and Circuit Complexity. Birkhäuser, Boston, 1994.
15. J. W. Thatcher and J. B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2(1):57-81, 1968.
16. I. Walukiewicz. Model checking CTL properties of pushdown systems. In Foundations of Software Technology and Theoretical Computer Science, volume 1974 of Lecture Notes in Computer Science, pages 127-138, 2000.
17. I. Walukiewicz. Deciding low levels of tree-automata hierarchy. In Workshop on Logic, Language, Information and Computation, volume 67 of Electronic Notes in Theoretical Computer Science, 2002.
18. T. Wilke. Classifying discrete temporal properties. In Symposium on Theoretical Aspects of Computer Science, volume 1563 of Lecture Notes in Computer Science, pages 32-46, 1999.