The refined process structure tree

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5240 LNCS, Issue , 2008, Pages 100-115

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

^a IBM RESEARCH ZURICH   (Switzerland)

^b UNIVERSITY OF STUTTGART   (Germany)

Author keywords

BPMN to BPEL translation roundtripping; Control flow; Graph theory; Model decomposition; Subprocess detection; Workflow graph parsing

Indexed keywords

ENTERPRISE RESOURCE MANAGEMENT; GRAPH ALGORITHMS; GRAPH THEORY; GRAPHIC METHODS; TRANSLATION (LANGUAGES); VISUAL LANGUAGES;

BPMN TO BPEL TRANSLATION/ ROUNDTRIPPING; CONTROL FLOWS; MODEL DECOMPOSITION; SUBPROCESS DETECTION; WORKFLOW GRAPH PARSING;

FLOW GRAPHS;

EID: 57049147959     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85758-7_10     Document Type: Conference Paper

References (14)

1. Ayesta, J.V.: Parsing flowcharts and series-parallel graphs. PhD thesis, Stanford University, CA, USA (1978)
2. Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 77-90. Springer, Heidelberg (2001)
3. Hopcroft, J., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2, 135-158 (1973)
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)
5. Johnson, R.C.: Efficient program analysis using dependence flow graphs. PhD thesis, Cornell University, Ithaca, NY, USA (1995)
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., and Shan, M.-C., (eds.) BPM 2008. LNCS, vol. 5240, pp. 244-260. Springer, Heidelberg (2008)
7. Lassen, K.B., van der Aalst, W.M.P.: WorkflowNet2BPEL4WS: A tool for translating unstructured workflow processes to readable BPEL. In: Meersman, R., Tari, Z. (eds.) OTM 2006. LNCS, vol. 4275, pp. 127-144. Springer, Heidelberg (2006)
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)
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)
10. Sadiq, W., Orlowska, M.E.: Analyzing process models using graph reduction techniques. Inf. Syst. 25(2), 117-134(2000)
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)
12. Vanhatalo, J.: Structural analysis of business process models using the process structure trees (to appear)
13. Vanhatalo, J., Völzer, H., Koehler, J.: The refined process structure tree. IBM Research Report RZ 3712 (2008)
14. Vanhatalo, J., Völzer, H., Leymann, F: Faster and more focused control-flow analysis for business process models though SESE decomposition. In: Krämer, B.J., Lin, K.-J., Narasimhan, P. (eds.) ICSOC 2007. LNCS, vol. 4749, pp. 43-55. Springer, Heidelberg (2007)