Constraint automata on infinite data trees: from CTL (Z)/CTL*(Z) to decision procedures
S Demri, K Quaas - arXiv preprint arXiv:2302.05327, 2023 - arxiv.org
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 …
less than relation and equality predicates to constants) and we show that the nonemptiness …
Church synthesis on register automata over linearly ordered data domains
In a Church synthesis game, two players, Adam and Eve, alternately pick some element in a
finite alphabet, for an infinite number of rounds. The game is won by Eve if the ω-word …
finite alphabet, for an infinite number of rounds. The game is won by Eve if the ω-word …
Synthesis for prefix first-order logic on data words
J Grange, M Lehaut - International Conference on Formal Techniques for …, 2024 - Springer
We study the reactive synthesis problem for distributed systems with an unbounded number
of participants interacting with an uncontrollable environment. Executions of those systems …
of participants interacting with an uncontrollable environment. Executions of those systems …