Specification and Verification of Complex Business Processes - A High-Level Petri Net-Based Approach

Kheldoun, Ahmed; Barkaoui, Kamel; Ioualalen, Malika

doi:10.1007/978-3-319-23063-4_4

Cited by 21 publications

(14 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This effect can often be traced to the decision of directly encoding service compositions into the modeling language of a model checker without careful analysis of the effect of the encoding on the internal state machine of the model checker. Approaches include [4], [21], [22], [23], [24], [25], [26], and [27]. For example, in [4], it is reported that the mapping causes a simple process of five activities and four transitions to be mapped to 201 states and 586 transitions.…”

Section: Related Workmentioning

confidence: 99%

A Formal Model for Compliance Verification of Service Compositions

Groefsema

Beest

Aiello

2018

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

Business processes design and execution environments increasingly need support from modular services in service compositions to offer the flexibility required by rapidly changing requirements. With each evolution, however, the service composition must continue to adhere to laws and regulations, resulting in a demand for automated compliance checking. Existing approaches, if at all, either offer only verification after the fact or linearize models to such an extent that parallel information is lost. We propose a mapping of service compositions to Kripke structures by using colored Petri nets. The resulting model allows preventative compliance verification using wellknown temporal logics and model checking techniques while providing full insight into parallel executing branches and the local next invocation. Furthermore, the mapping causes limited state explosion, and allows for significant further model reduction. The approach is validated on a case study from a telecom company in Australia and evaluated with respect to performance and expressiveness. We demonstrate that the proposed mapping has increased expressiveness while being less vulnerable to state explosion than existing approaches, and show that even large service compositions can be verified preventatively with existing model checking techniques.

show abstract

Section: Related Workmentioning

confidence: 99%

A Formal Model for Compliance Verification of Service Compositions

Groefsema

Beest

Aiello

2018

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

show abstract

“…The most common formalisations of BPMN are given via encodings to various formalisms, such as Petri Nets [9], [45], [46], [47], [48], or their extensions such as YAWL [49], [50] and ECATNets [51] [52], and process calculi [10], [53], [11], [54], [12], [55], [56], [57].…”

Section: B Bpmn Formalisation Via Encodingsmentioning

confidence: 99%

“…More recently, Kheldoun et al [51], [52] proposed an encoding from BPMN to Recursive ECATNets, which can be expressed in term of conditional rewriting logic and given in input to the MAUDE LTL model checker. Even if we use the same model checker, the approach in [51] suffers from the encoding problems discussed above and, in particular, it does not consider messages in the encoding as well as the event-based gateway.…”

Section: B Bpmn Formalisation Via Encodingsmentioning

confidence: 99%

“…Even if we use the same model checker, the approach in [51] suffers from the encoding problems discussed above and, in particular, it does not consider messages in the encoding as well as the event-based gateway. Moreover, the authors illustrate the approach through three simple examples only, without extensively validating it.…”

Section: B Bpmn Formalisation Via Encodingsmentioning

confidence: 99%

See 1 more Smart Citation

BProVe: A formal verification framework for business process models

Corradini

Fornari

Polini

et al. 2017

2017 32nd IEEE/ACM International Conference on Automated Software Engineering (ASE)

View full text Add to dashboard Cite

Abstract-Business Process Modelling has acquired increasing relevance in software development. Available notations, such as BPMN, permit to describe activities of complex organisations. On the one hand, this shortens the communication gap between domain experts and IT specialists. On the other hand, this permits to clarify the characteristics of software systems introduced to provide automatic support for such activities. Nevertheless, the lack of formal semantics hinders the automatic verification of relevant properties.This paper presents a novel verification framework for BPMN 2.0, called BProVe. It is based on an operational semantics, implemented using MAUDE, devised to make the verification general and effective. A complete tool chain, based on the Eclipse modelling environment, allows for rigorous modelling and analysis of Business Processes. The approach has been validated using more than one thousand models available on a publicly accessible repository. Besides showing the performance of BProVe, this validation demonstrates its practical benefits in identifying correctness issues in real models.

show abstract

“…Time Recursive ECATNets, which are a special kind of highlevel algebraic nets, offer a practical recursive mechanism for a direct and intuitive support of the dynamic creation, suppression and synchronization of concurrent processes [13] [14]. This allows us to model exception mechanisms (e.g.…”

Section: Introductionmentioning

confidence: 99%

Modelling and analyzing home care plans using high-level Petri nets

Barkaoui

Hicheur

Kheldoun

et al. 2016

2016 13th International Workshop on Discrete Event Systems (WODES)

Self Cite

View full text Add to dashboard Cite

Given the constant pressure to improve healthcare efficiency, home care appears as a unique solution for providing personalized healthcare service and home assistance for a growing number of elderly and chronic patients. Home care plans define the health cares or supportive cares delivered by the different home care professionals for a given patient. The management of these plans is challenging since they are inherently flexible, context dependent and cooperative processes involving repetitive activities with complex temporal expressions. In this paper, we propose a formal method based time recursive ECATNets for modelling and analyzing home care plans. The choice of this formalism relies on its ability in modelling flexible and distributed home care processes, with complex temporal constraints. Moreover, since time recursive ECATNets semantics are expressed in terms of conditional rewriting logic, we can use the Real Time MAUDE TCTL model checker to verify temporal properties of home care plan processes.

show abstract

Specification and Verification of Complex Business Processes - A High-Level Petri Net-Based Approach

Cited by 21 publications

References 15 publications

A Formal Model for Compliance Verification of Service Compositions

A Formal Model for Compliance Verification of Service Compositions

BProVe: A formal verification framework for business process models

Modelling and analyzing home care plans using high-level Petri nets

Contact Info

Product

Resources

About