The algebraic approaches to graph transformation are based on the concept of gluing of graphs, modelled by pushouts in suitable categories of graphs and graph morphisms. This allows one not only to give an explicit algebraic or set theoretical description of the constructions, but also to use concepts and results from category theory in order to build up a rich theory and to give elegant proofs even in complex situations. In this chapter we start with an overwiev of the basic notions common to the two algebraic approaches, the "double-pushout (DPO) approach" and the "single-pushout (SPO) approach"; next we present the classical theory and some recent development of the double-pushout approach. The next chapter is devoted instead to the single-pushout approach, and it is closed by a comparison between the two approaches. -- This document will appear as a chapter of the "The Handbook of Graph Grammars. Volume I: Foundations", G. Rozenberg (Ed.), World Scientific.
Cited By
- Boubaker A, Leshob A, Mili H and Charif Y (2017). A pattern-based approach to extract REA value models from business process models, International Journal of Intelligent Systems in Accounting and Finance Management, 24:1, (29-48), Online publication date: 1-Jan-2017.
- El Boussaidi G and Mili H (2019). Understanding design patterns — what is the problem?, Software—Practice & Experience, 42:12, (1495-1529), Online publication date: 1-Dec-2012.
- El-Sharkawy S and Schmid K A heuristic approach for supporting product innovation in requirements engineering Proceedings of the 17th international working conference on Requirements engineering: foundation for software quality, (78-93)
- Lee J and Muthig D Feature-Oriented Analysis and Specification of Dynamic Product Reconfiguration Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems, (154-165)
Wermelinger M, Lopes A and Fiadeiro J A graph based architectural (Re)configuration language Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering, (21-32)- Wermelinger M, Lopes A and Fiadeiro J (2001). A graph based architectural (Re)configuration language, ACM SIGSOFT Software Engineering Notes, 26:5, (21-32), Online publication date: 1-Sep-2001.
- Wermelinger M and Fiadeiro J (2019). Algebraic software architecture reconfiguration, ACM SIGSOFT Software Engineering Notes, 24:6, (393-409), Online publication date: 1-Nov-1999.
- Wermelinger M and Fiadeiro J Algebraic software architecture reconfiguration Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering, (393-409)
Recommendations
The uniqueness condition for the double pushout transformation of algebras
The double pushout approach to the algebraic graph transformation of hypergraphs was invented 30 years ago and it has been generalized since then to more general objects, like for instance relational systems or total and partial unary algebras. We have ...
Double-pushout graph transformation revisited
In this paper we investigate and compare four variants of the double-pushout approach to graph transformation. As well as the traditional approach with arbitrary matching and injective right-hand morphisms, we consider three variations by employing ...
Algebraic structures on double and plane posets
We study the Hopf algebra of double posets and two of its Hopf subalgebras, the Hopf algebras of plane posets and of posets "without N". We prove that they are free, cofree, self-dual, and we give an explicit Hopf pairing on these Hopf algebras. We also ...