Enabling model checking for collaborative process analysis: from BPMN to ‘Network of Timed Automata’

Mallek, Sihem; Daclin, Nicolas; Chapurlat, Vincent; Vallespir, Bruno

doi:10.1080/17517575.2013.879211

Cited by 20 publications

(11 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Military [16], [40], [41], [42], [43], [44], [45], [46], [47], [48], [49], [50], [51], [52], [53], [54] Industry [18], [19], [20], [23], [33], [34], [36], [55], [56], [57], [58], [59], [60], [61], [62], [63], [64], [65], [66], [67], [68], [69], [70], [71], [72], [73], [74], [75], [76], [77], [78], [79], [80], [81], [82]…”

Section: Domain Referencementioning

confidence: 99%

See 1 more Smart Citation

Interoperability assessment: A systematic literature review

Leal

Guédria

Panetto

2019

Computers in Industry

103

View full text Add to dashboard Cite

The development of Interoperability is a necessity for organisations to achieve business goals and capture new market opportunities. Indeed, interoperability allows enterprises to exchange information and use it to seize their shared goals. Therefore, it should be verified and continuously improved. This is the main objective of the Interoperability Assessment (INAS). Indeed, such an assessment aims at determining the strengths and weakness of an enterprise in terms of interoperability. Many surveys and reviews have been proposed in the literature to analyse the existing INAS approaches. However, the majority of these reviews are focusing on specific properties rather than a general view of an INAS. Therefore, this paper proposes a systematic literature review of INAS approaches. The objectives are to identify the relevant INAS approaches and to compare them based on a holistic view based on their similar and different properties (e.g. type of assessment, the used measurement mechanism, and the addressed interoperability barriers). A bibliometric analysis of the selected INAS approaches is also conducted with a discussion of their advantages and limitations.

show abstract

Section: Domain Referencementioning

confidence: 99%

“…In the publications [64], [65], [66], [67], [55], the authors propose and develop an approach for defining and verifying interoperability requirements. Such an approach focuses on the verification of requirement that two Entities should comply before interoperating.…”

Section: Approach A5: Writing and Verifying Interoperability Requiremmentioning

confidence: 99%

Interoperability assessment: A systematic literature review

Leal

Guédria

Panetto

2019

Computers in Industry

103

View full text Add to dashboard Cite

show abstract

“…The techniques of [23] and [24] focused on data anomaly detection in BPMN design models, and the data flow representation was still not the actual data flow in the BPMN model. Some studies have included experiments outside the context of the CPN modeling language for verifying BPMN design models via timed automata [25], Pi-Calculus [26] and process algebra [27]. Malleka et al [25] provided an interoperability checking technique for the BPMN collaborating diagram.…”

Section: Related Workmentioning

confidence: 99%

“…Some studies have included experiments outside the context of the CPN modeling language for verifying BPMN design models via timed automata [25], Pi-Calculus [26] and process algebra [27]. Malleka et al [25] provided an interoperability checking technique for the BPMN collaborating diagram. The BPMN model was mapped to a formal model written in UPPAAL language, that is, timed automata.…”

Section: Related Workmentioning

confidence: 99%

Hierarchical Verification for the BPMN Design Model Using State Space Analysis

2019

View full text Add to dashboard Cite

The BPMN design models are widely used in the software development process. Owing to the lack of BPMN standard semantics, formal verification is used to validate whether the BPMN design model is free of undesirable properties. The primary challenges of BPMN design model verification are the enormous size and complexity of BPMN design models; these challenges may lead to time-consuming processes for model abstraction and overcoming the state space explosion problem. This paper proposes a hierarchical verification technique for the state space analysis based on a colored Petri net (CPN). A BPMN partitioning technique and rules for the transformation of a BPMN into a CPN model are provided. The partitioning approach supports the unstructured BPMN design model, and the obtained CPN model also supports hierarchical verification. To validate and analyze the BPMN design model, the transformation technique and state space generator are implemented as a BPMN verification framework. This method is a viable option for the software process designers and is suitable for the large-scale BPMN design model verification.

show abstract

“…Therefore, automated formal methods are used instead. Automatic verification includes: Model Checking (MC) [5], [9] and Automated Theorem Proving (ATP) [10], [11].…”

Section: Introductionmentioning

confidence: 99%

Hypercube Graph Decomposition for Boolean Simplification: An Optimization of Business Process Verification

Naoum¹,

El²,

Al³

et al. 2019

ijacsa

View full text Add to dashboard Cite

This paper deals with the optimization of business processes (BP) verification by simplifying their equivalent algebraic expressions. Actual approaches of business processes verification use formal methods such as automated theorem proving and model checking to verify the accuracy of the business process design. Those processes are abstracted to mathematical models in order to make the verification task possible. However, the structure of those mathematical models is usually a Boolean expression of the business process variables and gateways. Thus leading to a combinatorial explosion when the number of literals is above a certain threshold. This work aims at optimizing the verification task by managing the problem size. A novel algorithm of Boolean simplification is proposed. It uses hypercube graph decomposition to find the minimal equivalent formula of a business process model given in its disjunctive normal form (DNF). Moreover, the optimization method is totally automated and can be applied to any business process having the same formula due to the independence of the Boolean simplification rules from the studied processes. This new approach has been numerically validated by comparing its performance against the state of the art method Quine-McCluskey (QM) through the optimization of several processes with various types of branching.

show abstract

Enabling model checking for collaborative process analysis: from BPMN to ‘Network of Timed Automata’

Cited by 20 publications

References 8 publications

Interoperability assessment: A systematic literature review

Interoperability assessment: A systematic literature review

Hierarchical Verification for the BPMN Design Model Using State Space Analysis

Hypercube Graph Decomposition for Boolean Simplification: An Optimization of Business Process Verification

Contact Info

Product

Resources

About