TY - GEN
T1 - SWRL rules for identifying short loops in business process ontology model
AU - Effendi, Yutika Amelia
AU - Sarno, Riyanarto
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2018/1/19
Y1 - 2018/1/19
N2 - 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.
AB - 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.
KW - Business Process Model and Notation
KW - Ontology
KW - Protege
KW - SWRL
KW - Semantic Web
KW - Short Loops
UR - http://www.scopus.com/inward/record.url?scp=85050384752&partnerID=8YFLogxK
U2 - 10.1109/ICTS.2017.8265672
DO - 10.1109/ICTS.2017.8265672
M3 - Conference contribution
AN - SCOPUS:85050384752
T3 - Proceedings of the 11th International Conference on Information and Communication Technology and System, ICTS 2017
SP - 209
EP - 214
BT - Proceedings of the 11th International Conference on Information and Communication Technology and System, ICTS 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 11th International Conference on Information and Communication Technology and System, ICTS 2017
Y2 - 31 October 2017 through 31 October 2017
ER -