In this paper we introduce the notions of nested constraints and application conditions, short
nested conditions. For a category associated with a graphical representation such as …

Sesqui-pushout (S q PO) rewriting—“sesqui” means “one and a half” in Latin—is a new
algebraic approach to abstract rewriting in any category. S q PO rewriting is a deterministic …

When graph transformation is used for programming purposes, large graphs should be
structured in order to be comprehensible. In this paper, we present an approach for the rule …

We identify a set of programming constructs ensuring that a programming language based
on graph transformation is computationally complete. These constructs are (1) …

A major goal of this thesis is the ability to determine the correctness of graphical
specifications consisting of a graph precondition, a graph program and graph postcondition …

How do spaces in physics emerge from pregeometric discrete building blocks governed by
computational rules? To address this question we investigate non-deterministic rewriting …

The traditional double-pushout approach to graph transformation does not allow to change
node labels in an arbitrary context. We propose a simple solution to this problem, namely to …

It is shown that it is undecidable in general whether a terminating graph rewriting system is
confluent or not—in contrast to the situation for term and string rewriting systems. Critical …

This article presents a novel algorithmic methodology for performing automated
diagrammatic deductions over combinatorial structures, using a combination of modified …

We investigate algebraic and compositional properties of abstract multiway rewriting
systems, which are archetypical structures underlying the formalism of the Wolfram model …