On Complexity of Coordination of Parallel Graph Transformations in GRADIS Framework

The graph transformations are very intuitive and precise way of modeling and specifying the systems. A wide range of applications supporting the visual modeling techniques, especially in the UML context, are supported by graph transformation techniques. The complementary graphs concept enables applying the distributed and parallel transformations using rules designed for the centralized transformations. This concept is supported by the GRADIS agent framework. The aim of the paper is to prove that in the case of the single pushout transformations, being one of the most popular mechanism of graph transformations - the algorithm of the agents (maintaining local graphs)coordination has polynomial complexity and it is time dependent errors and deadlock free.