Fundamentals of Algebraic Graph Transformation

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 algebra...

Full description

Bibliographic Details
Main Authors: Ehrig, Hartmut, Ehrig, Karsten (Author), Prange, Ulrike (Author), Taentzer, Gabriele (Author)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2006, 2006
Edition:1st ed. 2006
Series:Monographs in Theoretical Computer Science. An EATCS Series
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 03553nmm a2200397 u 4500
001 EB000374668
003 EBX01000000000000000227720
005 00000000000000.0
007 cr|||||||||||||||||||||
008 130626 ||| eng
020 |a 9783540311881 
100 1 |a Ehrig, Hartmut 
245 0 0 |a Fundamentals of Algebraic Graph Transformation  |h Elektronische Ressource  |c by Hartmut Ehrig, Karsten Ehrig, Ulrike Prange, Gabriele Taentzer 
250 |a 1st ed. 2006 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2006, 2006 
300 |a XIII, 390 p  |b online resource 
505 0 |a to Graph Transformation Systems -- General Introduction -- Graphs, Typed Graphs, and the Gluing Construction -- Graph Transformation Systems -- Adhesive High-Level Replacement Categories and Systems -- Adhesive High-Level Replacement Categories -- Adhesive High-Level Replacement Systems -- Embedding and Local Confluence -- Constraints and Application Conditions -- Typed Attributed Graph Transformation Systems -- Typed Attributed Graphs -- Typed Attributed Graph Transformation Systems -- Embedding and Local Confluence for Typed AGT Systems -- Adhesive HLR Categories for Typed Attributed Graphs -- Constraints, Application Conditions and Termination for Typed AGT Systems -- Typed Attributed Graph Transformation with Inheritance -- Case Study on Model Transformation, and Tool Support by AGG -- Case Study on Model Transformation -- Implementation of Typed Attributed Graph Transformation by AGG. 
653 |a Compilers (Computer programs) 
653 |a Computer Science Logic and Foundations of Programming 
653 |a Compilers and Interpreters 
653 |a Programming Techniques 
653 |a Computer science 
653 |a Computer programming 
653 |a Formal Languages and Automata Theory 
653 |a Machine theory 
653 |a Theory of Computation 
700 1 |a Ehrig, Karsten  |e [author] 
700 1 |a Prange, Ulrike  |e [author] 
700 1 |a Taentzer, Gabriele  |e [author] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Monographs in Theoretical Computer Science. An EATCS Series 
028 5 0 |a 10.1007/3-540-31188-2 
856 4 0 |u https://doi.org/10.1007/3-540-31188-2?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 004.0151 
520 |a 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-level replacement systems based on category theory, and are then instantiated to several forms of graph and Petri net transformation systems. Part III develops typed attributed graph transformation, a technique of key relevance in the modeling of visual languages and in model transformation. Part IV contains a practical case study on model transformation and a presentation of the AGG (attributed graph grammar) tool environment. Finally the appendix covers the basics of category theory, signatures and algebras. The book addresses both research scientists and graduate students in computer science, mathematics and engineering