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.
CITATION STYLE
Boubaker, S., Klai, K., Kortas, H., & Gaaloul, W. (2018). A Formal Model for Business Process Configuration Verification Supporting OR-Join Semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11229 LNCS, pp. 623–642). Springer Verlag. https://doi.org/10.1007/978-3-030-02610-3_35
Mendeley helps you to discover research relevant for your work.