Automata-Theoretic Characterizations of Branching-Time Temporal Logics: Connecting Logics, Predicate Logics, and Tree Automata

This work provides an automata-theoretic characterization of important branching-time temporal logics, including CTL* and ECTL*, by identifying variants of Hesitant Tree Automata that are equivalent to these logics. The characterizations also apply to Monadic Path Logic and the bisimulation-invariant fragment of Monadic Chain Logic.