Formal Analysis of BPMN Models Using Event-B

Bryans, Jeremy; Wei, Wei

doi:10.1007/978-3-642-15898-8_3

Cited by 21 publications

(4 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the model-driven development (MDD), the BPMN, which is a dominant notation OMG standard, is a popular business process modelling method for the computation-independent model (CIM) level [25][26][27][28][29]. Many researchers have formalized the BPMN model and analysed the semantics using Petri nets theory [4,7,8,[30][31][32][33], CSP [10,34,35], event-B [36], OCL specification [2,37,38], and BNF syntax [3,11,39], among others. Various formal tools based on the Petri nets are used to specify the BPMN semantics for soundness verification [40,41], property verification [42], safety verification [43], validity verification [44], and semantics specification [45].…”

Section: Related Workmentioning

confidence: 99%

A Petri Nets Evolution Method that Supports BPMN Model Changes

2021

Scientific Programming

View full text Add to dashboard Cite

The correctness of the business process modelling notation (BPMN) is essential for software success, and the BPMN formalization is the foundation of the correctness verification process. However, dynamically adapting the formalized BPMN model to changes in the BPMN model and protecting tokens from being lost in the remapping formalization are the main limitations of the BPMN formalization under changing business requirements. To overcome these limitations, an approach for evolving a Petri nets model according to the BPMN changes is proposed in this paper. In this approach, a check algorithm is designed to identify the differences between the original BPMN model and the updated BPMN model. Then, the evolution rules of the extended Petri nets (EPN) model are defined according to the results of the checking program. Finally, these evolution rules are described in the query/view/transformation operational mapping (QVTo) language and implemented in the Eclipse platform. We demonstrate the effectiveness of the evolution of the BPMN formalization using a case study of the Web Payment business system. Moreover, the dynamic evolution of the BPMN formalization can maintain the consistency between the original model and the updated model, and this consistency has been successfully verified.

show abstract

Section: Related Workmentioning

confidence: 99%

A Petri Nets Evolution Method that Supports BPMN Model Changes

2021

Scientific Programming

View full text Add to dashboard Cite

show abstract

“…https://sites.google.com/site/tase8prfafyz7v/ since event structures can be understood as the unfoldings of Petri nets [19]. Further different approaches provide a semantics for BPMN based on Event-B [6] and PROMELA [26] making it possible to apply the underlying techniques for property verification. In the case of using PROMELA, the model checker SPIN [14] enables the verification of livelocks, deadlocks and LTL properties over BPMN models.…”

Section: Related Workmentioning

confidence: 99%

An integrated framework for verifying multiple care pathways

Bowles

Caminati

Cha

2017

2017 International Symposium on Theoretical Aspects of Software Engineering (TASE)

View full text Add to dashboard Cite

Common chronic conditions are routinely treated following standardised procedures known as clinical pathways. For patients suffering from two or more chronic conditions, referred to as multimorbidities, several pathways have to be applied simultaneously. However, since pathways rarely consider the presence of comorbidities, applying several pathways may lead to potentially harmful (medication) conflicts. This paper proposes an automated framework to detect, highlight and resolve conflicts in the treatments used for patients with multimorbidites. We use BPMN as a modelling language for capturing care guidelines. A BPMN model is transformed into an intermediate formal model capturing the possible unfoldings of the pathway. Putting together the constraint solver Z3 and the theorem prover Isabelle, we combine treatment plans and check the correctness of the approach. We illustrate the approach with an example from the medical domain and discuss future work.

show abstract

“…[32], and is designed for business processes and the BPEL language. The paper [10] is another work that considers an algorithmic translation from BPMN to the Event-B notation, which based on the abstract machine notation, for system modeling and analysis. [34] presents a survey of formal verification for business processes.…”

Section: Related Workmentioning

confidence: 99%

A system for deduction-based formal verification of workflow-oriented software models

Klimek

2014

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

The work concerns formal verification of workflow-oriented software models using the deductive approach. The formal correctness of a model's behaviour is considered. Manually building logical specifications, which are regarded as a set of temporal logic formulas, seems to be a significant obstacle for an inexperienced user when applying the deductive approach. A system, along with its architecture, for deduction-based verification of workflow-oriented models is proposed. The process inference is based on the semantic tableaux method, which has some advantages when compared with traditional deduction strategies. The algorithm for automatic generation of logical specifications is proposed. The generation procedure is based on predefined workflow patterns for BPMN, which is a standard and dominant notation for the modeling of business processes. The main idea behind the approach is to consider patterns, defined in terms of temporal logic, as a kind of (logical) primitives which enable the transformation of models to temporal logic formulas constituting a logical specification. Automation of the generation process is crucial for bridging the gap between the intuitiveness of deductive reasoning and the difficulty of its practical application when logical specifications are built manually. This approach has gone some way towards supporting, hopefully enhancing, our understanding of deduction-based formal verification of workflow-oriented models.

show abstract

Formal Analysis of BPMN Models Using Event-B

Cited by 21 publications

References 17 publications

A Petri Nets Evolution Method that Supports BPMN Model Changes

A Petri Nets Evolution Method that Supports BPMN Model Changes

An integrated framework for verifying multiple care pathways

A system for deduction-based formal verification of workflow-oriented software models

Contact Info

Product

Resources

About