Session 1, Thursday morning (June 24)

SubSession: Opening (Chair: Timo Keher)

09:30 – 10:00

Welcome and announcements

10:00 – 10:30

Hans-Joerg Kreowski and Aaron Lye

A case study on the graph-transformational modeling and analysis of puzzles

SubSession: Concurrency and Confluence (Chair: Leen Lambers)

11:00 – 11:30

Nicolas Behr, Russ Harmer, and Jean Krivine

Concurrency theorems for non-linear rewriting theories

11:30 – 12:00

Ira Fesefeldt, Christoph Matheja, and Thomas Noll

Automated checking and completion of backward confluence for hyperedge replacement grammars

12:00 – 12:30

Jens Kosiol and Gabriele Taentzer

A generalized concurrent rule construction for double-pushout rewriting

Session 2, Thursday afternoon (June 24)

SubSession: Novel Formalisms (Chair: Jean Krivine)

13:30 – 14:00

Aaron Lye

Transformations of reaction systems over categories by means of epi-mono factorization and functors

14:00 – 14:30

Roy Overbeek, Joerg Endrullis, and Aloïs Rosset

Graph rewriting and relabeling with PBPO+

14:00 – 14:30

Tikhon Pshenitsyn

Powerful and NP-complete: Hypergraph Lambek grammars

(Best Theoretical paper, awarded by EATCS)

SubSession: Graph Transformation – Past, Present, Future (Chair: Reiko Heckel)

15:30 – 16:00

Berthold Hoffman

Introductory talk

16:00 – 17:00

Nicolas Behr, Andrea Corradini, Hans-Joerg Kreowski, Gabriele Taentzer

A panel on the current state of affairs

Session 3, Friday morning (June 25)

SubSession: Invited talk (Chair: Fabio Gadducci)

09:30 – 10:30

Joost-Pieter Katoen

Verification conquers reliability engineering

SubSession: Logics and Constraints (Chair: Fernando Orejas)

11:00 – 11:30

Christopher M. Poskitt

Incorrectness logic for graph programs

11:30 – 12:00

Sven Schneider and Leen Lambers

Evaluation diversity for graph conditions

12:00 – 12:30

Gia Wulandari and Detlef Plump

Verifying graph programs with monadic second-order logic

Session 4, Friday afternoon (June 25)

SubSession: Nets and Parsing (Chair: Paolo Bottoni)

13:30 – 14:00

Matthias Barkowsky and Holger Giese

Host-graph-sensitive RETE nets for incremental graph pattern matching

14:00 – 14:30

Frank Drewes, Berthold Hoffmann, and Mark Minas

Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars

(Best Software Science paper, awarded by EASST)

14:30 – 15:00

Fabrizio Genovese, Fosco Loregian, and Daniele Palombi

Nets with mana: A framework for chemical reaction modelling

SubSession: Probabilistic Systems and Experimentation (Chair: Yngve Lamo)

15:30 – 16:00

Maria Maximova, Sven Schneider, and Holger Giese

Interval probabilistic timed graph transformation systems

16:00 – 16:30

Jens Weber

GrapePress – A computational notebook for graph transformations

(Best Tool paper, awarded by EASST)

16:30 – 17:00

Christian Zöllner, Matthias Barkowsky, Maria Maximova, and Holger Giese

On the complexity of simulating probabilistic timed graph transformation systems

SubSession: Closing (Chairs: Fabio Gadducci and Timo Keher)

17:00 – 17:30

Final announcements