Qualitative and quantitative analysis of business workflows using generalized stochastic Petri nets
CON '94 Proceedings of the ninth Austrian-informatics conference on Workflow management : challenges, paradigms and products: challenges, paradigms and products
Business process redesign: a Petri-net-based approach
Computers in Industry - Special double issue: WET ICE '95
Verification of workflow task structures: A petri-net-based approach
Information Systems
Analyzing process models using graph reduction techniques
Information Systems - The 11th international conference on advanced information systems engineering (CAiSE*
A timed workflow process model
Journal of Systems and Software
Improving the performance of time-constrained workflow processing
Journal of Systems and Software
Performance Analytic Models and Analyses for Workflow Architectures
Information Systems Frontiers
Linear Temporal Inference of Workflow Management Systems Based on Timed Petri Nets Models
EDCIS '02 Proceedings of the First International Conference on Engineering and Deployment of Cooperative Information Systems
Performance Equivalent Analysis of Workflow Systems Based on Stochastic Petri Net Models
EDCIS '02 Proceedings of the First International Conference on Engineering and Deployment of Cooperative Information Systems
Dynamic Verification of Temporal Constraints in Production Workflows
ADC '00 Proceedings of the Australasian Database Conference
Specification and validation of process constraints for flexible workflows
Information Systems
Deadline-based escalation in process-aware information systems
Decision Support Systems
ePERT: extending PERT for workflow management systems
ADBIS'97 Proceedings of the First East-European conference on Advances in Databases and Information systems
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Timing constraint workflow nets for workflow analysis
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Performance modeling and analysis of workflow
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Workflow performance analysis and simulation based on multidimensional workflow net
Computers in Industry
| Hi-index | 0.00 |
This paper presents a method to judge whether a business process is successful or not. A business process is deemed successful if a large enough proportion of instances dwell in a workflow (wait and be executed) for less than given period. By analyzing instances' dwelling time distribution in a workflow, the proportion of instances which dwell in the workflow for less than any given period will be achieved. The performance analysis of workflow model plays an important role in the research of workflow techniques and efficient implementation of workflow management. It includes the analysis of instances' dwelling time distribution in a workflow process. Multidimensional workflow net (MWF-net) includes multiple timing workflow nets (TWF-nets) and the organization and resource information. The processes of transaction instances form a queuing model in which the transaction instances act as customers and the resources act as servers. The key contribution of this paper is twofold. First, this paper presents a theoretical method to calculate the instances' dwelling time probability density in a workflow where the activities are structured and predictable. Second, by this method the analysis of instances' dwelling time distribution and satisfactory degree based on dwelling time can be achieved. The service time of an instance is specified by the firing delay of the corresponding transition (executing time of the corresponding activity). It is assumed that the service request (processing of a transaction instance) arrives with exponentially distributed inter-arrival times and the firing delay of a transition (executing time of the corresponding activity) follows exponential distribution. Then, the instances' dwelling time probability density analysis in each activity and each control structure of a workflow model is performed. According to the above results a method is proposed for computing the instances' dwelling time probability density in a workflow model. Finally an example is used to show that the proposed method can be effectively utilized in practice.