The Reachability Problem over Infinite Graphs

Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is central for automatic verification of infinitestate systems. Our focus is on graphs that are presented in terms of word or tree rewriting systems.

• Type: Conference
• Year: 2009
• Where: CSR
• Authors: Wolfgang Thomas
• Keywords: CSR 2009, Presented Infinite Graphs, Reachability Problem, Theoretical Computer Science, Tree Rewriting Systems