Outlining a graphical model query approach based on graph matching

Abstract

This paper outlines a graphical model query approach based on graph matching. It consists of a graphical query specification language and a matching algorithm based on graph matching that takes the query as input and returns all matches found in a model to be searched. The graphical query specification language can be used to draw model queries much like a model would be constructed. To achieve applicability in many different model analysis scenarios, the query approach provides structurally exact and structurally similar pattern matching as well as semantic comparison of model node and edge contents. Following a design science research process, we derive functional requirements for the query language and matching algorithm from the literature, outline its syntax, formally specify its matching principle, and demonstrate its functionality by providing a working prototype implementing previously identified requirements.