|WikiProject Mathematics||(Rated Start-class, Mid-priority)|
- 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 184.108.40.206 (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)Last modified on 4 May 2012, at 13:35