A Process Semantics for BPMN

Wong, Peter Y. H.; Gibbons, Jeremy

doi:10.1007/978-3-540-88194-0_22

Cited by 121 publications

(81 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Beside the work described in this paper and our earlier work [12], CSP has been applied to formalize other business process modelling languages. For example Yeung [15] mapped the Web Service Business Process Execution Language (WS-BPEL) and the Web Service Choreography Description Language (WS-CDL) to CSP to verify the interaction of BPEL processes against the WS-CDL description; his approach considers traces refinement and hence only safety properties.…”

Section: Related Workmentioning

confidence: 99%

“…There are currently over seventy implementations of the notation, but the notation specification does not have a formal behavioural semantics, which we believe to be crucial in behavioural specification and verification activities. Previously a process semantics [12] has been given for a large subset of BPMN in the language of Communicating Sequential Processes (CSP) [10]. This semantics maps BPMN diagrams to finite state CSP processes.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Compositional Development of BPMN

Wong¹

2013

Software Composition

Self Cite

View full text Add to dashboard Cite

Abstract. Business Process Modelling Notation (BPMN) intends to bridge the gap between business process design and implementation. Previously we provided a process semantics to a subset of BPMN in the language of Communicating Sequential Processes (CSP). This semantics allows developers to formally analyse and compare BPMN diagrams using CSP's traces and failures refinements. In this paper we introduce a comprehensive set of operations for constructing BPMN diagrams, provide them a CSP semantics, and characterise the conditions under which the operations are monotonic with respect to CSP refinements, thereby allowing compositional development of business processes.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Compositional Development of BPMN

Wong¹

2013

Software Composition

Self Cite

View full text Add to dashboard Cite

show abstract

“…As a result, some incoming flows may switch from having one token to having no token, and previously irrelevant changes may become relevant again. Once all changes are accounted for, the status of the OR-join has to be reevaluated (lines [12][13][14][15][16][17][18][19]. Here, all predecessors along empty flows are checked.…”

Section: Incremental Evaluationmentioning

confidence: 99%

“…In the case of BPEL, a number of formalizations have been proposed [3]. On the other hand, virtually no attempt has been made to attach a formal semantics to BPMN, barring recent work on formalizing subsets thereof [17,7]. Compounded with the fact that executability has not been a major concern during the standardization of BPMN, this has led to a standard specification with numerous ambiguities.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Semantics of Standard Process Models with OR-Joins

Dumas

Grosskopf

Hettel

et al.

On the Move to Meaningful Internet Systems 2007: CoopIS, DOA, ODBASE, GADA, and IS

View full text Add to dashboard Cite

Abstract. The Business Process Modeling Notation (BPMN) is an emerging standard for capturing business processes. Like its predecessors, BPMN lacks a formal semantics and many of its features are subject to interpretation. One construct of BPMN that has an ambiguous semantics is the OR-join. Several formal semantics of this construct have been proposed for similar languages such as EPCs and YAWL. However, these existing semantics are computationally expensive. This paper formulates a semantics of the OR-join in BPMN for which enablement of an OR-join in a process model can be evaluated in quadratic time in terms of the total number of elements in the model. This complexity can be reduced down to linear-time after materializing a quadratic-sized data structure at design-time. The paper also shows how to efficiently detect the enablement of an OR-join incrementally as the execution of a process instance unfolds.

show abstract

Smart contract generation for inter‐organizational process collaboration

Xiong,

Feng,

Pan

et al. 2023

Concurrency and Computation

View full text Add to dashboard Cite

SummaryCurrently, inter‐organizational process collaboration (IOPC) has been widely used in the design and development of distributed systems that support business process execution. Blockchain‐based IOPC can establish trusted data sharing among participants, attracting more and more attention. The core of such study is to translate the graphical model (e.g., BPMN) into program code called smart contract that can be executed in the blockchain environment. In this context, a proper smart contract plays a vital role in the correct implementation of block‐chain‐based IOPC. In fact, the quality of graphical model affects the smart contract generation. Problematic models (e.g., deadlock) will result in incorrect contracts (causing unexpected behaviors). To avoid this undesired implementation, this article explores to generate smart contracts by using the verified formal model as input instead of graphical model. Specifically, we introduce a prototype framework that supports the automatic generation of smart contracts, providing an end‐to‐end solution from modeling, verification, translation to implementation. One of the cores of this framework is to provide a CSP#‐based formalization for the BPMN collaboration model from the perspective of message interaction. This formalization provides precise execution semantics and model verification for graphical models, and a verified formal model for smart contract generation. Another novelty is that it introduces a syntax tree‐based translation algorithm to directly map the formal model into a smart contract. The required formalism, verification, and translation techniques are transparent to users without imposing additional burdens. Finally, a set of experiments shows the effectiveness of the framework.

show abstract

A Process Semantics for BPMN

Cited by 121 publications

References 4 publications

Compositional Development of BPMN

Compositional Development of BPMN

Semantics of Standard Process Models with OR-Joins

Smart contract generation for inter‐organizational process collaboration

Contact Info

Product

Resources

About