scispace - formally typeset
Open AccessBook

Fundamentals of Algebraic Graph Transformation

Reads0
Chats0
TLDR
This is the first textbook treatment of the algebraic approach to graph transformation, based on algebraic structures and category theory, and contains an introduction to classical graphs.
Abstract
This is the first textbook treatment of the algebraic approach to graph transformation, based on algebraic structures and category theory. It contains an introduction to classical graphs. Basic and advanced results are first shown for an abstract form of replacement systems and are then instantiated to several forms of graph and Petri net transformation systems. The book develops typed attributed graph transformation and contains a practical case study.

read more

Citations
More filters
Book

Model-Driven Software Engineering in Practice

TL;DR: This book is to provide an agile and flexible tool to introduce you to the MDSE world, thus allowing you to quickly understand its basic principles and techniques and to choose the right set of MDSE instruments for your needs so that you can start to benefit from MDSE right away.
Proceedings ArticleDOI

Henshin: advanced concepts and tools for in-place EMF model transformations

TL;DR: Henshin is a new language and associated tool set for in-place transformations of EMF models using pattern-based rules on the lowest level, which can be structured into nested transformation units with well-defined operational semantics.
Journal ArticleDOI

Interacting Quantum Observables: Categorical Algebra and Diagrammatics

TL;DR: The ZX-calculus as mentioned in this paper is an intuitive and universal graphical calculus for multi-qubit systems, which greatly simplifies derivations in the area of quantum computation and information.
Book ChapterDOI

Bidirectional Transformations: A Cross-Discipline Perspective

TL;DR: The state of the art and technical presentations delivered at the GRACE International Meeting on Bidirectional Transformations are surveyed and a new effort to establish a benchmark for bidirectional transformations is introduced.
Journal ArticleDOI

Correctness of high-level transformation systems relative to nested conditions†

TL;DR: It is shown that nested graph conditions are expressively equivalent to first-order graph formulas, and a part of the proof includes transformations between two satisfiability notions of conditions, namely -s Satisfiability and -satisfiability.