David Sabel ; Hans Zantema - Termination of Cycle Rewriting by Transformation and Matrix Interpretation

lmcs:3206 - Logical Methods in Computer Science, March 17, 2017, Volume 13, Issue 1 - https://doi.org/10.23638/LMCS-13(1:11)2017
Termination of Cycle Rewriting by Transformation and Matrix Interpretation

Authors: David Sabel ; Hans Zantema

    We present techniques to prove termination of cycle rewriting, that is, string rewriting on cycles, which are strings in which the start and end are connected. Our main technique is to transform cycle rewriting into string rewriting and then apply state of the art techniques to prove termination of the string rewrite system. We present three such transformations, and prove for all of them that they are sound and complete. In this way not only termination of string rewriting of the transformed system implies termination of the original cycle rewrite system, a similar conclusion can be drawn for non-termination. Apart from this transformational approach, we present a uniform framework of matrix interpretations, covering most of the earlier approaches to automatically proving termination of cycle rewriting. All our techniques serve both for proving termination and relative termination. We present several experiments showing the power of our techniques.


    Volume: Volume 13, Issue 1
    Published on: March 17, 2017
    Accepted on: March 17, 2017
    Submitted on: March 17, 2017
    Keywords: Computer Science - Logic in Computer Science,F.4.2

    Linked data

    Source : ScholeXplorer IsReferencedBy DOI 10.1007/978-3-319-75396-6_13
    • 10.1007/978-3-319-75396-6_13
    • 10.1007/978-3-319-75396-6_13
    Modular Termination of Graph Transformation
    Plump, Detlef ;

    1 Document citing this article

    Share

    Consultation statistics

    This page has been seen 559 times.
    This article's PDF has been downloaded 342 times.