Sciweavers

Share
CSR
2009
Springer

The Reachability Problem over Infinite Graphs

9 years 3 months ago
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.
Wolfgang Thomas
Added 16 Aug 2010
Updated 16 Aug 2010
Type Conference
Year 2009
Where CSR
Authors Wolfgang Thomas
Comments (0)
books