Abstract
We introduce timed alternating tree automata as a natu- ral extension of timed automata for the purpose of solving the model checking problem for timed computation tree logic (TCTL) following the automata-theoretic approach. This settles a problem posed by Hen- zinger, Kupferman, and Vardi. © Springer-Verlag Berlin Heidelberg 1999.
Cite
CITATION STYLE
Dickhöfer, M., & Wilke, T. (1999). Timed alternating tree automata: The automata-theoretic solution to the TCTL model checking problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1644 LNCS, pp. 281–290). Springer Verlag. https://doi.org/10.1007/3-540-48523-6_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
