
Fundamentals of Algebraic Graph Transformation by Hartmut Ehrig
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.
-
Models and Algorithms of Time-Dependent Scheduling
-
Theoretical Aspects of Distributed Computing in Sensor Networks
-
Handbook of Weighted Automata
-
Coping with Selfishness in Congestion Games
-
First-Order Programming Theories
-
Restricted-Orientation Convexity
-
Fault-Tolerant Search Algorithms
-
Patterns in Permutations and Words
-
Semantic Integration of Heterogeneous Software Specifications
-
Theoretical Aspects of Local Search
-
Computability
-
Syntax-Directed Semantics
-
The Logic of Partial Information
-
Computing in Horn Clause Theories
-
Nonsequential Processes
-
Data Structures and Algorithms 3
-
Relations and Graphs
-
Fundamentals of Algebraic Specification 1
-
Iteration Theories
-
Semirings, Automata, Languages
-
Data Structures and Algorithms 1
-
Petri Nets
-
Kolmogorov Complexity and Computational Complexity
-
Temporal Logic of Programs
-
Confluent String Rewriting
-
Fundamentals of Algebraic Specification 2
-
Parsing Theory
-
Finiteness and Regularity in Semigroups and Formal Languages
-
Coloured Petri Nets
-
Algorithms in Combinatorial Geometry
-
Logics of Specification Languages
-
Graph and Model Transformation
-
Unfoldings
-
Stochastic Coalgebraic Logic
-
Process Algebras for Petri Nets
From the reviews:
"A general theory of graph transformations … has been developed… It is a very clear exposition of this material, spanning the breadth from underlying mathematics to an applications case study. … The authors have done a very good job of presenting an area in which many different threads of research have developed in to a general theory … . The book provides a helpful roadmap to the published research in the area, and a systematic treatment that emphasizes the fundamentals … ." (Charles J. Colbourn, Zentralblatt MATH, Vol. 1095 (21), 2006)
| SKU | Unavailable |
| ISBN 13 | 9783540311874 |
| ISBN 10 | 3540311874 |
| Title | Fundamentals of Algebraic Graph Transformation |
| Author | Hartmut Ehrig |
| Series | Monographs In Theoretical Computer Science An Eatcs Series |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Springer-Verlag Berlin and Heidelberg GmbH & Co. KG |
| Year published | 2006-02-10 |
| Number of pages | 390 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |


































