Graph Transformation

<p>Theoretical Advances.- Concurrency Theorems for Non-linear Rewriting Theories.- A Generalized Concurrent Rule Construction for Double-Pushout Rewriting.- Transformations of Reaction Systems over Categories by means of Epi-Mono Factorization and Functors.- Graph Rewriting and Relabeling with PBPO+.- Incorrectness Logic for Graph Programs.- Powerful and NP-Complete: Hypergraph Lambek Grammars.- Evaluation Diversity for Graph Conditions.- Application Domains.- Host-Graph-Sensitive RETE Nets for Incremental Graph Pattern Matching.- Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammars.- Nets with Mana: A Framework for Chemical Reaction Modelling.- A Case Study on the Graph-transformational Modeling and Analysis of Puzzles.- Interval Probabilistic Timed Graph Transformation Systems.- Verifying Graph Programs with Monadic Second-Order Logic.- On the Complexity of Simulating Probabilistic Timed Graph Transformation Systems.- Tool Presentations.- Automated Checking and Completion of Backward Confluence for&nbsp;Hyperedge Replacement Grammars.- GrapePress - A Computational Notebook for Graph Transformations.</p>