Mikolaj Bojanczyk, Igor Walukiewicz  Home/Search
Context
Related
| mimuw.edu.pl/~bojan/...concur2004.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mimuw.edu.pl/~bojan/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We characterize the expressive power of EX, EF and EX+EF logics. These are the fragments of CTL built using the respective operators. (Update)
Similar documents based on text: More All
0.3: Tree-Walking Automata Cannot Be Determinized - Bojanczyk, Colcombet (Correct)
0.3: A Bounding Quantifier - Bojanczyk (2004) (Correct)
0.3: Randomized Efficient Algorithms for Compressed Strings: the.. - Gasieniec, al. (1996) (Correct)
BibTeX entry: (Update)
@misc{ bojanczyk-characterizing,
author = "Mikolaj Bojanczyk and Igor Walukiewicz",
title = "Characterizing EF and EX tree logics",
url = "citeseer.ist.psu.edu/bojanczyk04characterizing.html" }
Citations (may not include all citations):195 Propositional dynamic logic of regular programs (context) - Fischer, Ladner - 1979
57 and Circuit Complexity (context) - Straubing, Formal - 1994
53 Sometimes' and 'not never' revisited: on branching versus li.. (context) - Emerson, Halpern - 1986
21 Monadic queries over tree-structured data - Koch, Gottlob - 2002
16 Classifying discrete temporal properties - Wilke - 1999
15 nite tree automata (context) - Seidl, of - 1990
11 and XML (context) - Neven, logic - 2002
11 Computation tree logic CTL and path quanti ers in the monadi.. (context) - Hafer, Thomas - 1987
9 Model checking CTL properties of pushdown systems - Walukiewicz - 2000
7 Decidability of model-checking for in nite-state concurrent .. (context) - Esparza - 1997
3 Eliminating recursion in the -calculus (context) - Otto - 1999
2 Fixed points vs (context) - Niwiski - 1988
2 First-order properties of trees (context) - Heuter - 1988
2 CTL model checking for processing simple XPath queries (context) - Franceschet, Afanasiev et al.
2 Deciding low levels of tree-automata hierarchy (context) - Walukiewicz - 2002
[Article contains additional citations not shown here]
Documents on the same site (http://www.mimuw.edu.pl/~bojan/papers/): More
The Finite Graph Problem for Two-Way Alternating Automata - Bojanczyk (Correct)
Two-Way Alternating Automata and Finite Models - Bojanczyk (Correct)
A Bounding Quantifier - Bojanczyk (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC