
Graph Transformation
Description
Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
The 14 papers presented were carefully reviewed and selected from 23 submissions. The papers cover a wide range of topics including theoretical approaches to graph transformation and their verification, model-driven engineering, chemical reactions as well as various applications. They are organized in the following topical sections: foundations; graph language and parsing; analysis and verification; and model transformation and tools.
More details
Other editions
Additional editions

Content
- Intro
- Foreword
- Preface
- Organization
- General and Fractional Hypertree Decompositions: Hard and Easy Cases (Invited Talk)
- Contents
- Foundations
- The Pullback-Pushout Approach to Algebraic Graph Transformation
- 1 Introduction
- 2 The pb-po Transformation of Structures
- 3 Relating pb-po with agree and sqpo Rewriting
- 4 Constraining the Effects of pb-po Rewriting
- 5 The pb-po Transformation of Attributed Structures
- 6 Conclusions and Related Works
- References
- Hierarchical Graph Transformation Revisited
- 1 Motivation
- 2 Extension of the Powerset
- 3 M -Adhesive Categories Using Coalgebras
- 4 M -Adhesive Categories of Hierarchical Graphs
- 5 Transformations of Hierarchical Graphs
- 5.1 Hierarchical Graphs
- 5.2 Multi-Hierarchical Graphs
- 5.3 Bigraphs as an Hierarchy
- 5.4 Graph Grouping
- 6 Related Work
- 7 Concluding Remarks
- References
- Geometric Modeling: Consistency Preservation Using Two-Layered Variable Substitutions
- 1 Introduction
- 2 G-maps and Their Transformations
- 2.1 G-maps
- 2.2 Consistent G-map Transformations Using DPO
- 3 Rule Variables for Geometric Modeling
- 3.1 Graph Transformations with Variables
- 3.2 Node Variables for Embedding Computation
- 3.3 Orbit Variables for Topological Rewriting
- 4 Rule Schemes for Specifying Modeling Operations
- 4.1 Combining Orbit Variables and Node Variables
- 4.2 Consistency Preservation
- 5 Conclusion
- References
- Chemical Graph Transformation with Stereo-Information
- 1 Introduction
- 2 Molecular Shapes
- 3 Model
- 3.1 Molecules as Typed Attributed Graphs
- 3.2 Transformation Rules and Derivations
- 4 Application Examples
- 4.1 Stereospecific Aconitase
- 4.2 Generation of Stereoisomers
- 5 Concluding Remarks
- A Code Examples
- A.1 Stereospecific Aconitase
- A.2 Stereoisomers of Tartaric Acid
- A.3 Non-trivial Stereoisomers
- References
- Graph Languages and Parsing
- Specifying Graph Languages with Type Graphs
- 1 Introduction
- 2 Preliminaries
- 3 Languages Specified by Type or Restriction Graphs
- 3.1 Closure and Decidability Properties
- 3.2 Closure Under Double-Pushout Rewriting
- 3.3 Relating Type Graph and Restriction Graph Languages
- 4 Type Graph Logic
- 5 Annotated Type Graphs
- 5.1 Decidability Properties for Multiply Annotated Graphs
- 5.2 Deciding Language Inclusion for Annotated Type Graphs
- 5.3 Closure Properties for Multiply Annotated Graphs
- 6 Conclusion
- References
- Fusion Grammars: A Novel Approach to the Generation of Graph Languages
- 1 Introduction
- 2 Graph-Transformational Preliminaries
- 3 Hyperedge Replacement Grammars
- 4 Fusion Grammars
- 5 Properties of Fusion Grammars
- 6 Transformation of Hyperedge Replacement Grammars into Fusion Grammars
- 7 Conclusion
- References
- Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars
- 1 Introduction
- 2 Hyperedge Replacement Grammars
- 3 Shift-Reduce Parsing of Strings
- 4 Predictive Shift-Reduce Parsing for HR Grammars
- 5 Predictive Shift-Reduce Parsability
- 6 Comparison with Related Work
- 7 Conclusions
- References
- Analysis and Verification
- Granularity of Conflicts and Dependencies in Graph Transformation Systems
- 1 Introduction
- 2 Preliminaries
- 2.1 Graph Transformation: Double-Pushout Approach
- 2.2 Conflicting Transformations
- 3 The Granularity of Conflicts and Dependencies
- 3.1 Conflicting Rules: Considering Different Granularity Levels
- 3.2 Relations Between Conflict Notions of Different Granularities
- 3.3 Relations of Conflicting Rule Concepts to Critical Pairs
- 3.4 Dual Notions for Dependencies
- 4 Related Work and Conclusion
- References
- k-Inductive Invariant Checking for Graph Transformation Systems
- 1 Introduction
- 2 Prerequisites
- 2.1 Foundations
- 2.2 Formal Model
- 3 k-Induction and Symbolic Encoding of Sequences
- 4 k-Inductive Invariant Checking
- 4.1 Step 1: Separation of Forbidden Patterns
- 4.2 Step 2: Construction of k-Sequences and Context Propagation
- 4.3 Step 3: Analysis of Sequences
- 5 Evaluation
- 6 Conclusion and Outlook
- References
- Probabilistic Timed Graph Transformation Systems
- 1 Introduction
- 2 Probabilistic Timed Automata
- 3 Probabilistic Timed Graph Transformation Systems
- 4 Modeling
- 5 Analysis
- 6 Conclusion and Future Work
- References
- Model Transformation and Tools
- Leveraging Incremental Pattern Matching Techniques for Model Synchronisation
- 1 Introduction and Motivation
- 2 Running Example and Preliminaries
- 2.1 From TGG Rules to Operational Rules
- 2.2 Delta Propagation via Operational Rules
- 3 Using Incremental Pattern Matching Techniques for TGG-Based Model Synchronisation
- 4 Correctness of Delta Propagation
- 5 Related Work
- 6 Conclusion and Future Work
- References
- Henshin: A Usability-Focused Framework for EMF Model Transformation Development
- 1 Introduction
- 2 Novel Usability-Oriented Features
- 2.1 Textual Syntax for Henshin
- 2.2 Static Checks
- 2.3 Advanced Refactoring
- 2.4 Advanced Editing Support
- 3 Related Work
- 4 Conclusion and Future Work
- References
- GRAPE - A Graph Rewriting and Persistence Engine
- Abstract
- 1 Introduction
- 2 Graph Rewriting and Graph Transformation Systems
- 2.1 Directed, Attributed, and Labeled (DAL) Graphs
- 2.2 Graph Transformation Rules
- 3 Related Work: Tool Support for Graph Rewriting
- 3.1 Visual Tools
- 3.2 Textual Tools
- 4 The Grape Architecture
- 5 A Taste of Grape - Introduction to Programming with Grape
- 5.1 Simple Rule Definition and Execution
- 5.2 Customizing Matching and Rewrite Semantics
- 5.3 Parameters and NACs
- 5.4 Transactions
- 5.5 Control Structures
- 6 Conclusions and Future Work
- References
- Table Graphs
- 1 Introduction
- 2 Background: SDMLib Graph Transformation Rules
- 3 Table Graph Structure
- 4 Table Graph Rewriting
- 5 Discussion
- 6 Summary
- References
- Author Index
System requirements
File format: PDF
Copy protection: Watermark-DRM (Digital Rights Management)
System requirements:
- Computer (Windows; MacOS X; Linux): Use the free software Adobe Reader, Adobe Digital Editions, or any other PDF viewer of your choice (see eBook Help).
- Tablet/Smartphone (Android; iOS): Install the free app Adobe Digital Editions or another reading app for eBooks, e.g., PocketBook (see eBook Help).
- E-reader: Bookeen, Kobo, Pocketbook, Sony, Tolino and many more (only limited: Kindle).
The file format PDF always displays a book page identically on any hardware. This makes PDF suitable for complex layouts such as those used in textbooks and reference books (images, tables, columns, footnotes). Unfortunately, on the small screens of e-readers or smartphones, PDFs are rather annoying, requiring too much scrolling.
This eBook uses Watermark-DRM, a „soft” copy protection. This means that there are no technical restrictions to prevent illegal distribution. However, there is a personalised watermark embedded in the eBook that can be used to identify the purchaser of the eBook in the event of misuse and to provide evidence for legal purposes.
For more information, see our eBook Help page.