Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909659207565312 |
|---|---|
| author | Demri, Stephane Quaas, Karin |
| author_facet | Demri, Stephane Quaas, Karin |
| contents | We introduce the class of tree constraint automata with data values in Z (equipped with the less than relation and equality predicates to constants) and we show that the nonemptiness problem is ExpTime-complete. Using an automata-based approach, we establish that the satisfiability problem for CTL(Z) (CTL with constraints in Z) is ExpTime-complete and the satisfiability problem for CTL*(Z) is 2ExpTime-complete solving a longstanding open problem (only decidability was known so far). By-product results with other concrete domains and other logics, such as description logics with concrete domains, are also briefly presented. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2302_05327 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures Demri, Stephane Quaas, Karin Logic in Computer Science We introduce the class of tree constraint automata with data values in Z (equipped with the less than relation and equality predicates to constants) and we show that the nonemptiness problem is ExpTime-complete. Using an automata-based approach, we establish that the satisfiability problem for CTL(Z) (CTL with constraints in Z) is ExpTime-complete and the satisfiability problem for CTL*(Z) is 2ExpTime-complete solving a longstanding open problem (only decidability was known so far). By-product results with other concrete domains and other logics, such as description logics with concrete domains, are also briefly presented. |
| title | Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2302.05327 |