On graph rewriting systems termination through language theory - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year :

On graph rewriting systems termination through language theory

Guillaume Bonfante
  • Function : Author
  • PersonId : 864819
Miguel Couceiro


The termination issue that we tackle is rooted in Natural Language Processing where computations are performed by graph rewriting systems (GRS) that may contain a large number of rules, often in the order of thousands. Thus algorithms become mandatory to verify the termination of such systems. The notion of graph rewriting that we consider does not make any assumption on the structure of graphs (they are not "term graphs", "port graphs" nor "drags"). This lack of algebraic structure 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
journal.pdf (626.55 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03629573 , version 1 (04-04-2022)


  • HAL Id : hal-03629573 , version 1


Guillaume Bonfante, Miguel Couceiro. On graph rewriting systems termination through language theory. 2022. ⟨hal-03629573⟩
42 View
44 Download


Gmail Facebook Twitter LinkedIn More