DocumentCode
3538463
Title
Business Process Compositions Preserving k-Soundness Property
Author
Bessai, Kahina ; Nurcan, Selmin ; Godart, Claude ; Youcef, Samir
Author_Institution
Centre de Rech. en Inf., Paris, France
fYear
2012
fDate
6-8 Dec. 2012
Firstpage
91
Lastpage
97
Abstract
A workflow process defines a set of activities and the specific order according to which they should be executed in order to achieve a common objective. The correctness and efficiency of the business process supported by the workflow management are vital, in particular the k-soundness property when processes are modeled by workflow nets (WF-nets). This property entails the proper termination of the workflow execution and the absence of tasks that do not contribute to the processing cases. Furthermore, business processes are not isolated and in order to support the global performance of a given organization, they should well articulated, and correctly synchronized to each other. Nevertheless, without specific conditions, the k-soundness criterion is not compositional while it should remain valid for the set articulated processes. We propose in this paper a set of compositional rules that allow to build complex workflows from single ones while preserving k-soundness property under elementary conditions. Moreover, for the free-choice Petri net class we show that the soundness property verification can be efficiently checked.
Keywords
Petri nets; business process re-engineering; WF-net; business process composition; free-choice Petri net class; k-soundness property; organization performance; soundness property verification; workflow management; workflow net; workflow process; Business; Parallel processing; Petri nets; Process control; Routing; Synchronization; System recovery; Petri nets; Workflow-net; free-choice; soundness verification; workflow control patterns; workflow net composition;
fLanguage
English
Publisher
ieee
Conference_Titel
Services Computing Conference (APSCC), 2012 IEEE Asia-Pacific
Conference_Location
Guilin
Print_ISBN
978-1-4673-4825-6
Type
conf
DOI
10.1109/APSCC.2012.64
Filename
6478203
Link To Document