• формат pdf
  • размер 2.54 МБ
  • добавлен 24 октября 2011 г.
Ehrig H., Ehrig K., Prange U., Taentzer G. Fundamentals of Algebraic Graph Transformation
Издательство Springer, 2006, -373 pp.

In the late 1960s and early 1970s, the concepts of graph transformation and graph grammars started to become of interest in picture processing and computer science. The main idea was to generalize well-known rewriting techniques from strings and trees to graphs, leading to graph transformations and graph grammars. In particular, the concepts of algebraic graph transformation gained considerable importance in the early years and have done so even more in the last decade. Today, algebraic graph transformation techniques are playing a central role in theoretical computer science, as well as in several applied areas, such as software engineering, concurrent and distributed systems, and visual modeling techniques and model transformations.
The aim of this book is to present the fundamentals of algebraic graph transformation techniques for the purposes of teaching, research, and development, with respect to the following aspects:
1. Fundamentals in the sense of an introduction with a detailed motivation to algebraic graph transformation, including the main constructions and results, as well as their generalization to high-level replacement systems, with a wide range of applications in computer science and related areas.
2. Fundamentals in the sense of mathematical theories, which are the basis for precise definitions, constructions, and results, and for the implementation of algebraic graph transformation in a tool environment called AGG.
3. Fundamentals in the sense of the integration of data types and process specification techniques, where the concepts of algebraic data types are integrated with graph rewriting, leading to the concept of typed attributed graph transformation.
In accordance with these aims, the book is organized in four parts:
Part I: Introduction to Graph Transformation Systems, where graph transformations based on classical graphs are introduced and the main constructions and results are motivated in detail.
Part II: Adhesive High-Level Replacement Categories and Systems, where the theory is presented in a categorical framework with applications to a large variety of high-level structures, especially transformation systems for various kinds of graphs and Petri nets.
Part III: Typed Attributed Graph Transformation Systems, where the concepts of typed attributed graphs are carefully introduced and the main results are obtained as instantiations of Part II.
Part IV: Case Study on Model Transformation, and Tool Support by AGG, where the concepts of typed attributed graph transformation are applied in a separate case study to visual model transformation, and it is shown how the theory is implemented in the AGG tool.
The book is organized in such a way that the reader can switch, after the introduction in Part I, immediately to Part III; however, the concepts and results in both of these parts are instantiations of the categorical theory presented in Part II.
The material of this book is based on a theory of algebraic graph transformation developed at the Technical University of Berlin in cooperation with several inteational partners in the EU projects COMPUGRAPH, GETGRATS, APPLIGRAPH and SEGRAVIS. This material can also be seen as being in the tradition of algebraic specification techniques, described in the EATCS series of Monographs in Theoretical Computer Science.
Part I Introduction to Graph Transformation Systems.
General Introduction.
Graphs, Typed Graphs, and the Gluing Construction.
Graph Transformation Systems.
Part II 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.
Part III 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 TAGT Systems.
Typed Attributed Graph Transformation with Inheritance.
Part IV Case Study on Model Transformation, and Tool Support by AGG.
Case Study on Model Transformation.
Implementation of Typed Attributed Graph Transformation by AGG.
Appendices.
A A Short Introduction to Category Theory.
B A Short Introduction to Signatures and Algebras.
C Detailed Proofs.
Похожие разделы
Смотрите также

Berge C. Graphs and Hypergraphs

  • формат djvu
  • размер 3.79 МБ
  • добавлен 22 октября 2011 г.
Издательство North Holland, 1976, -546 pp. Graph theory has had an unusual development. Problems involving graphs first appeared in the mathematical folklore as puzzles (e.g. K?nigsberg bridge problem). Later, graphs appeared in electrical engineering (Kirchhof’s Law), chemistry, psychology and economics before becoming aI unified field of study. Today, graph theory is one of the most flourishing branches of modern algebra with wide application...

Bollobas B. Modern Graph Theory

  • формат djvu
  • размер 9.99 МБ
  • добавлен 13 декабря 2010 г.
Springer, 1998. - 394 pages. The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The v...

Capobianco M., Moluzzo J.C. Examples and Counterexamples in Graph Theory

  • формат pdf
  • размер 12.91 МБ
  • добавлен 16 марта 2011 г.
North-Holland, 1978. - 270 pages. It is a real pleasure, indeed an honor, for me to have been invited by Mike Capobianco and John Molluzzo to write an introduction to this imaginative and valuable addition to graph theory. Let me therefore present a few of my thoughts on the current status of graph theory and how their work contributes to the field. Graphs have come a long way since 1736 when Leonhard Euler applied a graph-theoretic argument to...

Chartrand G., Lesniak L. Graphs and Digraphs

  • формат djvu
  • размер 2.67 МБ
  • добавлен 26 октября 2011 г.
Издательство Chapman and Hall/CRC Press, 1996, -429 pp. Graph theory is a major area of combinatorics, and during recent decades, graph theory has developed into a major area of mathematics. In addition to its growing interest and importance as a mathematical subject, it has applications to many fields, including computer science and chemistry. As in the first edition of Graphs & Digraphs (M. Behzad, G. Chartrand, L. Lesniak) and the second...

Chung F.R.K. Lectures on Spectral Graph Theory

  • формат pdf
  • размер 190.11 КБ
  • добавлен 01 декабря 2011 г.
Eigenvalues and the Laplacian of a graph. The Laplacian and eigenvalues. Basic facts about the spectrum of a graph. Eigenvalues of weighted graphs. Eigenvalues and random walks. Isoperimetric problems. History. The Cheeger constant of a graph. The edge expansion of a graph. The vertex expansion of a graph. A characterization of the Cheeger constant. Isoperimetric inequalities for cartesian products. Diameters and eigenvalues. The diameter of a gr...

Diestel R. Graph Theory

  • формат djvu
  • размер 2.43 МБ
  • добавлен 01 января 2011 г.
Springer, 2005. - 410 pages. The third edition of this standard textbook of modern graph theory has been carefully revised, updated, and substantially extended. Covering all its major recent developments it can be used both as a reliable textbook for an introductory course and as a graduate text: on each topic it covers all the basic material in full detail, and adds one or two deeper results (again with detailed proofs) to illustrate the more a...

Gross J.L., Yellen J. (editors) Handbook of Graph Theory

  • формат pdf
  • размер 9.22 МБ
  • добавлен 01 января 2011 г.
CRC, 2003. - 1192 pages. The Handbook of Graph Theory is the most comprehensive single-source guide to graph theory ever published. Best-selling authors Jonathan Gross and Jay Yellen assembled an outstanding team of experts to contribute overviews of more than 50 of the most significant topics in graph theory-including those related to algorithmic and optimization approaches as well as "pure" graph theory. They then carefully edited the compilat...

Haynes T.W., Hedetniemi S.T., Slater P.J. Fundamentals of Domination in Graphs

  • формат djvu
  • размер 7.2 МБ
  • добавлен 22 октября 2011 г.
Издательство Marcel Dekker, 1998, -455 pp. The result of these objectives is a book that is appropriate for use at several different levels. Containing the only existing comprehensive bibliography on domination, it is a valuable reference book. It is suitable as a textbook for graduate level courses in graph theory and could also be used by advanced un- undergraduates. As a textbook, it is complete with exercises ranging in level from introducto...

Kaufmann M., Wagner D. (editors) Drawing Graphs: Methods and Models

  • формат pdf
  • размер 11.12 МБ
  • добавлен 12 сентября 2011 г.
Springer, 2001. - 326 pages. Graph drawing comprises all aspects of visualizing structural relations between objects. The range of topics dealt with extends from graph theory, graph algorithms, geometry, and topology to visual languages, visual perception, and information visualization, and to computer-human interaction and graphics design. This monograph gives a systematic overview of graph drawing and introduces the reader gently to the state...

Kepner J., Gilbert J. Graph Algorithms in the Language of Linear Algebra

  • формат pdf
  • размер 4.67 МБ
  • добавлен 15 декабря 2011 г.
SIAM, 2011. - 389 pages. Graphs are among the most important abstract data types in computer science, and the algorithms that operate on them are critical to modern life. Graphs have been shown to be powerful tools for modeling complex problems because of their simplicity and generality. Graph algorithms are one of the pillars of mathematics, informing research in such diverse areas as combinatorial optimization, complexity theory, and topology...