Performance Analysis of Generalized Well-formed Workflow

Performance of workflow schema including overlapping patterns can not be computed by regular reducing approaches, and that excluding overlapping patterns from workflow schema will lose flexibility in schema design, introduce redundant nodes, and make it difficult to describe complex business process. To solve this problem, the concept of generalized well-formed workflow was proposed, in which overlapping patterns can appear in a workflow schema but not in any of its instance subgraphs. Further more, to meet the need of frequently re-computing of process performance after business process reengineering, methods for automatically computing routing probability and time performance of each instance subgraph are proposed, which are basis for our automatic performance analysis algorithm of whole workflow schema. Finally, an example was given to demonstrate the process of performance analysis of a generalized well-formed workflow.