On a Dynamic Logic for Graph Rewriting - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

On a Dynamic Logic for Graph Rewriting


Initially introduced by P. Balbiani, R. Echahed and A.Herzig, this dynamic logic is useful to talk about properties on termgraphs and to characterize transformations on these graphs. Also are presented the deterministic labelled graphs for which the logical framework is designed. This logic has been the starting point of a formal development, using the Coq proof assistant, to design a logical and algorithmic framework useful for verifyin and proving graph rewriting. The formalization allowed us to figure out some ambiguities in the involved concepts. This formalization is not the topic here but the clear view brought to us by the formal work, so the results will be expressed using the original mathematical objects of this logic. Some problems of this logic are demonstrated, relatively to the representation of graph rewriting. Some are minor issues but some are far more important for the adequation between the formulas about graph rewriting and the actual rewriting systems. Invalidating some resulting propositions, solutions are given to reestablish the logical characterization of graph rewriting, which was the initial purpose.
Fichier principal
Vignette du fichier
winckel_12536.pdf (193.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01233230 , version 1 (24-11-2015)


  • HAL Id : hal-01233230 , version 1
  • OATAO : 12536


Mathias Winckel, Ralph Matthes. On a Dynamic Logic for Graph Rewriting. 2nd International Workshop on Algebraic, Logical, and Algorithmic Methods of System Modeling, Specification and Verification (SMSV 2013), Jan 2013, Kherson, Ukraine. pp. 506-520. ⟨hal-01233230⟩
339 View
30 Download


Gmail Facebook X LinkedIn More