Model-checking infinite systems generated by ground tree rewriting

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

Volumn 2303, Issue , 2002, Pages 280-294

  Löding, Christof ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MODEL CHECKING;

FINITE TREE AUTOMATON; INFINITE GRAPH; INFINITE SYSTEM; MODEL CHECKING PROBLEM; REWRITING SYSTEMS; TREE REWRITING;

TREES (MATHEMATICS);

EID: 84948973714     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45931-6_20     Document Type: Conference Paper

References (14)

1. Achim Blumensath and Erich Grädel. Automatic structures. In Proceedings of LICS ’00, pages 51–62. IEEE Computer Society Press, 2000.
2. Walter S. Brainerd. Tree generating regular systems. Information and Control, 14:217–231, 1969.
3. Didier Caucal. On infinite transition graphs having a decidable monadic theory. In Proceedings ICALP ’96, volume 1099 of LNCS. Springer-Verlag, 1996.
4. J.L. Coquidé, M. Dauchet, R. Gilleron, and S. Vágvölgyi. Bottom-up tree pushdown automata: Classification and connection with rewrite systems. Theoretical Computer Science, 127(1):69–98, 1994.
5. J.L. Coquidé and R. Gilleron. Proofs and reachability problem for ground rewrite systems. In Aspects and Prospects of Theoretical Computer Science, volume 464 of LNCS, pages 120–129. Springer, 1990.
6. Max Dauchet, Thierry Heuillard, Pierre Lescanne, and Sophie Tison. Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems. Information and Computation, 88(2):187–201, October 1990.
7. Max Dauchet and Sophie Tison. The theory of ground rewrite systems is decidable. In Proceedings LICS ’90, pages 242–248. IEEE Computer Society Press, 1990.
8. Javier Esparza, David Hansel, Peter Rossmanith, and Stefan Schwoon. Efficient algorithms for model checking pushdown systems. In Proceedings of CAV 2000, volume 1855 of LNCS, pages 232–247. Springer-Verlag, 2000.
9. Javier Esparza and Astrid Kiehn. On the model checking problem for branching time logics and Basic Parallel Processes. In Proceedings of CAV ’95, volume 939 of LNCS, pages 353–366, 1995.
10. Orna Kupferman and Moshe Y. Vardi. An automata-theoretic approach to reasoning about infinite-state systems. In E. A. Emerson and A. P. Sistla, editors, Proceedings of CAV 2000, volume 1855 of LNCS. Springer-Verlag, 2000.
11. Richard Mayr. Process rewrite systems. Information and Computation, 156(1– 2):264–286, 2000.
12. Christophe Morvan. On rational graphs. In Proceedings of FoSSaCS ’99, volume 1784 of LNCS, pages 252–266. Springer, 1999.
13. David E. Muller and Paul E. Schupp. The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science, 37:51–75, 1985.
14. Igor Walukiewicz. Pushdown processes: Games and model checking. In Rajeev Alur and Thomas A. Henzinger, editors, Proceedings of CAV ’96, volume 1102 of LNCS, pages 62–74. Springer-Verlag, July-August 1996.