A Formal Model for Compliance Verification of Service Compositions

Groefsema, Heerko; Beest, Nick van; Aiello, Marco

doi:10.1109/tsc.2016.2579621

Cited by 19 publications

(18 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The weakness of this research is to mark the BPEL process manually, and there is still the state space explosion problem by increasing the business processes. Groefsema et al 97 provided a Kripke-based model checking method for the business process service composition. First, a colored Petri net (CPN) methodology is applied to create reachability graph of the composition services using the LTS model.…”

Section: Model Checking Methods In the Service Composition Approachmentioning

confidence: 99%

See 1 more Smart Citation

Formal verification approaches in the web service composition: A comprehensive analysis of the current challenges for future research

Souri

Rahmani

Navimipour

2018

Int J Communication

View full text Add to dashboard Cite

Summary Today, service composition is emerging paradigm on the communication networks such as cloud environments, internet of things, wireless sensor network, and software‐defined network. The goal of service composition method is to provide the interactions between user requirements and smart objects of intelligent communication systems. There have been many efforts to use formal verification and behavioral modeling methods to evaluate the service composition mechanisms. Up to now, there is not a comprehensive analysis research on this topic. Therefore, this paper focuses on several formal verification approaches that are performed to confirm the service composition correctness in communication networks. The objective of this paper is to comprehensively categorize and examine current research techniques on formal verification of the service composition. This research analysis provides an overview of recent service composition approaches according to structural and functional properties. Comparison results show that most of the verification approaches in explanation of the service composition correctness are semantic‐aware approach with 43%. The most used verification method for the service composition is model checking with 69%. The process algebra is used 29%, and some theorem proving methods are applied in 9% of the investigated mechanism. Moreover, most widely used modeling tools are NuSMV (22%), SPIN (17%), CPN (12%), UPPAAL (12%), Event‐B (10%), and PAT (5%).

show abstract

Section: Model Checking Methods In the Service Composition Approachmentioning

confidence: 99%

“…Groefsema et al provided a Kripke‐based model checking method for the business process service composition. First, a colored Petri net (CPN) methodology is applied to create reachability graph of the composition services using the LTS model.…”

Section: Categorizing Of Selected Service Composition Approachesmentioning

confidence: 99%

Formal verification approaches in the web service composition: A comprehensive analysis of the current challenges for future research

Souri

Rahmani

Navimipour

2018

Int J Communication

View full text Add to dashboard Cite

show abstract

“…For the qualitative evaluation, we used a real-life process concerning a customer support process in a telecom company in Australia, as presented in [22]. The process contains 24 visible activities, 8 τ transitions and a start and end transition.…”

Section: B Qualitative Evaluation With a Real-life Processmentioning

confidence: 99%

Synthesis of Regulation Compliant Business Processes

Ghooshchi

Beest

Governatori

et al. 2021

IEEE Trans. Serv. Comput.

Self Cite

View full text Add to dashboard Cite

Organisations have to cope with large numbers of business rules and existing regulations governing the business in which they operate. Such rules are difficult to maintain due to their size and complexity, and it is increasingly challenging to ensure that each business process adheres to those rules. As such, automated extraction of business processes from rules has three clear advantages: (1) visualisation of all possible executions allowed by the rules, (2) automated execution and compliance by design, (3) identification of "inefficiencies" in the business rules. Existing approaches, however, only allow for the generation of partial traces based on input specifications and cannot handle many different input cases resulting in a full process. This paper presents a formal method to visualise and operationalise such sets of rules as a verifiable business process that is compliant by design, which allows us to analyse all possible execution paths. Additionally, we formally prove correctness of the business processes generated by our method. The approach is implemented in a tool and evaluated on both performance and correctness, showing that even for highly complex sets of rules the approach performs well and outperforms a well-known state-of-the-art approach. Evaluation on a real-life process shows the feasibility of the presented approach. * This paper extends the work presented in [1] in the following ways: (i) it provides an updated and more efficient algorithm, (ii) it provides formal proofs of correctness of the algorithms, and (iii) it includes an extensive evaluation of the approach on both synthetic and real-life processes.

show abstract

“…However, control-flow constraints may be conditional and apply therefore only locally, e.g. when using CTL* such as in [10]. In these cases, the enforcing part of the rules can be conditional and the problem belongs to the variant nL-.…”

Section: Existing Approaches and Their Complexitymentioning

confidence: 99%