TY - GEN
T1 - A Formal Model for Business Process Configuration Verification Supporting OR-Join Semantics
AU - Boubaker, Souha
AU - Klai, Kais
AU - Kortas, Hedi
AU - Gaaloul, Walid
N1 - Publisher Copyright:
© 2018, Springer Nature Switzerland AG.
PY - 2018/1/1
Y1 - 2018/1/1
N2 - In today’s industries, similar process models are typically reused in different application contexts. These models result in a number of process model variants sharing several commonalities and exhibiting some variations. Configurable process models came to represent and group these variants in a generic manner. These processes are configured according to a specific context through configurable elements. Considering the large number of possible variants as well as the potentially complex configurable process, the configuration may be a tedious task and errors may lead to serious behavioral issues. Since achieving configuration in a correct manner has become of paramount importance, the analysts undoubtedly need assistance and guidance in configuring process variants. In this work, we propose a formal behavioral model based on the Symbolic Observation Graph (SOG) allowing to find the set of deadlock-free configuration choices while avoiding the well-known state-space explosion problem and considering loops and OR-join semantics. These choices are used to support business analysts in deriving deadlock-free variants.
AB - In today’s industries, similar process models are typically reused in different application contexts. These models result in a number of process model variants sharing several commonalities and exhibiting some variations. Configurable process models came to represent and group these variants in a generic manner. These processes are configured according to a specific context through configurable elements. Considering the large number of possible variants as well as the potentially complex configurable process, the configuration may be a tedious task and errors may lead to serious behavioral issues. Since achieving configuration in a correct manner has become of paramount importance, the analysts undoubtedly need assistance and guidance in configuring process variants. In this work, we propose a formal behavioral model based on the Symbolic Observation Graph (SOG) allowing to find the set of deadlock-free configuration choices while avoiding the well-known state-space explosion problem and considering loops and OR-join semantics. These choices are used to support business analysts in deriving deadlock-free variants.
KW - Business process management
KW - Configurable process model
KW - Formal verification
UR - https://www.scopus.com/pages/publications/85055809091
U2 - 10.1007/978-3-030-02610-3_35
DO - 10.1007/978-3-030-02610-3_35
M3 - Conference contribution
AN - SCOPUS:85055809091
SN - 9783030026097
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 623
EP - 642
BT - On the Move to Meaningful Internet Systems. OTM 2018 Conferences - Confederated International Conferences
A2 - Proper, Henderik A.
A2 - Meersman, Robert
A2 - Ardagna, Claudio Agostino
A2 - Panetto, Hervé
A2 - Debruyne, Christophe
A2 - Roman, Dumitru
PB - Springer Verlag
T2 - Confederated International Conferences: Cooperative Information Systems, CoopIS 2018, Ontologies, Databases, and Applications of Semantics, ODBASE 2018, and Cloud and Trusted Computing, C and TC, held as part of OTM 2018
Y2 - 22 October 2018 through 26 October 2018
ER -