Web Services: A Process Algebra Approach

It is now well-admitted that formal methods are helpful for many issues raised in the Web service area. In this paper we present a framework for the design and verification of WSs using process algebras and their tools. We define a two-way mapping between abstract specifications written using these calculi and executable Web services written in BPEL4WS. Several choices are available: design and correct errors in BPEL4WS, using process algebra verification tools, or design and correct in process algebra and automatically obtaining the corresponding BPEL4WS code. The approaches can be combined. Process algebra are not useful only for temporal logic verification: we remark the use of simulation/bisimulation both for verification and for the hierarchical refinement design method. It is worth noting that our approach allows the use of any process algebra depending on the needs of the user at different levels (expressiveness, existence of reasoning tools, user expertise)

Analysis of communication models in web service compositions

In this paper we describe an approach for the verification of Web service compositions dened by sets of BPEL processes. The key aspect of such a verification is the model adopted for representing the communications among the services participating in the composition. Indeed, these communications are asynchronous and buffered in the existing execution frameworks, while most verication approaches assume a synchronous communication model for efficiency reasons. In our approach, we develop a parametric model for describing Web service compositions, which allows us to capture a hierarchy of communication models, ranging from synchronous communications to asynchronous communications with complex buffer structures. Moreover, we develop a technique to associate with a Web service composition the most adequate communication model, i.e., the simplest model that is sufficient to capture all the behaviors of the composition. This way, we can provide an accurate model of a wider class of service composition scenarios, while preserving as much as possible an efficient performance in verification

Communications semantics for WSBPEL Processes

ISBN : 978-0-7695-3310-0International audienceWSBPEL opens up the possibility of applying a range of formal techniques to the verification of Web service behaviors from two points of view: constraints between activities within the same process and dependencies between activities of different processes. In a previous work, we have described an approach for the verification of Web service compositions defined by a set of BPEL processes. The key aspect of such a verification task is the model adopted for representing the communications among the services participating to the composition. In this paper, we propose to extend this approach to handle dependencies between activities of different process orchestrations through message exchanges. Our aim is to enable supporting models of service choreography with multiple interacting Web services compositions, from the perspective of a collaborative distributed composition development environment. The process of behavior analysis moves from a single local process to that of modelling and analyzing the behavior of multiple processes across composition domains

Mapping SDL Specification Fundamentals to Core SDL Ontology

This paper gives a contribution in the efforts of Semantic web ontology development. We have developed the core ontology for Specification and Description Language (SDL),an object-oriented, formal language defined by the International Telecommunications Union Telecommunications Standardization Sector (ITU-T) as recommendation Z.100. The language is intended for the specification of complex, event-driven, real-time, and interactive applications involving many concurrent activitiesthat communicate using discrete signals. Using SDL formal model for system specification we bridge the gap between ideas in our minds and the actual implementation of the system. Being visually appealing SDL provides us with a simple tool for communication either between the softwaredevelopers or between non-experts without advanced engineering skills. In this paper we propose the ontology for the basic SDL system and process elements. We also propose a formal framework of SDL Markup Language as a medium for translating SDL model to SDL ontology

A compensating transaction example in twelve notations

The scenario of business computer systems changed with the advent of cross-entity computer interactions: computer systems no longer had the limited role of storing and processing data, but became themselves the players which actuated real-life actions. These advancements rendered the traditional transaction mechanism insufficient to deal with these new complexities of longer multi-party transactions. The concept of compensations has long been suggested as a solution, providing the possibility of executing “counter”-actions which semantically undo previously completed actions in case a transaction fails. There are numerous design options related to compensations particularly when deciding the strategy of ordering compensating actions. Along the years, various models which include compensations have emerged, each tackling in its own way these options. In this work, we review a number of notations which handle compensations by going through their syntax and semantics — highlighting the distinguishing features — and encoding a typical compensating transaction example in terms of each of these notations.peer-reviewe

Web Services Compositions Modelling and Choreographies Analysis

International audienceIn (Rouached, Godart and al. 2006; Rouached, Godart 2007), we have described the semantics of WSBPEL by way of mapping each of the WSBPEL (Arkin, Askary and al. 2004) constructs to the EC algebra and building a model of the process behaviour. With these mapping rules, we have described a modelling approach of a process defined for a single Web service composition. However, this modelling is limited to a local view and can only be used to model the behaviour of a single process. A series of compositions in Web service choreography need specific modelling activities that are not explicitly derived from an implementation. An elaboration of modelling is then required to represent the behaviour of interacting compositions across partnered processes. This elaboration provides a representation that enables us to perform analysis of service interaction for behaviour properties. The ability to perform verification and validation between execution and design, and within the process compositions themselves, is a key requirement of the Web services architecture specification. In this paper, we further the semantic mapping to include Web service composition interactions through modelling Web service conversations and their choreography. We describe this elaboration of models to support a view of interacting Web service compositions extending the mapping from WSBPEL to EC, and including Web service interfaces (WSDL) for use in modelling between services. The verification and validation techniques are also exposed. An automated induction-based theorem prover is used as verification back-end

A Semantical Framework To Engineering WSBPEL Processes

International audienceWeb services promise the interoperability of various applications running on heterogeneous platforms over the Internet, and are gaining more and more attention. Web service composition refers to the process of combining Web services to provide value-added services, which has received much interest in supporting enterprize application integration. Industry standards for Web Service composition, such as WSBPEL, provide the notation and additional control mechanisms for the execution of business processes in Web service collaborations. However, these standards do not provide support for checking interesting properties related to Web Service and process behavior. In an attempt to fill this gap, we describe a formalization of WSBPEL business processes, that adds communications semantics to the specifications of interacting Web services, and uses a formal logic to model their dynamic behavior, which enables their formal analysis and the inference of relevant properties of the systems being built

Formal verification: further complexity issues and applications

Prof. Giacomo Cioffi (Università di Roma "La Sapienza"), Prof. Fabio Panzieri (Università di Bologna), Dott.ssa Carla Limongelli (Università di Roma Tre)

Modelling Contracts and Workflows for Verification and Enactment

The work presented in this thesis concerns some aspects related to the Modelling of Contracts and Workflows for Verification and Enactment. We have sought to gain some insight into the nature of contracts and workflows. in order that we may model them. primarily, for the purposes of verifying certain properties and for enacting them. Workflows help coordinate the enactment of business processes. A notable aspect of workflow technologies is the lack of formal semantics for workflow models. In this thesis, we consider the characterisation of workflow using a number of formal tools, viz. Milner's CCS, Cleaveland et ai's Prioritised CCS (which we abbreviate to PCCS) and the Situation Calculus (thanks mainly to Reiter), which is based on First-Order Logic. Using these, we provide formalisations of production workflows, which are somewhat rigid, inflexible structures, akin to production lines. We do so, in order that we may fiJo: their operational meaning for the purposes of verification and enactment. We define the Liesbet meta-model for production workflow to provide a reference ontology for the task of formalisation. We have also implemented a framework for the verification and enactment of Liesbet workflow models. Regarding verification, we are particularly interested in the key property of soundness, which is concerned with an absence of locking and redundant tasks in a workflow model. Our framework is capable of verifying this property of workflow models, as well as arbitrary temporally-extended constraints', which are constraints whose satisfaction is determined over successive states of enactment of a model. We also consider the definition of more flexible workflows, including collaborative workflows, using an approach that we have conceived called Institutional Workflow Modelling (IWM). The essence of IWM lies (in part) in the identification that the structure of a workflow model necessarily entails the existence of counts as relations. These relations prescribe how the occurrence of certain actions, in the context of a particular workflow model. count as the occurrence of other actions. We have also been interested in the modelling of contracts; and have found IWM to be useful as a foundational basis for contract modelling. ????????? Another fu.ndamental aspect of our IWM-based approach is a correspondence, which we have identified, between counts as relations and methods in Hierarchical Task Network (HTN)-based planning. Thus, we are able to advocate the use of an HTN-based planning framework for the verification of flexible workflows and contracts. We have implemented such a framework, whose planner is called Theodore. We define a sjmilar notion of soundness for flexible workflows and contracts, which the Theodore-based framework is able to verify, along with arbitrary temporallyextended constraints.Imperial Users onl