A Graph Processing Based Approach for Automatic Detection of Semantic Inconsistency Between BPMN Process Model and SBVR Rules

Abstract

Business Process Modeling Notation (BPMN) is a technique for graphically drawing and illustrating business processes in diagramtic form. Semantic of Business Vocabulary and Business Rules (SBVR) is a declarative language used to define business vocabulary, rules and policy. Several times inconsistencies occur between BPMN and SBVR as they are independently maintained. Our aim is to investigate techniques for automatically detecting inconsistencies between business process and rules. We present a method for inconsistency detection (between BPMN and SBVR) based on converting SBVR rules to graphical representation and apply sub graph-isomorphism to detect instances of inconsistencies between BPMN and SBVR models. We propose a multi-step process framework for identification of instances of inconsistencies between the two models. We first generate an XML of BPMN diagram and apply parsing and tag extraction. We then apply Stanford NLP Parser to generate parse tree of rules. The detailed information about the parse tree is stored in the form of Typed Dependency which represent grammatical relation between words of a sentence. We utilize the grammatical relation extract triplet (actor-action-object) of a sentence. We find node-induced sub-graph of all possible length of nodes of a graph and apply VF2 Algorithm to detect instances of inconsistency between sub graphs. Finally, we evaluate the proposed research framework by conducting experiments on synthetic dataset to validate the accuracy and effectiveness of our approach.