Fundamentals of algebraic graph transformation /

Saved in:
Bibliographic Details
Imprint:Berlin ; New York : Springer, c2006.
Description:1 online resource (xiii, 388 p.) : ill.
Language:English
Series:Monographs in theoretical computer science
Monographs in theoretical computer science.
Subject:
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/8877572
Hidden Bibliographic Details
Other authors / contributors:Ehrig, Hartmut.
ISBN:9783540311874 (alk. paper)
3540311874 (alk. paper)
9783540311881 (electronic bk.)
3540311882 (electronic bk.)
9786610625833
6610625832
Notes:Includes bibliographical references (p. [377]-383) and index.
Description based on print version record.
Summary:Graphs are widely used to represent structural information in the form of objects and connections between them. Graph transformation is the rule-based manipulation of graphs, an increasingly important concept in computer science and related fields. This is the first textbook treatment of the algebraic approach to graph transformation, based on algebraic structures and category theory. Part I is an introduction to the classical case of graph and typed graph transformation. In Part II, basic and advanced results are first shown for an abstract form of replacement systems, so-called adhesive high.
Other form:Print version: Fundamentals of algebraic graph transformation. Berlin ; New York : Springer, c2006 3540311874