Proving termination of graph transformation systems using weighted type graphs over semirings

H.J.S. Bruggink, B. König, D. Nolte, H. Zantema

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

7 Citaten (Scopus)
3 Downloads (Pure)

Samenvatting

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.
Originele taal-2Engels
TitelGraph Transformation (8th International Conference, ICGT 2015, Held as Part of STAF 2015, L'Aquila, Italy, July 21-23, 2015. Proceedings)
RedacteurenF. Parisi-Presicce, B. Westfechtel
Plaats van productieCham
UitgeverijSpringer
Pagina's52-68
ISBN van geprinte versie978-3-319-21144-2
DOI's
StatusGepubliceerd - 2015

Publicatie series

NaamLecture Notes in Computer Science
Volume9151
ISSN van geprinte versie0302-9743

Vingerafdruk Duik in de onderzoeksthema's van 'Proving termination of graph transformation systems using weighted type graphs over semirings'. Samen vormen ze een unieke vingerafdruk.

Citeer dit