Abstract
The correctness of the business process modelling notation (BPMN) is essential for software success, and the BPMN formalization is the foundation of the correctness verification process. However, dynamically adapting the formalized BPMN model to changes in the BPMN model and protecting tokens from being lost in the remapping formalization are the main limitations of the BPMN formalization under changing business requirements. To overcome these limitations, an approach for evolving a Petri nets model according to the BPMN changes is proposed in this paper. In this approach, a check algorithm is designed to identify the differences between the original BPMN model and the updated BPMN model. Then, the evolution rules of the extended Petri nets (EPN) model are defined according to the results of the checking program. Finally, these evolution rules are described in the query/view/transformation operational mapping (QVTo) language and implemented in the Eclipse platform. We demonstrate the effectiveness of the evolution of the BPMN formalization using a case study of the Web Payment business system. Moreover, the dynamic evolution of the BPMN formalization can maintain the consistency between the original model and the updated model, and this consistency has been successfully verified.
Highlights
Business process modelling notation (BPMN) is used as a standard for modelling business processes in the early phase of system development and for instructing the design and development [1]
We can use the ePNK tool to verify the correctness properties of the evolved extended Petri nets (EPN) model (Figure 11), such as no deadlocks, no closed loops, and no isolated nodes in the evolved EPN model; we use the formalized model to verify the consistency between the original BPMN mode and the updated BPMN model and to analyse the behavioural semantic compatibility of these two Petri nets models. us, the original BPMN model and the updated BPMN model are defined as semantically compatible if they perform the same business behaviour
(2) e original BPMN model and the updated BPMN model are partially semantically compatible, which is denoted as BPold⊳BPnew, iff: C(PNold| c) ∩ C(PNnew| c) ≠ ∅. is scenario demonstrates that atomic activities, control flows, and message flows are added or deleted in the original BPMN model, but at least one business process sequence exists in both the BPold model and the BPnew model
Summary
Business process modelling notation (BPMN) is used as a standard for modelling business processes in the early phase of system development and for instructing the design and development [1]. Ese features enable that the Petri net to be a good candidate for formally defining the semantics of BPMN models [19] since the BPMN model is flow-oriented [4]. Many researchers have formalized the BPMN model and analysed the semantics using Petri nets theory [4, 7, 8, 30,31,32,33], CSP [10, 34, 35], event-B [36], OCL specification [2, 37, 38], and BNF syntax [3, 11, 39], among others. Zatout et al [44] proposed formal orchestration process modelling with adaptation mechanisms and used the checking technique of the Petri nets to verify the validity of the generated models. A relatively complete refactoring transformation approach was proposed by Einarsson [55], in which query/ view/transformation operational mapping (QVTo) language (https://www.omg.org/spec/QVT/1.3/PDF) is used to
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
