The refined process structure tree

Data and Knowledge Engineering

Volumn 68, Issue 9, 2009, Pages 793-818

  Vanhatalo, Jussi ^a,b   Völzer, Hagen ^a   Koehler, Jana ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

^b UNIVERSITY OF STUTTGART   (Germany)

Author keywords

Graph theory; Model decomposition; Subprocess detection; Workflow graph parsing; Workflow management

Indexed keywords

BUSINESS PROCESS; CONTROL FLOWS; GRAPH-BASED LANGUAGES; LINEAR TIME; MODEL DECOMPOSITION; OTHER APPLICATIONS; PROCESS STRUCTURES; SEQUENTIAL PROGRAMS; SINGLE ENTRY; SUBGRAPHS; SUBPROCESS DETECTION; WORK-FLOWS; WORKFLOW GRAPH; WORKFLOW GRAPH PARSING; WORKFLOW MANAGEMENT;

CHARACTERIZATION; LINGUISTICS; MANAGEMENT; REFINING; WORK SIMPLIFICATION;

GRAPH THEORY;

COMPUTATION; MANAGEMENT; MATHEMATICAL MODELS; PROBLEM SOLVING;

EID: 67349182611     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2009.02.015     Document Type: Article

References (16)

1. Sadiq W., and Orlowska M.E. Analyzing process models using graph reduction techniques. Inf. Syst. 25 2 (2000) 117-134
2. Vanhatalo J., Völzer H., and Leymann F. Faster and more focused control-flow analysis for business process models though SESE decomposition. In: Krämer B.J., Lin K.-J., and Narasimhan P. (Eds). ICSOC 2007. LNCS vol. 4749 (2007), Springer 43-55
3. Küster J., Gerth C., Förster A., and Engels G. Detecting and resolving process model differences in the absence of a change log. In: Dumas M., Reichert M., and Shan M.-C. (Eds). BPM 2008. LNCS vol. 5240 (2008), Springer-Verlag, Berlin, Heidelberg 244-260
4. Gschwind T., Koehler J., and Wong J. Applying patterns during business process modeling. In: Dumas M., Reichert M., and Shan M.-C. (Eds). BPM 2008. LNCS vol. 5240 (2008), Springer-Verlag, Berlin, Heidelberg 4-19
5. C. Ouyang, M. Dumas, A.H.M. ter Hofstede, W.M.P. van der Aalst, From BPMN process models to BPEL web services, in: ICWS, IEEE Computer Society, 2006, pp. 285-292.
6. K.B. Lassen, W.M.P. van der Aalst, WorkflowNet2BPEL4WS: A tool for translating unstructured workflow processes to readable BPEL, in: OTM Conferences (1), vol. 4275 of LNCS, Springer, 2006, pp. 127-144.
7. N. Lohmann, J. Kleine, Fully-automatic translation of open workflow net models into human-readable abstract BPEL processes, in: Modellierung 2008, vol. P-127 of Lecture Notes in Informatics (LNI), GI, 2008, pp. 57-72.
8. R. Johnson, D. Pearson, K. Pingali, The program structure tree: Computing control regions in linear time, in: Proceedings of the ACM SIGPLAN'94 Conference on Programming Language Design and Implementation (PLDI), 1994, pp. 171-185.
9. R.C. Johnson, Efficient program analysis using dependence flow graphs, Ph.D. thesis, Cornell University, Ithaca, NY, USA, 1995.
10. R.E. Tarjan, J. Valdes, Prime subprogram parsing of a program, in: POPL '80: Proceedings of the Seventh ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, New York, NY, USA, 1980, pp. 95-105.
11. Vanhatalo J., Völzer H., and Koehler J. The refined process structure tree. In: Dumas M., Reichert M., and Shan M.-C. (Eds). BPM 2008. LNCS vol. 5240 (2008), Springer-Verlag, Berlin, Heidelberg 100-115
12. Hopcroft J., and Tarjan R.E. Dividing a graph into triconnected components. SIAM J. Comput. 2 (1973) 135-158
13. J. Vanhatalo, Structural analysis of business process models using the process structure trees, to be submitted as a dissertation.
14. Gutwenger C., and Mutzel P. A linear time implementation of SPQR-trees. In: Marks J. (Ed). Graph Drawing. LNCS vol. 1984 (2000), Springer 77-90
15. J. Valdes Ayesta, Parsing flowcharts and series-parallel graphs., Ph.D. thesis, Stanford University, CA, USA, 1978.
16. Vanhatalo J., Völzer H., Leymann F., and Moser S. Automatic workflow graph refactoring and completion. In: Bouguettaya A., Krueger I.H., and Margaria T. (Eds). ICSOC 2008. LNCS vol. 5364 (2008), Springer-Verlag, Berlin, Heidelberg 100-115