ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Theoretical Computer Science
Volume 358, Issues 2-3, 7 August 2006, Pages 255-272
Concurrency Theory (CONCUR 2004)
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (282 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.tcs.2006.01.018    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2006 Elsevier B.V. All rights reserved.

Characterizing EF and EX tree logics

Mikolaj BojańczykCorresponding Author Contact Information, a, E-mail The Corresponding Author and Igor Walukiewicza

aWarsaw University and Laboratoire Bordelais de Recherche en Informatique, Poland

Available online 10 February 2006.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

The expressive power of temporal branching time logics that use the modalities View the MathML source and View the MathML source is described. Forbidden pattern characterizations are given for tree languages definable in three logics: EX, EF and EX+EF. The characterizations give algorithms for the definability problem in the respective logics that are polynomial in the size of a deterministic tree automaton representing the language.


Theoretical Computer Science
Volume 358, Issues 2-3, 7 August 2006, Pages 255-272
Concurrency Theory (CONCUR 2004)
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.