A declarative language to support dynamic evolution of web service business protocols

2016 ◽  
Vol 11 (2) ◽  
pp. 163-181
Author(s):  
Ali Khebizi ◽  
Hassina Seridi-Bouchelaghem ◽  
Bouallem Benatallah ◽  
Farouk Toumani
Keyword(s):  
Web Service ◽  
Dynamic Evolution ◽  
Declarative Language ◽  
Service Business ◽  
Business Protocols

Supporting the dynamic evolution of Web service protocols in service-oriented architectures

2008 ◽  
Vol 2 (2) ◽  
pp. 1-46 ◽  
Author(s):  
Seung Hwan Ryu ◽  
Fabio Casati ◽  
Halvard Skogsrud ◽  
Boualem Benatallah ◽  
Régis Saint-Paul
Keyword(s):  
Web Service ◽  
Dynamic Evolution ◽  
Service Oriented Architectures ◽  
Service Oriented

Web service business transformation: collaborative commerce opportunities in SMEs

2004 ◽  
Vol 17 (5) ◽  
pp. 372-381 ◽  
Author(s):  
Richard Vidgen ◽  
Diane Francis ◽  
Philip Powell ◽  
Maria Woerndl
Keyword(s):  
Web Service ◽  
Collaborative Commerce ◽  
Business Transformation ◽  
Service Business

Decidability and Complexity of Web Service Business Protocol Synthesis

2016 ◽  
Vol 25 (03) ◽  
pp. 1650008
Author(s):  
L. Nourine ◽  
R. Ragab ◽  
F. Toumani
Keyword(s):  
Web Service ◽  
A Priori ◽  
Research Work ◽  
Synthesis Problem ◽  
Complexity Bounds ◽  
Formal Framework ◽  
Finite State ◽  
Fundamental Research ◽  
Decidability And Complexity ◽  
Business Protocols

Automatic synthesis of web services business protocols (BPs) aims at solving algorithmically the problem of deriving a mediator that realizes a BP of a target service using a set of specifications of available services. This problem, and its variants, gave rise to a large number of fundamental research work over the last decade. However, existing works considered this problem under the restriction that the number of instances of an available service that can be involved in a composition is bounded by a constant [Formula: see text] which is fixed a priori. This paper investigates the unbounded variant of this problem using a formal framework in which web service BPs are described by means of finite state machines (FSM). We show that in this context, the protocol synthesis problem can be reduced to that of testing simulation preorder between an FSM and an (infinitely) iterated product of FSMs. Existing results regarding close decision problems in the context of the so-called shuffle languages are rather negative and cannot be directly exploited in our context. In this paper, we develop a novel technique to prove the decidability of testing simulation in our case of interest. We provide complexity bounds for the general protocol synthesis problem and identify two cases of particular interest, namely loop-free target services and hybrid states-free component services, for which protocol synthesis is shown to be respectively NP-COMPETE and EXPTIME-COMPLETE.

From Implicit to Explicit Transitions in Business Protocols

2012 ◽  
Vol 9 (4) ◽  
pp. 69-95 ◽  
Author(s):  
Emad Elabd ◽  
Emmanuel Coquery ◽  
Mohand-Said Hacid
Keyword(s):  
Web Services ◽  
Web Service ◽  
Timed Automata ◽  
Automated Analysis ◽  
Time Constraints ◽  
Major Step ◽  
Modeling Tools ◽  
Business Protocols

Modeling Web services is a major step towards their automated analysis. One of the important parameters in this modeling, for the majority of Web services, is the time. A Web service can be presented by its behavior which can be described by a business protocol representing the possible sequences of message exchanges. To the best of the authors’ knowledge, automated analysis of timed Web services (e.g., compatibility and replaceability checking) is very difficult and in some cases it is not possible with the presence of implicit transitions (internal transitions) based on time constraints. The semantics of the implicit transitions is the source of this difficulty because most of well-known modeling tools do not express this semantics (e.g., epsilon transition on the timed automata has a different semantics). This paper presents an approach for converting any protocol containing implicit transitions to an equivalent one without implicit transitions before performing analysis.

Web Service Business Context

2004 ◽  
Vol 1 (2) ◽  
pp. 16-36 ◽  
Author(s):  
Olivera Marjanovic
Keyword(s):  
Web Service ◽  
Business Context ◽  
Service Business
Sign in / Sign up

Export Citation Format

Share Document