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

Authors:
Leszek Kotulski;Lukasz Fryz
Affiliations:
-;-
Venue:
DEPCOS-RELCOMEX '08 Proceedings of the 2008 Third International Conference on Dependability of Computer Systems DepCoS-RELCOMEX
Year:
2008

Citing 0
Cited 3

GRADIS --- Multiagent Environment Supporting Distributed Graph Transformations

ICCS '08 Proceedings of the 8th international conference on Computational Science, Part III
Using Graph Transformations in Distributed Adaptive Design System

ICCVG 2008 Proceedings of the International Conference on Computer Vision and Graphics: Revised Papers
Hypergraph distributed adaptive design supported by hypergraph replication

ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using graph grammars as a formal tool that supports the distributed system description necessitates a solution to both the problem of assurance of cohension 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 Cojugated 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.