TY - GEN
T1 - A behavior-aware systematic approach for merging business process fragments
AU - Zemni, Mohamed Anis
AU - Mammar, Amel
AU - Alouane, Nejib Ben Hadj
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2014/10/13
Y1 - 2014/10/13
N2 - Recent researches have proposed to retrieve relevant fragments out from whole business processes to build new ones. Although they avoid building business processes from scratch, this task has been performed independently for each process, thus, making resulting fragments handling complicated. In this paper, we propose to merge some given business process fragments in order to facilitate the fragment-based business process design. At the same time, the obtained fragment must keep the behavior of original fragments so as to avoid paths execution blockage while the obtained fragments are integrated as part of a complete process. Our approach presents a systematic merge revolving around the so-called adjacency matrices. Typically used to handle graphs, this mechanism is adapted to business process fragments. We also present some rules to provide the obtained fragments with the behavior of original fragments and avoid inconsistent behaviors that were newly added after the merge.
AB - Recent researches have proposed to retrieve relevant fragments out from whole business processes to build new ones. Although they avoid building business processes from scratch, this task has been performed independently for each process, thus, making resulting fragments handling complicated. In this paper, we propose to merge some given business process fragments in order to facilitate the fragment-based business process design. At the same time, the obtained fragment must keep the behavior of original fragments so as to avoid paths execution blockage while the obtained fragments are integrated as part of a complete process. Our approach presents a systematic merge revolving around the so-called adjacency matrices. Typically used to handle graphs, this mechanism is adapted to business process fragments. We also present some rules to provide the obtained fragments with the behavior of original fragments and avoid inconsistent behaviors that were newly added after the merge.
KW - Business process fragment
KW - adjacency matrix
KW - behavior
KW - merge
UR - https://www.scopus.com/pages/publications/84908428782
U2 - 10.1109/ICECCS.2014.35
DO - 10.1109/ICECCS.2014.35
M3 - Conference contribution
AN - SCOPUS:84908428782
T3 - Proceedings of the IEEE International Conference on Engineering of Complex Computer Systems, ICECCS
SP - 194
EP - 197
BT - 2014 19th International Conference on Engineering of Complex Computer Systems, ICECCS 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 19th International Conference on Engineering of Complex Computer Systems, ICECCS 2014
Y2 - 4 August 2014 through 7 August 2014
ER -