Deadlock-freeness verification of business process configuration using SOG
Résumé
Configurable process models are increasingly used in many industries as reference processes shared between different process tenants. These processes are configured and adapted according to their specific needs through configurable elements (i.e. the variation points). Since configuration decisions are taken prior to execution, incorrect ones may lead to critical behavioral issues such as deadlocks. In this work, we propose a formal behavioral model based on the Symbolic Observation Graph (SOG) allowing to find the set of correct configuration choices while avoiding the state-space explosion problem. This set of configuration choices, jointly provided with the configurable process, will support and help business analysts in deriving deadlock-free variants