Two-Way Unary Temporal Logic over Trees
| Autor: | Mikolaj Bojanczyk |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2009 |
| Předmět: | |
| Zdroj: | Logical Methods in Computer Science, Vol Volume 5, Issue 3 (2009) |
| Druh dokumentu: | article |
| ISSN: | 1860-5974 |
| DOI: | 10.2168/LMCS-5(3:5)2009 |
| Popis: | We consider a temporal logic EF+F^-1 for unranked, unordered finite trees. The logic has two operators: EF\phi, which says "in some proper descendant \phi holds", and F^-1\phi, which says "in some proper ancestor \phi 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. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|