The algebraic approaches to graph transformation are based on the concept of gluing of
graphs corresponding to pushouts in suitable categories of graphs and graph morphisms …

We propose rewriting logic as a unifying framework for a wide range of Petri nets models.
We treat in detail place/transition nets and important extensions of the basic model by …

The concept of algebraic high-level net transformation systems combines two important lines
of research recently introduced in the literature: algebraic high-level nets (AHL-nets for …

The evolution in software and hardware systems from classical systems with rigid structures
to open, dynamic, and flexible structures has inspired the extension of Petri nets to …

The aim of this thesis is twofold: The first aim is to provide a formal basis for a uniform
approach to Petri nets including several different net classes as special cases. The second …

The main aims of this thesis are to provide an approach to the parallel composition of graph
grammars and a semantics for graph grammars, called the unfolding semantics, in which the …

We describe an approach for the verification of attributed graph transformation systems
(AGTS). AGTSs are graph transformation systems where graphs are labelled over an …

The notion of processes for low-level Petri nets based on occurrence nets is well known and
it represents the basis for the study of the non-sequential behavior of Petri nets. Processes …

As more and more office work gets automated computer-aided, Thee demand for computer-
aided cooperation and coordination energes and increases. It becomes a more apparent …

Following TER nets, an approach to the modelling of time in high-level Petri nets, we
propose a model of time within (attributed) graph transformation systems where logical …