On the Effective Distribution and Maintenance of Knowledge Represented by Complementary Graphs
Graph transformations are a powerful tool enabling the formal description of the behavior of software systems. In most cases, however, this tool fails due to its low efficiency. This can be overcome by introducing parallel graph transformations. The concept of complementary graphs enables two things: the decomposition of a centralized graph into many cooperating subgraphs, and their parallel transformations. Such a model is very useful in an agent environment, where subgraphs represent an individual knowledge of particular agents; this knowledge may be partially replicated and exchanged between the agents. The rules of a cooperation and an implicit synchronization of a knowledge, represented in this way, have been already defined in . The second very important issue is the way of an initial graph distribution assuming the size criterion: the heuristic method proposed previously succeeds in 60% (i.e. 60% of subgraphs is consistent with the criterion). The method presented in this paper gives over 90% fit.
KeywordsMultiagent System Transformation Rule Relaxation Method Graph Transformation Graph Grammar
Unable to display preview. Download preview PDF.
- 1.Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., Löwe, M.: Algebraic approaches to graph transformation - part i: Basic concepts and double pushout approach. In: Handbook of Graph Grammars and Computing by Graph Transformations. Foundations, vol. 1, pp. 163–246. World Scientific (1997)Google Scholar
- 2.Ehrig, H., Heckel, R., Lowe, M., Ribeiro, L., Wagner, A.: Algebraic Approaches to Graph Transformation Part II: Single Pushout and Comparison with Double Pushout Approach. In: Handbook of Graph Grammars and Computing by Graph Transformations. Foundations, vol. 1, pp. 247–312. World Scientific (1997)Google Scholar
- 6.Kotulski, L.: Parallel Allocation of the Distributed Software using Node Label Controlled Graph Grammars. Automatyka 2(2), 321–338 (2008)Google Scholar
- 9.Kotulski, L., Sędziwy, A.: Agent Framework For Decomposing a Graph Into the Equally Sized Subgraphs. In: WORLDCOMP 2008 Conference, Foundations of Computer Science, pp. 245–250 (2008)Google Scholar
- 12.Kotulski, L., Sędziwy, A.: Various agent strategies in the graph partioninig optimization in the GRADIS framework. In: Information systems architecture and technology: models of the organisation’s risk management. Oficyna Wydawnicza Politechniki Wrocawskiej, pp. 269–279 (2008)Google Scholar
- 13.Kotulski, L., Sędziwy, A.: On the Complexity of Coordination of Parallel Graph Transformations. In: Proceedings at the Fourth International Conference on Dependability of Computer Systems DepCoS, RELCOMEX 2009, pp. 279–289. IEEE Computer Society Order Number P3674 (2009)Google Scholar