Termination of Graph Transformation Systems Using Weighted Subgraph Counting
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913575989149696 |
|---|---|
| author | Overbeek, Roy Endrullis, Jörg |
| author_facet | Overbeek, Roy Endrullis, Jörg |
| contents | We introduce a termination method for the algebraic graph transformation framework PBPO+, in which we weigh objects by summing a class of weighted morphisms targeting them. The method is well-defined in rm-adhesive quasitoposes (which include toposes and therefore many graph categories of interest), and is applicable to non-linear rules. The method is also defined for other frameworks, including SqPO and left-linear DPO, because we have previously shown that they are naturally encodable into PBPO+ in the quasitopos setting. We have implemented our method, and the implementation includes a REPL that can be used for guiding relative termination proofs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2303_07812 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Termination of Graph Transformation Systems Using Weighted Subgraph Counting Overbeek, Roy Endrullis, Jörg Logic in Computer Science We introduce a termination method for the algebraic graph transformation framework PBPO+, in which we weigh objects by summing a class of weighted morphisms targeting them. The method is well-defined in rm-adhesive quasitoposes (which include toposes and therefore many graph categories of interest), and is applicable to non-linear rules. The method is also defined for other frameworks, including SqPO and left-linear DPO, because we have previously shown that they are naturally encodable into PBPO+ in the quasitopos setting. We have implemented our method, and the implementation includes a REPL that can be used for guiding relative termination proofs. |
| title | Termination of Graph Transformation Systems Using Weighted Subgraph Counting |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2303.07812 |