Single-pushout hypergraph rewriting through free completions
Different relationships between single-pushout rewriting of total and partial unary algebras are studied in this paper. In general, given a single-pushout transformation rule r of total algebras, a corresponding single-pushout transformation rule r' of partial algebras can be found such that si...
| Autores: | , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1997 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/83480 |
| Acceso en línea: | https://hdl.handle.net/2117/83480 |
| Access Level: | acceso abierto |
| Palabra clave: | Algebraic graph transformation Single pushout approach Partial algebras Hypergraphs free completions Àrees temàtiques de la UPC::Informàtica::Programació |
| Sumario: | Different relationships between single-pushout rewriting of total and partial unary algebras are studied in this paper. In general, given a single-pushout transformation rule r of total algebras, a corresponding single-pushout transformation rule r' of partial algebras can be found such that single-pushout derivations by the application of r are epireflections of single-pushout derivations by the application of r' But, unlike the case of double-pushout derivations, in this case single-pushout transformation rules of partial algebras become "larger" than corresponding rules of total algebras. Therefore, ad hoc methods are developed to compute pushouts of partial homomorphisms through free completions which, in the case of hypergraphs, may lead to a slight improvement in efficiency of pattern-matching and to a moderate improvement in efficiency of single-pushout transformations. |
|---|