Talk:Graph rewriting
| This is the talk page for discussing improvements to the Graph rewriting article. This is not a forum for general discussion of the article's subject. |
Article policies
|
| Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
- Yes, but what is the point of graph rewriting, what good does it serve, what are its applications?
The usual phrase is "intuitively accessible (but absolutely formal) high-level specification/description of systems". Further there is also a growing number of analysis and verification techniques.
Hi, I removed the sentence about Clean and graph rewriting. Clean uses the term "graph-rewriting" to mean basically term rewriting with mandatory sharing. It is not the same thing as general graph rewriting, which is the subject of this article. It might be useful to have a sentence or a section explaining this distinction, but for now I've just removed the old sentence as it is misleading. —Preceding unsigned comment added by 66.30.3.143 (talk) 04:25, 3 February 2009 (UTC)
Why don't you incorporate your note as directly related last section then? To remove explicitly info about Concurrent Clean from this page is a tiny evil. Vak (talk) 09:01, 13 September 2010 (UTC)
Can anyone clean up the comparison between (ideally by explaining the motivations behind) SPO vs. DPO? It isn't clear why the K graph which serves as "some kind of interface" (yuck) is useful.Maneesh (talk) 05:16, 17 February 2011 (UTC)
Right. It's not so useful at present. Maybe the categorial approaches to graph rewriting deserve their own page. I don't know what it should be called, though. [ɯ:] (talk) 11:57, 4 May 2012 (UTC)
I've started doing one on DPO graph rewriting, which will be called Double pushout graph rewriting. SPO etc. should follow. [ɯ:] (talk) 13:35, 4 May 2012 (UTC)