Proving termination of graph transformation systems using weighted type graphs over semirings
We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by generalizing to ordered semirings. In this way we obtain a...
Main Authors: | , , , |
---|---|
Other Authors: | , |
Format: | Article in Journal/Newspaper |
Language: | English |
Published: |
Springer
2015
|
Subjects: | |
Online Access: | https://research.tue.nl/en/publications/addf21d8-8f31-4917-bf8a-b9ff98f16ffa https://doi.org/10.1007/978-3-319-21145-9_4 |
id |
ftuniveindcris:oai:pure.tue.nl:publications/addf21d8-8f31-4917-bf8a-b9ff98f16ffa |
---|---|
record_format |
openpolar |
spelling |
ftuniveindcris:oai:pure.tue.nl:publications/addf21d8-8f31-4917-bf8a-b9ff98f16ffa 2024-09-30T14:30:41+00:00 Proving termination of graph transformation systems using weighted type graphs over semirings Bruggink, H.J.S. König, B. Nolte, D. Zantema, H. Parisi-Presicce, F. Westfechtel, B. 2015 https://research.tue.nl/en/publications/addf21d8-8f31-4917-bf8a-b9ff98f16ffa https://doi.org/10.1007/978-3-319-21145-9_4 eng eng Springer https://research.tue.nl/en/publications/addf21d8-8f31-4917-bf8a-b9ff98f16ffa urn:ISBN:978-3-319-21144-2 info:eu-repo/semantics/closedAccess Bruggink , H J S , König , B , Nolte , D & Zantema , H 2015 , Proving termination of graph transformation systems using weighted type graphs over semirings . in F Parisi-Presicce & B Westfechtel (eds) , Graph Transformation (8th International Conference, ICGT 2015, Held as Part of STAF 2015, L'Aquila, Italy, July 21-23, 2015. Proceedings) . Lecture Notes in Computer Science , vol. 9151 , Springer , Cham , pp. 52-68 . https://doi.org/10.1007/978-3-319-21145-9_4 contributionToPeriodical 2015 ftuniveindcris https://doi.org/10.1007/978-3-319-21145-9_4 2024-09-12T15:24:51Z We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by generalizing to ordered semirings. In this way we obtain a framework which includes the tropical and arctic type graphs of [6] and a new variant of arithmetic type graphs. These type graphs can be used to assign weights to graphs and to show that these weights decrease in every rewriting step in order to prove termination. We present an example involving counters and discuss the implementation in the tool Grez. Article in Journal/Newspaper Arctic Eindhoven University of Technology research portal Arctic 52 68 |
institution |
Open Polar |
collection |
Eindhoven University of Technology research portal |
op_collection_id |
ftuniveindcris |
language |
English |
description |
We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by generalizing to ordered semirings. In this way we obtain a framework which includes the tropical and arctic type graphs of [6] and a new variant of arithmetic type graphs. These type graphs can be used to assign weights to graphs and to show that these weights decrease in every rewriting step in order to prove termination. We present an example involving counters and discuss the implementation in the tool Grez. |
author2 |
Parisi-Presicce, F. Westfechtel, B. |
format |
Article in Journal/Newspaper |
author |
Bruggink, H.J.S. König, B. Nolte, D. Zantema, H. |
spellingShingle |
Bruggink, H.J.S. König, B. Nolte, D. Zantema, H. Proving termination of graph transformation systems using weighted type graphs over semirings |
author_facet |
Bruggink, H.J.S. König, B. Nolte, D. Zantema, H. |
author_sort |
Bruggink, H.J.S. |
title |
Proving termination of graph transformation systems using weighted type graphs over semirings |
title_short |
Proving termination of graph transformation systems using weighted type graphs over semirings |
title_full |
Proving termination of graph transformation systems using weighted type graphs over semirings |
title_fullStr |
Proving termination of graph transformation systems using weighted type graphs over semirings |
title_full_unstemmed |
Proving termination of graph transformation systems using weighted type graphs over semirings |
title_sort |
proving termination of graph transformation systems using weighted type graphs over semirings |
publisher |
Springer |
publishDate |
2015 |
url |
https://research.tue.nl/en/publications/addf21d8-8f31-4917-bf8a-b9ff98f16ffa https://doi.org/10.1007/978-3-319-21145-9_4 |
geographic |
Arctic |
geographic_facet |
Arctic |
genre |
Arctic |
genre_facet |
Arctic |
op_source |
Bruggink , H J S , König , B , Nolte , D & Zantema , H 2015 , Proving termination of graph transformation systems using weighted type graphs over semirings . in F Parisi-Presicce & B Westfechtel (eds) , Graph Transformation (8th International Conference, ICGT 2015, Held as Part of STAF 2015, L'Aquila, Italy, July 21-23, 2015. Proceedings) . Lecture Notes in Computer Science , vol. 9151 , Springer , Cham , pp. 52-68 . https://doi.org/10.1007/978-3-319-21145-9_4 |
op_relation |
https://research.tue.nl/en/publications/addf21d8-8f31-4917-bf8a-b9ff98f16ffa urn:ISBN:978-3-319-21144-2 |
op_rights |
info:eu-repo/semantics/closedAccess |
op_doi |
https://doi.org/10.1007/978-3-319-21145-9_4 |
container_start_page |
52 |
op_container_end_page |
68 |
_version_ |
1811635530780114944 |