License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2023.29
URN: urn:nbn:de:0030-drops-190238
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/19023/
Demri, Stéphane ;
Quaas, Karin
Constraint Automata on Infinite Data Trees: from CTL(ℤ)/CTL^*(ℤ) to Decision Procedures
Abstract
We introduce the class of tree constraint automata with data values in ℤ (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(ℤ) (CTL with constraints in ℤ) is EXPTIME-complete, and the satisfiability problem for CTL^*(ℤ) is 2ExpTime-complete (only decidability was known so far). By-product results with other concrete domains and other logics, are also briefly discussed.
BibTeX - Entry
@InProceedings{demri_et_al:LIPIcs.CONCUR.2023.29,
author = {Demri, St\'{e}phane and Quaas, Karin},
title = {{Constraint Automata on Infinite Data Trees: from CTL(\mathbb{Z})/CTL^*(\mathbb{Z}) to Decision Procedures}},
booktitle = {34th International Conference on Concurrency Theory (CONCUR 2023)},
pages = {29:1--29:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-299-0},
ISSN = {1868-8969},
year = {2023},
volume = {279},
editor = {P\'{e}rez, Guillermo A. and Raskin, Jean-Fran\c{c}ois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/19023},
URN = {urn:nbn:de:0030-drops-190238},
doi = {10.4230/LIPIcs.CONCUR.2023.29},
annote = {Keywords: Constraints, Constraint Automata, Temporal Logics, Infinite Data Trees}
}
Keywords: |
|
Constraints, Constraint Automata, Temporal Logics, Infinite Data Trees |
Collection: |
|
34th International Conference on Concurrency Theory (CONCUR 2023) |
Issue Date: |
|
2023 |
Date of publication: |
|
07.09.2023 |