On termination of Graph Rewriting Systems through language theory - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

On termination of Graph Rewriting Systems through language theory

(1) , (2)
1
2
Guillaume Bonfante
  • Function : Author
  • PersonId : 830993
Miguel Couceiro

Abstract

The termination issue we tackle is rooted in natural language processing where graph rewriting systems (GRS) may contain a large number of rules, often in the order of thousands. Decidable concepts thus become mandatory to verify the termination of such systems. The notion of graph rewriting consider does not make any assumption on the structure of graphs (they are not “term graphs”, “port graphs” nor drags). The lack of algebraic structure in our setting led us to proposing two orders on graphs inspired from language theory: the matrix multiset-path order and the rational embedding order. We show that both are stable by context, which we then use to obtain the main contribution of the paper: under a suitable notion of “interpretation”, a GRS is terminating if and only if it is compatible with an interpretation.
Fichier principal
Vignette du fichier
terminaison.pdf (543.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02478696 , version 1 (14-02-2020)

Identifiers

  • HAL Id : hal-02478696 , version 1

Cite

Guillaume Bonfante, Miguel Couceiro. On termination of Graph Rewriting Systems through language theory. 2020. ⟨hal-02478696⟩
59 View
55 Download

Share

Gmail Facebook Twitter LinkedIn More