Sesqui-pushout rewriting is an algebraic graph transformation approach that provides mechanisms for vertex cloning. If a vertex gets cloned, the original and the copy obtain the same context, i.e. all incoming and outgoing edges of the original are copied as well. This behaviour is not satisfactory in practical examples which require more control over the context cloning process. In this paper,...

We describe a concrete construction of all pushout complements for two given morphisms f : A→ B, m : B→ D in the category of hypergraphs, valid also for the case where f ,m are non-injective. It is based on the generation of suitable equivalence relations. We also give a combinatorial interpretation and show how well-known coefficients from combinatorics, such as the Bell numbers, can be recove...

In this paper, we studied the category of EQ-algebras and showed that it is complete, but not cocomplete, in general. We proved multiplicatively relative have coequlizers calculated coproduct pushout a special case. Also, constructed free EQ-algebra on singleton.

This paper deals with model transformation based on attributed graph rewriting. Our contribution investigates a single pushout approach for applying the rewrite rules. The computation of graph attributes is obtained through the use of typed λ -calculus with inductive types. In this paper we present solutions to cope with single pushout construction for the graph structure and the computations f...

Current standards reserve one bit in the ATM cell header to indicate loss priority. When congestion occurs ai a queue lower priority cells can be discarded in order to insure a smaller cell loss rate for higher priority cells. Strategies for determining which cells to discard are termed space priority buffer management schemes. In ihis paper two adjustable space priority schemes are studied, wh...

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-based transformation of hierarchically structured hypergraphs. In these graphs, distinguished hyperedges contain graphs that can be hierarchical again. Our framework extends the well-known double-pushout approach from fla...

We investigate and compare four variants of the doublepushout approach to graph transformation. Besides the traditional approach with arbitrary matching and injective right-hand morphisms, we consider three variations by employing injective matching and/or arbitrary right-hand morphisms in rules. For each of the three variations, we clarify whether the well-known commutativity theorems are stil...

Although there are many formal representations of architecture, actually determining what an architecture should be when systems are merged is largely based on context and human intuition. The goal of this paper is to find a mathematical model which supports this context and determines the architecture when the systems have been merged. A category of architectural models is presented, and the p...