Automata-Theoretic Characterisations of Branching-Time Temporal Logics
<|reference_start|>Automata-Theoretic Characterisations of Branching-Time Temporal Logics: Characterisations theorems serve as important tools in model theory and can be used to assess and compare the expressive power of temporal languages used for the specification and verification of properties in formal methods. While complete connections have been established for the linear-time case between temporal logics, predicate logics, algebraic models, and automata, the situation in the branching-time case remains considerably more fragmented. In this work, we provide an automata-theoretic characterisation of some important branching-time temporal logics, namely CTL* and ECTL* interpreted on arbitrary-branching trees, by identifying two variants of Hesitant Tree Automata that are proved equivalent to those logics. The characterisations also apply to Monadic Path Logic and the bisimulation-invariant fragment of Monadic Chain Logic, again interpreted over trees. These results widen the characterisation landscape of the branching-time case and solve a forty-year-old open question.<|reference_end|>
@article{benerecetti2024automata-theoretic,
    title={Automata-Theoretic Characterisations of Branching-Time Temporal Logics},
    author={Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron},
    journal={arXiv preprint arXiv:2404.17421},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.17421},
    primaryClass={cs.LO}
}