Graph Rewriting

Graph Rewriting

Edited by 

List price: US$49.00

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Graph transformation, or Graph rewriting, concerns the technique of creating a new graph out of an original graph using some automatic machine. It has numerous applications, ranging from software verification to layout algorithms. Graph transformations can be used as a computation abstraction. The basic idea is that the state of a computation can be represented as a graph, further steps in that computation can then be represented as transformation rules on that graph. Such rules consist of an original graph, which is to be matched to a subgraph in the complete state, and a replacing graph, which will replace the matched subgraph. Formally, a graph rewriting system consists of a set of graph rewrite rules of the form, with L being called pattern graph and R being called replacement graph. A graph rewrite rule is applied to the host graph by searching for an occurrence of the pattern graph and by replacing the found occurrence by an instance of the replacement more

Product details

  • Paperback | 84 pages
  • 152 x 229 x 5mm | 136g
  • Lect Publishing
  • United States
  • English
  • 6136662213
  • 9786136662213