Direct Verification of BPMN Processes through an Optimized Unfolding Technique

Business process analysis is one of the most important and complex activities of Business Process Management. Business processes are typically defined by business experts which ask for graphical and user-friendly notations. Nevertheless most notations used typically lack precisely defined semantics limiting the possibility of analysis to informal approaches such as observation techniques. To support formal verification techniques it is necessary to define a precise mapping between the adopted user-friendly notation and a formal language. In this paper we propose a Java based verification approach for Business Processes modeled using the BPMN 2.0 standard. In particular, we defined a precise Java mapping for the main elements of the BPMN 2.0 notation. The relations among the different elements of a BPMN 2.0 specification are supported by the inclusion of specific attributes and methods in the created Java objects. The behavior of a set of interrelated objects, corresponding to a BPMN 2.0 specification, can be explored using an algorithm we defined for the purpose. Such an algorithm permits to avoid the state explosion phenomenon using an ad-hoc unfolding technique. A plug-in for the Eclipse IDE platform has been developed. It permits to have an integrated environment in which to design a business process, to verify it, and to check the result of the verification in order to improve the business process itself. This iterative approach can continue until all the issues highlighted by the verifier are solved. The approach and the prototype have been successfully applied to real scenarios within the Public Administration domain, with encouraging results.