The Refined Process Structure Tree
We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a workflow graph. More precisely, we want to find a decomposition of a workflow graph into a hierarchy of sub-workflows that are subgraphs with a single entry and a single exit of control. Such a decomposition is the crucial step, for example, to translate a process modeled in a graph-based language such as BPMN into a process modeled in a block-based language such as BPEL. For this and other applications, it is desirable that the decomposition be unique, modular and as fine as possible, where modular means that a local change of the workflow graph can only cause a local change of the decomposition. In this paper, we provide a decomposition that is unique, modular and finer than in previous work. It is based on and extends similar work for sequential programs by Tarjan and Valdes . We show that our decomposition can be computed in linear time based on an algorithm by Hopcroft and Tarjan  that finds the triconnected components of a biconnected graph.
KeywordsWorkflow graph parsing Control flow Model decomposition BPMN to BPEL translation/ roundtripping Subprocess detection Graph theory
Unable to display preview. Download preview PDF.
- 1.Ayesta, J.V.: Parsing flowcharts and series-parallel graphs. PhD thesis, Stanford University, CA, USA (1978)Google Scholar
- 4.Johnson, R., Pearson, D., Pingali, K.: The program structure tree: Computing control regions in linear time. In: Proceedings of the ACM SIGPLAN 1994 Conference on Programming Language Design and Implementation (PLDI), pp. 171–185 (1994)Google Scholar
- 5.Johnson, R.C.: Efficient program analysis using dependence flow graphs. PhD thesis, Cornell University, Ithaca, NY, USA (1995)Google Scholar
- 6.Küster, J., Gerth, C., Förster, A., Engels, G.: Detecting and resolving process model differences in the absence of a change log. In: Dumas, M., Reichert, M., Shan, M.-C. (eds.) BPM 2008. LNCS, vol. 5240, pp. 244–260. Springer, Heidelberg (2008)Google Scholar
- 8.Lohmann, N., Kleine, J.: Fully-automatic translation of open workflow net models into human-readable abstract BPEL processes. In: Modellierung 2008, GI, March 2008. Lecture Notes in Informatics (LNI), vol. P-127, pp. 57–72 (2008)Google Scholar
- 9.Ouyang, C., Dumas, M., ter Hofstede, A.H.M., van der Aalst, W.M.P.: From BPMN process models to BPEL web services. In: ICWS, pp. 285–292. IEEE Computer Society, Los Alamitos (2006)Google Scholar
- 11.Tarjan, R.E., Valdes, J.: Prime subprogram parsing of a program. In: POPL 1980: Proceedings of the 7th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 95–105. ACM, New York (1980)Google Scholar
- 12.Vanhatalo, J.: Structural analysis of business process models using the process structure trees (to appear)Google Scholar
- 13.Vanhatalo, J., Völzer, H., Koehler, J.: The refined process structure tree. IBM Research Report RZ 3712 (2008)Google Scholar