Categories of Graph Rewrite Rules - CAPP
Pré-Publication, Document De Travail Année : 2024

Categories of Graph Rewrite Rules

Résumé

What are the legitimate morphisms between graph rewrite rules? The question is complicated by the diversity of approaches. From the familiar Double-Pushout (DPO) to the more recent PBPO and many others, the rules have different shapes, semantics (defined by direct transformations) and even matchings. We propose to represent these approaches by categories of rules, direct transformations and matchings related by functors in \emph{Rewriting Environments with Matchings}. From these we extract a so-called X-functor whose properties are key to make rule morphisms meaningful. We show that these properties are preserved by combining approaches and by restricting them to strict matchings.
Fichier principal
Vignette du fichier
submit-wadt.pdf (364.1 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04680852 , version 1 (29-08-2024)

Identifiants

  • HAL Id : hal-04680852 , version 1

Citer

Thierry Boy de la Tour. Categories of Graph Rewrite Rules. 2024. ⟨hal-04680852⟩
17 Consultations
4 Téléchargements

Partager

More