BPMN 2.0 Execution Semantics Formalized as Graph Rewrite Rules

Abstract

Abstract. This paper presents a formalization of a subset of the BPMN 2.0 execution semantics in terms of graph rewrite rules. The formalization is supported by graph rewrite tools and implemented in one of these tools, called GrGen. The benefit of formalizing the execution semantics by means of graph rewrite rules is that there is a strong relation between the execution semantics rules that are informally specified in the BPMN 2.0 standard and their formalization. This makes it easy to validate the formalization. Having a formalized and implemented execution semantics supports simulation, animation and execution of BPMN 2.0 models. In particular this paper explains how to use the formal execution semantics to verify workflow engines and service orchestration and choreography engines that use BPMN 2.0 for modeling the processes that they execute.

Strategic Alignment of Business Processes

“…In previous work [24,50,135,175,197], many researchers have described formal models for graph encoding particular process model types. In our work we provide a general summary for process model formulation (based loosely on the work of our peers); however, we draw attention to the fact that all automation and computation in our framework is done at the design level rather than at the execution level and as such various elements of some graph encodings do not fit with the definitions we've provided.…”

“…The Business Process Modeling Notation, BPMN [50], is a standardized notation for creating process models, used to represent business specific process models. It is formed using a collection of activities, gateways, events, sequence flows, pools, swim lanes, and message flows.…”

“…al. [50] have described a graph encoding of the BPMN 2.0 standard that takes into consideration the execution semantic of a large selection of BPMN elements. In this thesis, a generalisation of Dijkman's encoding is proposed.…”

Behaviour modelling and transformations for context-aware mobile applications

“…Therefore, the work proposed in [96] aims at defining a formal semantics for BPMN. This semantics is then used both for analysis and execution purposes [97][98]. Figure 47 shows a transformation from BPMN to Petri Nets, which allows BPMN models to be formally analysed in terms of their semantic correctness, for example to detect deadlocks and livelocks.…”

“…Therefore, it is advisable to transform BPMN to some other formalism, such as, for example, YAWL nets, which can be analysed for correctness and, in addition, can also be simulated, animated and executed. In order to achieve this, the work in [98] defines an execution semantics for a subset of BPMN (2.0) in terms of graph rewrite rules, which are the basic building blocks of graph transformations. As mentioned in Section 4.3, graph rewrite rules consist of a left-hand side, which defines the condition in which a rule should be applied, and a right-hand side, which defines what should be realised when the left-hand side is fulfilled.…”