Characterizing EF and EX tree logics
Résumé
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]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...