Incremental Pattern Matching in Graph-Based State Space Exploration


Ghamarian, Amir Hossein and Jalali, Arash and Rensink, Arend (2010) Incremental Pattern Matching in Graph-Based State Space Exploration. Electronic Communications of the EASST . ISSN 1863-2122

[img] PDF
Restricted to UT campus only
: Request a copy
Abstract:Graph pattern matching is among the most costly operations in any graph transformation system. Incremental pattern matching aims at reducing this cost by incrementally updating, as opposed to totally recalculating, the possible matches of rules in the graph grammar at each step of the transformation. In this paper an implementation of one such algorithm is discussed with respect to the GROOVE toolset, with a special emphasis put on state space exploration. Specifically, we shall discuss exploration strategies that could better harness the positive aspects of incremental pattern matching in order to gain better performance.
Item Type:Article
Additional information:Fourth International Workshop on Graph-Based Tools, GraBaTs 2010, Enschede, the Netherlands, 28 September 2010
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page