Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures

02/10/2023
by   Stéphane Demri, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset