Formalization and Model Checking of BPMN Collaboration Diagrams with DD-LOTOS

Maarouk, Toufik Messaoud; Souidi, Mohammed El Habib; Hoggas, Nadia

doi:10.31577/cai_2021_5_1080

Cited by 3 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This approach is close to ours, in the sense that it allows the user to verify a safety temporal logic property over a BPMN process, while providing him a counterexample in the form of an LTS if the property is violated. Other works, such as [17] and [24] are also making use of model checking to perform verifications of temporal logic properties over BPMN processes.…”

Section: Related Workmentioning

confidence: 99%

Debugging of BPMN Processes Using Coloring Techniques

Nivon

Salaün

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

A business process is a collection of related tasks organized in a specific order whose overall execution solves a specific service or product. BPMN has become the standard workflow-based notation for developing business processes. Designing business processes using BPMN is however error-prone. Recent works have proposed verification techniques for analyzing processes and for detecting possible issues. In particular, model checking is an established technique for automatically verifying that a model (e.g., a BPMN process) satisfies a given temporal property. When the model violates the property, the model checker returns a counterexample, which is a sequence of actions leading to a state where the property is not satisfied. Understanding this counterexample for debugging the process is not an easy task, especially if the counterexample is not expressed using the original notation (BPMN here). In this paper, we focus on the model checking of BPMN processes. When properties are violated, we propose to transform counterexamples back on to the original BPMN process in order to simplify the debugging steps. To do so, we rely on coloration techniques. The approach proposed in this paper is fully automated using several tools and was validated on many examples.

show abstract

Section: Related Workmentioning

confidence: 99%

Debugging of BPMN Processes Using Coloring Techniques

Nivon

Salaün

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Once the specification is generated, we can formally verify certain properties, such as deadlock, using the UPPAAL model checker. The formal verification approach is described in our work [36].…”

Section: Introductionmentioning

confidence: 99%

Formalization of BPMN Gateways using the DD-LOTOS Formal Language

Maarouk,

El Habib Souidi,

Ledmi

et al. 2023

JCOMSS

View full text Add to dashboard Cite

Business Process Model and Notation (BPMN), is a standardized graphical language used for the graphical modeling of business processes. A BPMN model is composed of several small graphs called elements; these elements make it possible to describe the activities, the events, and the interactions between the components of a business process. Among the essential elements of BPMN are gateways, which control the flow of data. However, the big challenge of these gateways is the existence of several interpretations of the same BPMN model containing gateways; this is due to the informal and ambiguous definition. Several works have proposed the formalization of gateways using formal languages such as process algebras, Petri nets, etc. The purpose of this article is to propose a formalization of BPMN gateways using the formal language DD-LOTOS. DD-LOTOS is defined on a semantics of true parallelism called maximality semantics and allows to support distribution and temporal constraints. We then propose the verification of certain properties using the UPPAAL model checker. Our approach has been validated through a case study representing the online purchasing process.

show abstract