The single-pushout approach to graph transformation is extended to the algebraic transformation of partial many-sorted unary algebras. The main result presented in this article is an algebraic characterization of the single-pushout transformation in the categories of all conformisms, all closed quomorphisms, and all closed-domain closed quomorphisms of unary partial algebras over a given signature, together with a corresponding operational characterization that may serve as a basis for implementation. Moreover, all three categories are shown to satisfy all of the HLR (High Level Replacement) conditions for parallelism, taking as occurrences the total morphisms in each category. Another important result presented in this article is the def...
AbstractParallel and distributed derivations are introduced and studied in the single-pushout approa...
AbstractThis paper is a survey of the results obtained in [9], where the basis to develop the DPO tr...
In this paper we propose an axiomatization of ‘partially abstract graphs’, i.e., of suitable classes...
The single-pushout approach to graph transformation is extended to the algebraic transformation of...
AbstractThe single-pushout approach to graph transformation is extended to the algebraic transformat...
this article is an algebraic characterization of the single-pushout transformation in the categories...
AbstractThe transformation of total graph structures has been studied from the algebraic point of vi...
The transformation of total graph structures has been studied from the algebraic point of view over ...
Different relationships between single-pushout rewriting of total and partial unary algebras are stu...
AbstractThe single-pushout approach to graph transformation interprets a double-pushout transformati...
The algebraic graph transformation approach originates in the so-called double pushout approach. The...
The algebraic approaches to graph transformation are based on the concept of gluing of graphs, mode...
The algebraic approaches to graph transformation are based on the concept of gluing of graphs, mode...
The elegance of the single-pushout (SPO) approach to graph transformations arises from substituting ...
AbstractIn this paper we study single-pushout transformation in a category of spans, a generalizatio...
AbstractParallel and distributed derivations are introduced and studied in the single-pushout approa...
AbstractThis paper is a survey of the results obtained in [9], where the basis to develop the DPO tr...
In this paper we propose an axiomatization of ‘partially abstract graphs’, i.e., of suitable classes...
The single-pushout approach to graph transformation is extended to the algebraic transformation of...
AbstractThe single-pushout approach to graph transformation is extended to the algebraic transformat...
this article is an algebraic characterization of the single-pushout transformation in the categories...
AbstractThe transformation of total graph structures has been studied from the algebraic point of vi...
The transformation of total graph structures has been studied from the algebraic point of view over ...
Different relationships between single-pushout rewriting of total and partial unary algebras are stu...
AbstractThe single-pushout approach to graph transformation interprets a double-pushout transformati...
The algebraic graph transformation approach originates in the so-called double pushout approach. The...
The algebraic approaches to graph transformation are based on the concept of gluing of graphs, mode...
The algebraic approaches to graph transformation are based on the concept of gluing of graphs, mode...
The elegance of the single-pushout (SPO) approach to graph transformations arises from substituting ...
AbstractIn this paper we study single-pushout transformation in a category of spans, a generalizatio...
AbstractParallel and distributed derivations are introduced and studied in the single-pushout approa...
AbstractThis paper is a survey of the results obtained in [9], where the basis to develop the DPO tr...
In this paper we propose an axiomatization of ‘partially abstract graphs’, i.e., of suitable classes...