Embeddings and Contexts for Link Graphs

Robin Milner

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Graph-rewriting has been a growing discipline for over three decades. It grew out of the study of graph grammars, in which – analogously to string and tree grammars – a principal interest was to describe the families of graphs that could be generated from a given set of productions. A fundamental contribution was, of course, the double-pushout construction of Ehrig and his colleagues [4]; it made precise how the left-hand side of a production, or rewriting rule, could be found to occur in a host graph, and how it should then be replaced by the right-hand side. This break-through led to many theoretical developments and many applications. It relies firmly upon the treatment of graphs as objects in a category whose arrows are embedding maps.
Original languageEnglish
Title of host publicationFormal Methods in Software and Systems Modeling
PublisherSpringer Berlin Heidelberg
Pages343-351
Number of pages9
Volume3393
ISBN (Electronic)978-3-540-31847-7
ISBN (Print)978-3-540-24936-8
DOIs
Publication statusPublished - 2005

Fingerprint

Dive into the research topics of 'Embeddings and Contexts for Link Graphs'. Together they form a unique fingerprint.

Cite this