Termination of Graph Transformation Systems via Generalized Weighted Type Graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911502123925504 |
|---|---|
| author | Endrullis, Jörg Overbeek, Roy |
| author_facet | Endrullis, Jörg Overbeek, Roy |
| contents | We refine the weighted type graph technique for proving termination of double pushout (DPO) graph transformation systems. We increase the power of the approach for graphs, we generalize the technique to other categories, and we allow for variations of DPO that occur in the literature. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2307_07601 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Termination of Graph Transformation Systems via Generalized Weighted Type Graphs Endrullis, Jörg Overbeek, Roy Logic in Computer Science We refine the weighted type graph technique for proving termination of double pushout (DPO) graph transformation systems. We increase the power of the approach for graphs, we generalize the technique to other categories, and we allow for variations of DPO that occur in the literature. |
| title | Termination of Graph Transformation Systems via Generalized Weighted Type Graphs |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2307.07601 |