@article {Bergmann-gtvmt09,
	title = {Parallelization of Graph Transformation Based on Incremental Pattern Matching},
	journal = {Electronic Communications of the EASST, Proceedings of the Eighth International Workshop on Graph Transformation and Visual Modeling Techniques},
	volume = {18},
	year = {2009},
	abstract = {<p>
	Graph transformation based on incremental pattern matching explicitly stores all occurrences of patterns (left-hand side of rules) and updates this result cache upon model changes. This allows instantaneous pattern queries at the expense of costlier model manipulation and higher memory consumption. Up to now, this incremental approach has considered only sequential execution despite the inherently distributed structure of the underlying match caching mechanism. The paper explores various possibilities of parallelizing graph transformation to harness the power of modern multi-core, multi-processor computing environments: (i) incremental pattern matching enables the concurrent execution of model manipulation and pattern matching; moreover, (ii) pattern matching itself can be parallelized along caches.</p>
},
	keywords = {Viatra},
	url = {http://eceasst.cs.tu-berlin.de/index.php/eceasst/article/view/265/249},
	author = {G{\'a}bor Bergmann and Istv{\'a}n R{\'a}th and D{\'a}niel Varr{\'o}}
}
