文章基本信息
- 标题：Two-Way Unary Temporal Logic over Trees
- 本地全文：下载
- 作者：Mikolaj Bojanczyk
- 期刊名称：Logical Methods in Computer Science
- 印刷版ISSN：1860-5974
- 电子版ISSN：1860-5974
- 出版年度：2009
- 卷号：5
- 期号：03
- DOI：10.2168/LMCS-5(3:5)2009
- 出版社：Technical University of Braunschweig
- 摘要：
We consider a temporal logic EF+F-1 for unranked, unordered finite
trees. The logic has two operators: EFf, which says ``in some proper descendant
f holds'', and F-1f, which says ``in some proper ancestor f holds''.
We present an algorithm for deciding if a regular language of unranked finite
trees can be expressed in EF+F-1. The algorithm uses a
characterization expressed in terms of forest algebras.
