Abstract

Business process model and notation (BPMN) is a standard for modelling business processes (BP). Despite the fact that it is a BP specific notation, it suffers from a lack of semantics. Indeed, BPMN model can be interpreted in several ways, which may lead to undesirable situations such as deadlocks. To solve this problem, we propose to use formal verification to guarantee certain properties at the BP designer. In this context, our approach is to transform BPMN models to a Petri net model. Petri nets are a formal language for distributed concurrent systems. They are suitable for modelling the behaviour of systems in terms of flows and are well supported by analysis tools. The Petri net model resulting from the transformation is then verified. We also define an interpretation module of the verification results in terms of BPMN.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.