By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

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.

Published in:

Dependability of Computer Systems, 2008. DepCos-RELCOMEX '08. Third International Conference on

Date of Conference:

26-28 June 2008