Timed alternating tree automata: The automata-theoretic solution to the TCTL model checking problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1644 LNCS, Issue , 1999, Pages 281-290

  Dickhöfer, Martin ^a   Wilke, Thomas ^b  

^a UNIVERSITY OF KIEL   (Germany)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FORESTRY;

ALTERNATING TREE AUTOMATON; AUTOMATA-THEORETIC APPROACH; MODEL CHECKING PROBLEM; TIMED AUTOMATA; TIMED COMPUTATION TREE LOGIC;

MODEL CHECKING;

EID: 84867789098     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_25     Document Type: Conference Paper

References (13)

1. R. Alur, C. Courcoubetis, and D. L. Dill. Model-checking for real-time systems. In LICS '90, Philadelphia, Pennsylvania, pp. 414-425.
2. R. Alur, C. Courcoubetis, and D. L. Dill. Model-checking in dense real-time. Inform, and Computation, 104(l):1-34, 1993.
3. R. Alur and D. L. Dill. Automata for modeling real-time systems. In M. S. Paterson, ed., ICALP '90, Warwick, England, Springer, LNCS 443, pp. 322-335.
4. R. Alur and D. L. Dill. A theory of timed automata. Theoret. Cornput. Sci., 126(2): 183-235, 1994.
5. O. Bernholtz, M. Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. In D. L. Dill, ed., CAV '9th, Stanford, California, Springer, LNCS 818, pp. 142-155.
6. M. Dickhofer and T. Wilke. The automata-theoretic method works for TCTL model checking. Techn. Rep. 9811, Inst, f. Informatik u. Prakt. Math., CAU Kiel, 1998. Available as http://www-i7.informatik.rwth-aachen.de/wilke/publications/ Rep9811.html.ps.gz.
7. E. A. Emerson, C. S. Jutla., and A. P. Sistla. On model-checking for fragments of calculus. In C. Courcoubetis, ed., CAV '93, Elounda, Greece, Springer, LNCS 697, pp. 385-396.
8. F. Gecseg and M. Steinby. Tree Automata. Akademiai Kiako, Budapest, 1984.
9. T. A. Henzinger, O. Kupferman, and M. Y. Vardi. A space-efficient on-the-fly algorithm for real-time model checking. In U. Montanari, V. Sassone, eds., Concur '96, Pisa, Italy, Springer, LNCS 1119, pp. 514-529.
10. W. Thomas. Languages, automata and logic. In A. Salomaa and G. Rozenberg, eds., Handbook of Formal Languages, volume 3. Springer, Berlin, 1997, pp. 389-455.
11. W. Thomas. Automata on infinite objects. In J. v. Leeuwen, ed., Handbook of Theoretical Computer Science, vol. B, Elsevier, Amsterdam, 1990, pp. 134-191.
12. M. Y. Vardi. Alternating automata and program verification. In J. v. Leeuwen, ed., Computer Science Today, Springer, 1995, LNCS 1000, pp. 471-485.
13. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In D. Kozen, ed., LICS 86, Cambridge, Mass., pp. 322-331.