Algebraic approach to single-pushout graph transformation
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Algebraic transformation of unary partial algebras I. Double-pushout approach
Theoretical Computer Science
A Partial Algebras Approach to Graph Transformation
Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
Introduction to the Algebraic Theory of Graph Grammars (A Survey)
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Algebraic Approaches to Graph Transformation, Part I: Basic Concepts and Double Pushout Approach
Algebraic Approaches to Graph Transformation, Part I: Basic Concepts and Double Pushout Approach
Graph-grammars: An algebraic approach
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Fundamenta Informaticae
DEFINING OPERATIONAL BEHAVIOR OF OBJECT SPECIFICATIONS BY ATTRIBUTED GRAPH TRANSFORMATIONS
Fundamenta Informaticae
Hi-index | 0.00 |
The algebraic transformation of hypergraphs, under the so-called double-pushout (DPO) approach, was invented more than two decades ago, and thoroughly developed since then. We introduce in this paper a new approach to DPO algebraic transformation of hypergraphs and, more in general, of unary partial algebras, which generalizes the aforementioned “classical” DPO approach to hypergraph transformation. While the classical approach was based on the (usual) homomorphisms of hypergraphs, our new approach is based on the total conformisms, a type of morphisms of hypergraphs imported from the theory of partial algebras, which can be described, roughly speaking, as those mappings between hypergraphs that “reflect” the structure of the target object. In this paper we give both an algebraic and an operational characterization of this new DPO transformation, first for unary partial algebras and then, as a particular case, for hypergraphs. We also study its abstract properties related to parallelism and concurrency through the determination of the HLR conditions it satisfies with respect to several natural classes of morphisms.