SWRL rules for identifying short loops in business process ontology model

• Published in: 2017 11th International Conference on Information & Communication Technology and System (ICTS) pp. 209 - 214
• Main Authors: Effendi, Yutika Amelia, Sarno, Riyanarto
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.10.2017
• Subjects: Adaptation models; Business Process Model and Notation; Heuristic algorithms; Ontologies; Ontology; OWL; Protege; Semantic Web; Short Loops; SWRL; Unified modeling language
• ISBN: 9781538628256; 1538628252
• ISSN: 2996-1378
• DOI: 10.1109/ICTS.2017.8265672

A set of linked activities which is produced for specific service is the definition of the business process model. A business process model is usually generated from event logs of an organization or is formed based on user design. In real life, business process model is used as estimation, prediction, calibration, and optimization of process performance. However in fact there are several problems that occur in the steps of modeling the business process model from event log, such as short loops, invisible prime tasks, and non-free choice. Not all process have a sequence of activities occuring one way (from start activity to end activity). There is a condition called short loops. This condition happens where an activity or several activities in a process are executed more than one time before terminate the process. Several research solved the problem of short loops using matrix and formula. However, none of them applied their method in ontology. This research proposes a method of identifying short loops in ontology. The method is written in SWRL rule. The experiment shows that the method can identify and automate identification of short loops based on the event logs in Business Process Ontology Model as the business process model. This method also becomes the pioneer of short loops detection in ontology.