Time dependent models have become increasingly important in formal modeling and verification of software systems. In this paper, we investigate the expressiveness of real-time iterative arrays and trees in the context of language recognition. Such synchronous parallel models of computation must meet high dependability requirements in performing complex interactions in a real-time environment. Furthermore, we present timed event alternating automata which do not only describe a theoretical model framework for formal languages but establishes strong relationships and foundations to timed propositional temporal logic through two embedded powerful metaphors - alternation and time.
Fellah, A. (2015). Real-time languages, timed alternating automata, and timed temporal logics: Relationships and specifications. In Procedia Computer Science (Vol. 62, pp. 47–54). Elsevier B.V. https://doi.org/10.1016/j.procs.2015.08.409