TY - GEN
T1 - Algorithms based on pattern analysis for verification and adapter creation for business process composition
AU - Kumar, Akhil
AU - Shan, Zhe
N1 - Copyright:
Copyright 2009 Elsevier B.V., All rights reserved.
PY - 2008
Y1 - 2008
N2 - With more automation in inter-organizational supply chains and proliferation of Web services technology, the need for organizations to link their business services and processes is becoming increasingly important. Ideally, such linking must be automated and also possible to do on-the-fly in an ad hoc manner. In this paper, we view business processes in terms of standard patterns, and describe a pattern compatibility matrix and rules that allow us to simplify the task of checking compatibility between two or more processes because these prerequisite rules can be applied to each pattern separately, thus reducing the search space. We give an algorithm for applying these rules to check process compatibility. If two processes are compatible, we determine whether an adapter is required, and if so, a minimal adapter is generated by another algorithm. Two variants of the algorithm (PBA and PBA-MIN) are implemented, and experimental results and comparisons with an existing algorithm are given.
AB - With more automation in inter-organizational supply chains and proliferation of Web services technology, the need for organizations to link their business services and processes is becoming increasingly important. Ideally, such linking must be automated and also possible to do on-the-fly in an ad hoc manner. In this paper, we view business processes in terms of standard patterns, and describe a pattern compatibility matrix and rules that allow us to simplify the task of checking compatibility between two or more processes because these prerequisite rules can be applied to each pattern separately, thus reducing the search space. We give an algorithm for applying these rules to check process compatibility. If two processes are compatible, we determine whether an adapter is required, and if so, a minimal adapter is generated by another algorithm. Two variants of the algorithm (PBA and PBA-MIN) are implemented, and experimental results and comparisons with an existing algorithm are given.
UR - http://www.scopus.com/inward/record.url?scp=58049085403&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=58049085403&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-88871-0_11
DO - 10.1007/978-3-540-88871-0_11
M3 - Conference contribution
AN - SCOPUS:58049085403
SN - 3540888705
SN - 9783540888703
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 120
EP - 138
BT - On the Move to Meaningful Internet Systems
T2 - OTM 2008 Confederated International Conferences CoopIS, DOA, GADA, IS, and ODBASE 2008
Y2 - 9 November 2008 through 14 November 2008
ER -