Abstract is missing.
- Conditional BigraphsBlair Archibald, Muffy Calder, Michele Sevegnani. 3-19 [doi]
- Confluence up to GarbageGraham Campbell 0001, Detlef Plump. 20-37 [doi]
- Computing Embeddings of Directed BigraphsAlessio Chiapperini, Marino Miculan, Marco Peressotti. 38-56 [doi]
- A Categorical Semantics for Guarded Petri NetsFabrizio Genovese, David I. Spivak. 57-74 [doi]
- Unfolding Symbolic Attributed Graph GrammarsMaryam Ghaffari Saadat, Reiko Heckel, Fernando Orejas. 75-90 [doi]
- Single Pushout Rewriting in Comprehensive SystemsHarald König, Patrick Stünkel. 91-108 [doi]
- Initial Conflicts for Transformation Rules with Nested Application ConditionsLeen Lambers, Fernando Orejas. 109-127 [doi]
- Patch Graph RewritingRoy Overbeek, Jörg Endrullis. 128-145 [doi]
- Hypergraph Basic Categorial GrammarsTikhon Pshenitsyn. 146-162 [doi]
- Multilevel Typed Graph TransformationsUwe Wolter, Fernando Macías, Adrian Rutle. 163-182 [doi]
- Rewriting Theory for the Life Sciences: A Unifying Theory of CTMC SemanticsNicolas Behr, Jean Krivine. 185-202 [doi]
- Algebras for Tree Decomposable GraphsRoberto Bruni, Ugo Montanari, Matteo Sammartino. 203-220 [doi]
- Graph Parsing as Graph Transformation - Correctness of Predictive Top-Down ParsersFrank Drewes, Berthold Hoffmann, Mark Minas. 221-238 [doi]
- Graph Consistency as a Graduated Property - Consistency-Sustaining and -Improving Graph TransformationsJens Kosiol, Daniel Strüber 0001, Gabriele Taentzer, Steffen Zschaler. 239-256 [doi]
- Formal Verification of Invariants for Attributed Graph Transformation Systems Based on Nested Attributed Graph ConditionsSven Schneider 0001, Johannes Dyck, Holger Giese. 257-275 [doi]
- Optimistic and Pessimistic On-the-fly Analysis for Metric Temporal Graph LogicSven Schneider 0001, Lucas Sakizloglou, Maria Maximova, Holger Giese. 276-294 [doi]
- A Flexible and Easy-to-Use Library for the Rapid Development of Graph Tools in JavaH. J. Sander Bruggink, Barbara König 0001, Marleen Matjeka, Dennis Nolte, Lars Stoltenow. 297-306 [doi]
- Multiscale Graph Grammars Can Generate Cayley Graphs of Groups and MonoidsWinfried Kurth. 307-315 [doi]
- The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem VariantsCiaran McCreesh, Patrick Prosser, James Trimble 0001. 316-324 [doi]
- A Simulator for Probabilistic Timed Graph Transformation Systems with Complex Large-Scale TopologiesChristian Zöllner, Matthias Barkowsky, Maria Maximova, Melanie Schneider, Holger Giese. 325-334 [doi]