Matrix Approach to Graph Transformation: Matching and Sequences
In this work we present our approach to (simple di-)graph transformation based on an algebra of boolean matrices. Rules are represented as boolean matrices for nodes and edges and derivations can be efficiently characterized with boolean operations only. Our objective is to analyze properties inherent to rules themselves (without considering an initial graph), so this information can be calculated at specification time. We present basic results concerning well-formedness of rules and derivations (compatibility), as well as concatenation of rules, the conditions under which they are applicable (coherence) and permutations. We introduce the match, which permits the identification of a grammar rule left hand side inside a graph. We follow a similar approach to the single pushout approach (SPO), where dangling edges are deleted, but we first adapt the rule in order to take into account any deleted edge. To this end, a notation borrowed from functional analysis is used. We study the conditions under which the calculated data at specification time can be used when the match is considered.
KeywordsGraph Transformation Outgoing Edge Matrix Approach Graph Grammar Grammar Rule
Unable to display preview. Download preview PDF.
- 1.Braket notation intro: http://en.wikipedia.org/wiki/Bra-ket_notation
- 2.Courcelle, B.: Graph Rewriting: An Algebraic and Logic Approach. In: Handbook of Theoretical Computer Science, vol. B, pp. 193–242 (1990)Google Scholar
- 4.Ehrig, H., Heckel, R., Korff, M., Löwe, M., Ribeiro, L., Wagner, A., Corradini, A.: Algebraic Approaches to Graph Transformation - Part II: Single Pushout Approach and Comparison with Double Pushout Approach. In: , vol. 1, pp. 247–312 (1999)Google Scholar
- 7.Kahl, W.: A Relational Algebraic Approach to Graph Structure Transformation. Tech.Rep. 2002-03. Universität der Bundeswehr München (2002)Google Scholar
- 8.Lambers, L., Ehrig, H., Orejas, F.: Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs. In: Proc. GT-VMT 2006, ENTCS (Elsevier) (to appear, 2006)Google Scholar
- 10.Pérez Velasco, P.P., de Lara, J.: Towards a New Algebraic Approach to Graph Transformation: Long Version. Tech. Rep. of the School of Comp. Sci., Univ. Autónoma Madrid (2006), http://www.ii.uam.es/~jlara/investigacion/techrep_03_06.pdf
- 11.Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1, (Foundations); vol. 2, (Applications, Languages and Tools); vol. 3, (Concurrency, Parallelism and Distribution). World Scientific, Singapore (1999)Google Scholar
- 12.Schürr, A.: Programmed Graph Replacement Systems. In: , vol. 1, pp. 479–546Google Scholar