2015/11/03 by Paolo Bottoni, Bottoni, Paolo, Kathrin Hoffmann +3
Computer Science · #Logic, programming, and type systems #Model-Driven Software Engineering Techniques #Natural Language Processing Techniques
paper · doi:10.14279/tuj.eceasst.4.15
openalex publication_date 2024/03/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
We proceed with the study of termination properties in the double pushout approach to algebraic rewriting, and show a concrete termination criterion for rewriting systems with inhibitors. Inhibitors prevent elements in an algebra to participate in rule matches, so that termination depends only on whether new possibilities for matches are created. The notion of inhibitor can be extended to considering different levels of inhibition, by which the ability of an element to participate in a match is progressively reduced. We illustrate the approach by considering some application contexts in model transformation.