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...

Full description

Bibliographic Details
Main Authors: Bruggink, HJS, König, B, Nolte, D, Zantema, H Hans
Language:English
Published: Springer 2015
Subjects:
Arctic
Online Access:http://repository.tue.nl/798487
id ftuniveindhoven:oai:library.tue.nl:798487
record_format openpolar
spelling ftuniveindhoven:oai:library.tue.nl:798487 2023-05-15T14:59:37+02:00 Proving termination of graph transformation systems using weighted type graphs over semirings Bruggink, HJS König, B Nolte, D Zantema, H Hans 2015 application/pdf http://repository.tue.nl/798487 en eng Springer Copyright (c) Bruggink, HJS Copyright (c) König, B Copyright (c) Nolte, D Copyright (c) Zantema, H Hans 2015 ftuniveindhoven 2018-12-26T13:46:48Z 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. Other/Unknown Material Arctic Eindhoven University of Technology (TU/e): Research Portal Arctic
institution Open Polar
collection Eindhoven University of Technology (TU/e): Research Portal
op_collection_id ftuniveindhoven
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.
author Bruggink, HJS
König, B
Nolte, D
Zantema, H Hans
spellingShingle Bruggink, HJS
König, B
Nolte, D
Zantema, H Hans
Proving termination of graph transformation systems using weighted type graphs over semirings
author_facet Bruggink, HJS
König, B
Nolte, D
Zantema, H Hans
author_sort Bruggink, HJS
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 http://repository.tue.nl/798487
geographic Arctic
geographic_facet Arctic
genre Arctic
genre_facet Arctic
op_rights Copyright (c) Bruggink, HJS
Copyright (c) König, B
Copyright (c) Nolte, D
Copyright (c) Zantema, H Hans
_version_ 1766331715207299072

Similar Items