Conceptual framework for business processes compositional verification

ContextTo guarantee the success of Business Process Modelling (BPM) it is necessary to check whether the activities and tasks described by Business Processes (BPs) are sound and well coordinated.ObjectiveThis article describes and validates a Formal Compositional Verification Approach (FCVA) that uses a Model-Checking (MC) technique to specify and verify BPs.MethodThis is performed using the Communicating Sequential Processes +Time (CSP+T) process calculus, which adds new constructions to timed Business Process Model and Notation (BPMN) modelling entities for non- functional requirement specification.ResultsUsing our proposal we are able to specify the BP Task Model (BPTM) associated with BPs by formalising the timed BPMN notational elements. The proposal also allows us to apply MC to BPTM verification. A real-life example of verifying a BPTM in the field of Customer Relationship Management (CRM) is discussed as a practical application of FCVA.ConclusionThis approach facilitates the verification of complex BPs from independently verified local processes, and establishes a feasible way to use process calculi to verify BPs using state-of-the-art MC tools.

Graphical abstractFigure optionsDownload full-size imageDownload as PowerPoint slideHighlights► Business Process Modelling (BPM) supported by compositional formal languages. ► Modelling, specification, and verification of Business Process Task Model (BPTM). ► BPTM design process based on compositional strengths of CSP process algebra. ► Integration of Model-Checking (MC) technique with the BPTM design process.