@article{LATORRE2001158,
    Abstract = {In the last decade Alur and Dill introduced a model of automata on timed {$\omega$}-sequences which extends the traditional models of finite automata. In this paper we present a theory of timed {$\omega$}-trees which extends both the theory of timed {$\omega$}-sequences and the theory of {$\omega$}-trees. Main motivation is to introduce a new way of specifying real-time systems and provide tools for studying decidability problems in the field of quantitative temporal logics. We study properties and decision problems of the obtained classes of timed {$\omega$}-tree languages. Our main result is the decidability of the emptiness problem for all the classes of timed {$\omega$}-tree automata we consider.},
    Author = {Torre, Salvatore La and Napoli, Margherita},
    File = {1-s2.0-S1571066104808843-main (0) - a - a - d.pdf},
    ISSN = {1571-0661},
    Journal = {Electronic Notes in Theoretical Computer Science},
    Note = {Computing: The Australasian Theory Symposium (CATS 2001)},
    Pages = {158 - 173},
    Title = {A Model of Finite Automata on Timed {$\omega$}-Trees},
    URL = {http://www.sciencedirect.com/science/article/pii/S1571066104808843},
    Volume = {42},
    Year = {2001},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S1571066104808843},
    bdsk-url-2 = {https://doi.org/10.1016/S1571-0661(04)80884-3},
    date-added = {2019-04-15 16:17:31 +0200},
    date-modified = {2019-04-15 16:17:31 +0200},
    doi = {10.1016/S1571-0661(04)80884-3}
}

@article{LATORRE2001158, Abstract = {In the last decade Alur and Dill introduced a model of automata on timed {$\omega$}-sequences which extends the traditional models of finite automata. In this paper we present a theory of timed {$\omega$}-trees which extends both the theory of timed {$\omega$}-sequences and the theory of {$\omega$}-trees. Main motivation is to introduce a new way of specifying real-time systems and provide tools for studying decidability problems in the field of quantitative temporal logics. We study properties and decision problems of the obtained classes of timed {$\omega$}-tree languages. Our main result is the decidability of the emptiness problem for all the classes of timed {$\omega$}-tree automata we consider.}, Author = {Torre, Salvatore La and Napoli, Margherita}, File = {1-s2.0-S1571066104808843-main (0) - a - a - d.pdf}, ISSN = {1571-0661}, Journal = {Electronic Notes in Theoretical Computer Science}, Note = {Computing: The Australasian Theory Symposium (CATS 2001)}, Pages = {158 - 173}, Title = {A Model of Finite Automata on Timed {$\omega$}-Trees}, URL = {http://www.sciencedirect.com/science/article/pii/S1571066104808843}, Volume = {42}, Year = {2001}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S1571066104808843}, bdsk-url-2 = {https://doi.org/10.1016/S1571-0661(04)80884-3}, date-added = {2019-04-15 16:17:31 +0200}, date-modified = {2019-04-15 16:17:31 +0200}, doi = {10.1016/S1571-0661(04)80884-3} }