An incremental approach to the analysis and transformation of workflows using region trees

被引:19
作者
Hauser, Rainer Friedrich [1 ]
Friess, Michael [2 ]
Kuester, Jochen Malte [1 ]
Vanhatalo, Jussi [1 ]
机构
[1] IBM Corp, Zurich Res Lab, CH-8803 Ruschlikon, Switzerland
[2] IBM Deutschland Entwicklung GmbH, D-71032 Boblingen, Germany
来源
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS | 2008年 / 38卷 / 03期
关键词
business process modeling; control flow; workflow modeling; workflow transformation; workflow verification;
D O I
10.1109/TSMCC.2008.919178
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The analysis of workflows in terms of structural correctness is important for ensuring the quality of workflow models. Typically, this analysis is only one step in a larger development process, followed by further transformation steps that lead from high-level models to more refined models until the workflow can finally be deployed on the underlying workflow engine of the production system. For practical and scalable applications, both analysis and transformation of workflows must be integrated to allow incremental changes of larger workflows. In this paper, we introduce the concept of a region tree (RT) for workflow models that can be used as the central data structure for both workflow analysis and workflow transformation. An RT is similar to a program structure tree and imposes a hierarchy of regions as an overlay structure onto the workflow model. It allows an incremental approach to the analysis and transformation of workflows, and thereby, significantly reduces the overhead because individual regions can be dealt with separately. The RT is built using a set of region-growing rules. The set of rules presented here is shown to be correct and complete in the sense that a workflow is region-reducible as defined through these rules if and only if it is semantically sound.
引用
收藏
页码:347 / 359
页数:13
相关论文
共 24 条
[1]  
Aho Alfred V., 1986, ADDISON WESLEY SERIE
[2]   A CONTROL-FLOW NORMALIZATION ALGORITHM AND ITS COMPLEXITY [J].
AMMARGUELLAT, Z .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1992, 18 (03) :237-251
[3]  
Desel J., 1995, CAMBRIDGE TRACTS THE, DOI 10.1017/CBO9780511526558
[4]  
HAUSER R, LECT NOTES COMPUTER, V3286, P317
[5]  
HAUSER R, P 10 INT ENT DISTR O, P129
[6]  
HAUSER R, 2005, 3624 RZ IBM
[7]  
Hecht M. S., 1972, SIAM Journal on Computing, V1, P188, DOI 10.1137/0201014
[8]  
*IBM, WEBSPHERE BUS MOD MO
[9]  
JOHNSON R, P ACM SIGPL C PROGR, P171
[10]  
KENT S, 2002, LNCS, V2335, P286, DOI DOI 10.1007/3-540-47884-1