Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 281-290
- https://doi.org/10.1007/3-540-48523-6_25
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Automata for modeling real-time systemsPublished by Springer Nature ,2005
- Model-checking for real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A theory of timed automataPublished by Elsevier ,2002
- Languages, Automata, and LogicPublished by Springer Nature ,1997
- A space-efficient on-the-fly algorithm for real-time model checkingPublished by Springer Nature ,1996
- Alternating automata and program verificationPublished by Springer Nature ,1995
- An automata-theoretic approach to branching-time model checking (Extended abstract)Published by Springer Nature ,1994
- PrefaceInformation and Computation, 1993
- On model-checking for fragments of μ-calculusPublished by Springer Nature ,1993