An Algebraic Method for Analysing Control Flow of BPMN Models
This paper introduces an approach for formal verification of BPMN models. The incompatible constructs of the BPMN patterns can lead to wrong or incomplete semantics which resulting the behavioral errors such as deadlock and multiple termination. This research is motivated by the need to create a correct business process and in order to generate a more complete formalization of BPMN semantics than existing formalizations. We first introduce the chosen patterns which are the most used in the modelisation of the service-based business processes. Then, we illustrate a definition of the execution semantics of these patterns by using the rules of Max+ Algebra formulas, which have important benefits.
How to Cite
The submitting author warrants that the submission is original and that she/he is the author of the submission together with the named co-authors; to the extend the submission incorporates text passages, figures, data or other material from the work of others, the submitting author has obtained any necessary permission.
Articles in this journal are published under the Creative Commons Attribution Licence (CC-BY What does this mean?). This is to get more legal certainty about what readers can do with published articles, and thus a wider dissemination and archiving, which in turn makes publishing with this journal more valuable for you, the authors.
By submitting an article the author grants to this journal the non-exclusive right to publish it. The author retains the copyright and the publishing rights for his article without any restrictions.
This journal has been awarded the SPARC Europe Seal for Open Access Journals (What's this?)