Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

CSR
2009
Springer

favoriteEmaildiscussreport

107views Theoretical Computer Science» more CSR 2009»

The Reachability Problem over Infinite Graphs

13 years 8 months ago

The Reachability Problem over Infinite Graphs

Download www-i7.informatik.rwth-aachen.de

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

Real-time Traffic

CSR 2009 | Presented Infinite Graphs | Reachability Problem | Theoretical Computer Science | Tree Rewriting Systems |

claim paper

Related Content

» Reachability Problems on Regular Ground Tree Rewriting Graphs

» Constraint Satisfaction Problems with Infinite Templates

» Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains

» Answering pattern match queries in large graph databases via graph embedding

» A LogSpace Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources

» Transition Graphs of Rewriting Systems over Unranked Trees

» Speeding Up Constrained Path Solvers with a Reachability Propagator

» SpaceEfficient Algorithms for Reachability in SurfaceEmbedded Graphs

» Combinatorics and Geometry of Finite and Infinite Squaregraphs

Post Info
More Details (n/a)

Added	16 Aug 2010
Updated	16 Aug 2010
Type	Conference
Year	2009
Where	CSR
Authors	Wolfgang Thomas

Comments (0)