Abstract

 
 
 The most important result to standardize the notation for graphical representation of Business Processes (BPs) is the Business Process Model and Notation (BPMN). Despite the BPs modeled with BPMN being able to support business designers, BPMN models are not appropriate to support the analysis phase. BPMN models have no formal seman- tics to conduct qualitative analysis (validation and verification). In this work is presented how Model Checking (MC) verification technique for software and Timed Automata (TA) formal language are integrated within a formal verification approach to check BPs mod- eled with BPMN. Also, are introduced a set of guideline to transform BPMN models into TA. The use of our approach allow to business analysts and designers to perform evaluation (i.e., qualitative analysis) of BPs, based on the formal specification of BP–task model with TA. The application of the approach is aimed to evaluate the behavior of the BP–task model with respect to business performance indicators (for instance, service time, waiting time or queue size) derived from business needs, as is shown in an instance of an enterprise–project related to Customer Relationship Management.
 
 
Highlights
Model Checking (MC) is a formal verification technique that enables exhaustive and automatic checking of whether or not a model meets a given specification [1]
The main contribution of this work is to propose a set of mappings and simple steps defined over the models to converts Business Process Model and Notation (BPMN) diagrams into Timed Automata (TA)–networks
When we check that the Business Processes (BPs)–task model is deadlock–free, we are proved that the BP–task model satisfies tasks timely and orderly, i.e., the BP–workers do not perform tasks asynchronously. 6.3 Customer Relationship Management (CRM) verification To proceed to the CRM BP–task model verification, we introduce each one of the Clocked Computation Tree Logic (CCTL) formulas previously defined in section 6.2 in the Query field below Overview, using the Uppaal MC tool notation
Summary
Model Checking (MC) is a formal verification technique that enables exhaustive and automatic checking of whether or not a model meets a given specification [1]. In this paper, is proposed an approach based on the MC techniques for the formal verification of BPs based on the construction of a BP–task model as a TA–network (i.e., at design–time), which conform with the semantics of the BPMN standard [2] and the business temporal and concurrency constraints. In this way, the behavioral aspects and temporal constraints in a BP–task model are simulated and verified (i.e., at run–time) using the Uppaal [8] MC tool as we will show in the sequel by the application to an instance of Customer Relationship Management (CRM) strategy.
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
