Conjugated Graph Grammars as a Mean to Assure Consistency of Systems of Conjugated Graphs

Using graph grammars as a formal tool that supports the distributed system description necessitates a solution to both the problem of assurance of cohesion distributed subgraphs describing the system and making possible cooperation of (different) graph grammars (that will modify these graphs). The d...

Full description

Saved in:
Bibliographic Details
Published in2008 Third International Conference on Dependability of Computer Systems DepCoS-RELCOMEX pp. 119 - 126
Main Authors Kotulski, L., Fryz, L.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2008
Subjects
Graph transformations
parallel derivation
Online AccessGet full text

Cover

More Information
Summary:Using graph grammars as a formal tool that supports the distributed system description necessitates a solution to both the problem of assurance of cohesion distributed subgraphs describing the system and making possible cooperation of (different) graph grammars (that will modify these graphs). The definition of conjugated graph grammars, introduced in the paper, seems to be a possible solution of the above problem. Moreover, for some subclass of these grammars - the strictly conjugated graph grammar - it can be proven that consistency of conjugated graphs system will not be violated by productions of this kind of grammars. An example application SCG grammar limitation to the algebraic DPO approach is finally presented.
ISBN:0769531792
9780769531793
DOI:10.1109/DepCoS-RELCOMEX.2008.59