Time analysis for BPMN gateways using queuing theory

Abstract

Currently Business Process Management connected directly with information technology, either by automating some of the tasks or by simulating the process for understanding and enhancing. Business process modeling is an important phase of business process management phases. One of the steps needed to enhance a business process model is analyzing the timing and the queuing behavior for each task in the process. Traditional methods as Critical Path Analysis (CPM) and Program Evaluation and Review Technique (PERT) cannot be used for such analysis. This study presents an analytical approach to analyze the business process models using queuing systems classifications for the basic BPMN2 gateways as M/M/l, M/M/c and M/D/l. Five types of the BPMN gateways have been analyzed depending on their specifications to define the inflow and the outflow and the probability for producing and consuming tokens. An algorithm for computing arrival rate and average waiting time and illustrative example for our approach has been presented. © 2031 Asian Network for Scientific Information.