Abstract is missing.
- Concurrency Theorems for Non-linear Rewriting TheoriesNicolas Behr, Russ Harmer, Jean Krivine. 3-21 [doi]
- A Generalized Concurrent Rule Construction for Double-Pushout RewritingJens Kosiol, Gabriele Taentzer. 22-39 [doi]
- Transformations of Reaction Systems Over Categories by Means of Epi-Mono Factorization and FunctorsAaron Lye. 40-59 [doi]
- +Roy Overbeek, Jörg Endrullis, Aloïs Rosset. 60-80 [doi]
- Incorrectness Logic for Graph ProgramsChristopher M. Poskitt. 81-101 [doi]
- Powerful and NP-Complete: Hypergraph Lambek GrammarsTikhon Pshenitsyn. 102-121 [doi]
- Evaluation Diversity for Graph ConditionsSven Schneider 0001, Leen Lambers. 122-141 [doi]
- Host-Graph-Sensitive RETE Nets for Incremental Graph Pattern MatchingMatthias Barkowsky, Holger Giese. 145-163 [doi]
- Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement GrammarsFrank Drewes, Berthold Hoffmann, Mark Minas. 164-184 [doi]
- Nets with Mana: A Framework for Chemical Reaction ModellingFabrizio Romano Genovese, Fosco Loregiàn, Daniele Palombi. 185-202 [doi]
- A Case Study on the Graph-Transformational Modeling and Analysis of PuzzlesHans-Jörg Kreowski, Aaron Lye. 203-220 [doi]
- Interval Probabilistic Timed Graph Transformation SystemsMaria Maximova, Sven Schneider 0001, Holger Giese. 221-239 [doi]
- Verifying Graph Programs with Monadic Second-Order LogicGia S. Wulandari, Detlef Plump. 240-261 [doi]
- On the Complexity of Simulating Probabilistic Timed Graph Transformation SystemsChristian Zöllner 0002, Matthias Barkowsky, Maria Maximova, Holger Giese. 262-279 [doi]
- Automated Checking and Completion of Backward Confluence for Hyperedge Replacement GrammarsIra Fesefeldt, Christoph Matheja, Thomas Noll 0001, Johannes Schulte. 283-293 [doi]
- GrapePress - A Computational Notebook for Graph TransformationsJens H. Weber. 294-302 [doi]