Skip to Main Content
Reuse of proven process models increases modeling efficiency and ensure the quality of process models. To provide a better support for reuse, the retrieval mechanisms of process repositories should be able to propose similar process models that ranked according to their similarity degrees to the query request. As a process model and a query request on process structure can both be viewed as rooted, directed, and acyclic graphs, the problem of querying structural information of BPEL processes can be reduced to a graph matchmaking problem. In this paper we present a novel and efficient graph-based algorithm for querying structural information of BPEL processes based on an incomplete matchmaking semantics. Our algorithm performs in the worst case in polynomial time in the orders of the query graph and the process graph.