Strategic programming on graph rewriting systems

TL;DR

This paper introduces a strategy language for controlling graph rewriting rules, enabling high-level declarative programming within a graph transformation environment, enhancing flexibility and expressiveness in various applications.

Contribution

It presents a novel strategy language integrated into PORGY, allowing precise control over graph rewriting processes for diverse application domains.

Findings

The strategy language improves control over graph rewriting.

It is integrated into the PORGY environment.

Demonstrates applicability across multiple domains.

Abstract

We describe a strategy language to control the application of graph rewriting rules, and show how this language can be used to write high-level declarative programs in several application areas. This language is part of a graph-based programming tool built within the port-graph transformation and visualisation environment PORGY.