Graph Transformation Theory and Applications
Friday February 23, 2024, 3PM, online
Arend Rensink (University of Twente) In the Groove - Part 2

Tooling is essential for practical applications in any field. For Graph Transformation, one of the ways to quickly prototype your graph-like domain is by developing a model in GROOVE, a standalone tool that will give you isomorphism checking, state space exploration, and model checking based on a graph grammar consisting of a set of (optionally typed) rules and start graph, optionally complemented with a control program.

In this second part of the tutorials on GROOVE, the following advanced features will be covered: Nested rules, rule parameters, control (functions and recipes), and model checking. Participants are invited to install a local copy of GROOVE and to download the .zip file with examples from the tutorial, which is available on the event's GReTA page.

Zoom meeting registration link

YouTube live stream

Graph Transformation Theory and Applications
Friday February 9, 2024, 3PM, online
Carlos Zapata-Carratalá (Wolfram Institute, United States) Higher-Arity Algebra via Hypergraph Rewriting

In this talk I will present the state of the research on higher-arity algebras from the perspective of (labelled) hypergraph rewriting. Recent discoveries on ternary algebras enabled by the rewriting approach will be discussed and a proposal for computational foundations of formal objects generalizing diagrammatic calculi, such us the one in category theory, will be introduced. This presentation will be done using recently developed function paclets in Mathematica.

Zoom meeting registration link

YouTube live stream

Graph Transformation Theory and Applications
Friday January 26, 2024, 3PM, online
Arend Rensink (University of Twente) In the Groove

Tooling is essential for practical applications in any field. For Graph Transformation, one of the ways to quickly prototype your graph-like domain is by developing a model in GROOVE, a standalone tool that will give you isomorphism checking, state space exploration and model checking based on a graph grammar consisting of a set of (optionally typed) rules and start graph, optionally complemented with a control program.

In this talk I will show the capabilities of the tool, especially touching on the more advanced features such as nested rules, attribute manipulation, recipes (aka transactions) and various analysis techniques. Some of these are recent extensions. I am also very interested in any type of feedback regarding potential use cases and desirable features.

Zoom meeting registration link

YouTube live stream