Faster and More Focused Control-Flow Analysis for Business Process Models Through SESE Decomposition
We present a technique to enhance control-flow analysis of business process models. The technique considerably speeds up the analysis and improves the diagnostic information that is given to the user to fix control-flow errors. The technique consists of two parts: Firstly, the process model is decomposed into single-entry-single-exit (SESE) fragments, which are usually substantially smaller than the original process. This decomposition is done in linear time. Secondly, each fragment is analyzed in isolation using a fast heuristic that can analyze many of the fragments occurring in practice. Any remaining fragments that are not covered by the heuristic can then be analyzed using any known complete analysis technique.
We used our technique in a case study with more than 340 real business processes modeled with the IBM WebSphere Business Modeler. The results suggest that control-flow analysis of many real process models is feasible without significant delay (less than a second). Therefore, control-flow analysis could be used frequently during editing time, which allows errors to be caught at earliest possible time.
KeywordsOutgoing Edge Business Process Model Incoming Edge Start Node Graph Size
- 1.Scott Ananian, C.: The static single information form. Master’s thesis, Massachusetts Institute of Technology (September 1999)Google Scholar
- 4.Hauser, R., Friess, M., Küster, J.M., Vanhatalo, J.: An incremental approach to the analysis and transformation of workflows using region trees. IEEE Transactions on Systems, Man, and Cybernetics - Part C (June 2007) (to appear, also available as IBM Research Report RZ 3693)Google Scholar
- 5.Johnson, R., Pearson, D., Pingali, K.: The program structure tree: Computing control regions in linear time. In: PLDI. Proceedings of the ACM SIGPLAN’94 Conference on Programming Language Design and Implementation, pp. 171–185. ACM Press, New York (1994)Google Scholar
- 6.Kemper, P.: Linear time algorithm to find a minimal deadlock in a strongly connected free-choice net. In: Ajmone Marsan, M. (ed.) Application and Theory of Petri Nets 1993. LNCS, vol. 691, pp. 319–338. Springer, Heidelberg (1993)Google Scholar
- 7.Lin, H., Zhao, Z., Li, H., Chen, Z.: A novel graph reduction algorithm to identify structural conflicts. In: HICSS-35 2002. Proceedings of the 35th Hawaii International Conference on System Sciences, p. 289 (2002)Google Scholar
- 8.Mendling, J.: Detection and Prediction of Errors in EPC Business Process Models. PhD thesis, Vienna University of Economics and Business Administration (WU Wien), Austria (May 2007)Google Scholar
- 10.Perumal, S., Mahanti, A.: A graph-search based algorithm for verifying workflow graphs. In: DEXA 2005. Proceedings of the 16th International Workshop on Database and Expert Systems Applications, pp. 992–996. IEEE Computer Society, Los Alamitos (2005)Google Scholar
- 15.van Dongen, B.F., van der Aalst, W.M.P., Verbeek, H.M.W.: Verification of EPCs: Using reduction rules and Petri nets. In: Pastor, Ó., Falcão e Cunha, J. (eds.) CAiSE 2005. LNCS, vol. 3520, pp. 372–386. Springer, Heidelberg (2005)Google Scholar
- 16.Vanhatalo, J., Völzer, H., Leymann, F.: Faster and more focused control-flow analysis for business process models though SESE decomposition. IBM Research Report RZ 3694 (July 2007)Google Scholar
- 18.Zerguini, L.: A novel hierarchical method for decomposition and design of workflow models. Journal of Integrated Design and Process Science 8(2), 65–74 (2004)Google Scholar