The growing importance of big data applications calls for the development of tools and methods to facilitate the development of high-quality applications. In this paper, we propose a model-driven approach for the specification and formal verification of the Hadoop-MapReduce workflow using the de facto standard BPMN2 and the Event B formal method. This approach is automated by the development of a prototype tool called BPMN-MapRed2EventB.

The BPMN2 language suffers from the absence of a precise formal semantics of the various notations used, which often leads to ambiguities. In addition, this language does not have a proof system that validates a BPMN2 specification. Consequently, the use of a formal method, such as Event B, is a solution for dealing with the shortcomings found in the BPMN2 language. We propose in this paper a model-driven approach based on meta-model and meta-model transformation implemented in KerMeta to specify and formally verify workflows.

This paper presents a meta-model transformation based approach to reasoning about sequence diagrams using B event. We present an approach for the specification and the verification of flexible Workflow applications of cloud services. Our approach is based on the semiformal notation of UML sequence diagrams, and the formal method B event. We have developed a tool called SD2EventB supporting the proposed approach. This tool allows the specification of flexible Cloud service Workflow application models using predefined flexibility patterns generated automatically by this tool. Once the model is specified, it is transformed to an event B model to be verified. In order to ensure this verification, we have used the platform Rodin supporting the event B method. This platform has been integrated into our tool. The transformation, as well, has been developed as a function of our tool using the meta-model transformation environment KerMeta.

We propose a workflow application constructive approach in which Event B models are built incrementally from UML AD models. Following our proposed approach, to be verified, workflow activity diagram models should be translated into Event B models which will be proved using the RODIN tool. To reach this objective, we propose, in this paper, a meta-model based transformation from UML AD to Event B models. To ensure the correctness and the completion of the transformation we propose a graph homomorphic mapping between the activity diagram and Event B models elements. By an example of workflow application we illustrate the proposed technique.

In this paper, we propose an approach for the specification and the verification of workflow applications using UML AD and Event B. Workflow carries applications where many actors take part and cooperate in order to execute operations. Upon composing those operations, many problems such as deadlock, freeness and livelock might appear. In this context, we are going to show how to express an UML Activity Diagram model in Event B. In our approach, the workflow is initially expressed incrementally graphically with UML AD, then translated into Event B and verified using the B powerful support tools. The Event-B expression of the UML AD model allows us to give it a precise semantics. We propose a workflow applications constructive approach in witch Event B models are built incrementally from UML AD models, driven by UML refinement patterns. The use of the B formal method and its refinement mechanism allows the verification of the correction of the UML AD refinement patterns.

This paper presents a new event-B based approach to reasoning about workflow applications. We show how an event-B model can be structured from UML Activity diagrams (UML AD) and then used to give a formal semantic to UML AD which supports proofs of their correctness. More precisely, we give rules for the translation of UML AD into event-B language. In particular, we propose a solution that uses the refinement in Event B to encode the hierarchical decomposition of activities in UML AD. The event-B method allows the definition of invariant describing required properties (deadlock-inexistence, liveness, fairness) and provides an automatic proof. We discuss the contributions and by an example of a workflow application, we illustrate the proposed approach.

This paper presents a specification and verification technique for distributed and parallel applications using formal and semi-formal methods. The proposed technique uses UML and Event B. The design is initially expressed graphically with UML, then translated into Event B and verified using the B powerful support tools. In this paper, we focus on the translation of activity diagrams into Event B, in order to verify workflow properties of distributed and parallel applications with the B prover. We present translation rules of activity diagrams into Event B, and relation between hierarchical decomposition of activities in UML activity diagrams and the refinement in Event B.