Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem

  • Authors:
  • Martin Dickhöfer;Thomas Wilke

  • Affiliations:
  • -;-

  • Venue:
  • ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce timed alternating tree automata as a natural 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 Henzinger, Kupferman, and Vardi