Characterizing EF and EX tree logics

Mikolaj Bojanczyk (1) , Igor Walukiewicz (2)

1 Institute of Informatics [Warsaw]
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern char- acterization of the tree languages definable in three logics: EX, EF and EX+EF. The properties in these characterizations can be verified in polynomial time when given a minimal deterministic bottom-up tree automaton.

Domaines: Logique en informatique [cs.LO]

Mikolaj Bojanczyk, Igor Walukiewicz. Characterizing EF and EX tree logics. Theoretical Computer Science, 2006, 358 (2-3), pp.255-272. ⟨hal-00335736⟩