Algebraic Structure of Web Services

Höfner, P.; Lautenbacher, Florian

doi:10.1016/j.entcs.2008.04.099

Cited by 10 publications

(5 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using relation algebra, tests and iterations offer the possibility of an automatic composition of Web services based on a specified goal. However, the syntax, and semantics used in 10 do not seem intuitive for modeling and verification process.…”

Section: Related Workmentioning

confidence: 97%

“…In order to satisfy such requirements, we propose a Web service algebra that can model and verify Web services in a much more efficient manner. Though researchers have proposed several algebras focused on Web services 8,9,10 , these do not give emphasis on recursive nature of service composition and also do not explore on the verification aspect of composition. Therefore, we emphasize that a Web services algebra should have its own basic computational model on recursive composition where interaction must be one of the basic activities (primitive notions) of the model.…”

Section: Introductionmentioning

confidence: 98%

See 1 more Smart Citation

Algebraic Modeling and Verification of Web Service Composition

Gopal¹,

Gangadharan²,

Padmanabhan³

2015

Procedia Computer Science

View full text Add to dashboard Cite

In order to provide a rigorous and sound foundation for formal reasoning about Web services, algebraic modeling is one of the important techniques used as is witnessed from the Web service literature. However, the algebraic modeling approach for Web services (Web service algebra) is still in its infancy. To further facilitate the algebraic modeling of Web services, in this paper, we propose a composition algebra based on the notion of recursive composition. The proposed algebra is fully capable to verify the presence of behavioral equivalences and deadlock conditions in a Web service composition scenario. The main motivation for proposing Web service composition algebra is to capture the recursive nature of composition which cannot be done using traditional approaches like model checking and Petri net.

show abstract

Section: Related Workmentioning

confidence: 97%

Section: Introductionmentioning

confidence: 98%

Algebraic Modeling and Verification of Web Service Composition

Gopal¹,

Gangadharan²,

Padmanabhan³

2015

Procedia Computer Science

View full text Add to dashboard Cite

show abstract

“…Various flavors of Web service algebras [18], [17], [30], [31], [32] are available in the literature. The RCA differs from these algebras in consideration of recursive composition and its applicability to the well-known problem of Web service interaction verification.…”

Section: Compositionmentioning

confidence: 99%

Web Service Interaction Modeling and Verification Using Recursive Composition Algebra

Gopal¹,

Gangadharan

Padmanabhan

et al. 2018

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

The design principle of composability among Web services is one of the most crucial reasons for the success and popularity of Web services. However, achieving error-free automatic Web service composition is still a challenge. In this paper, we propose a recursive composition based modeling and verification technique for Web service interaction. The application of recursive composition over a Web service with respect to a given set of Web services yields a recursive composition interaction graph (RCIG). In order to capture the requirement specifications of a Web service interaction scenario, we propose recursive composition specification language (RCSL) as a requirement specification language. Further, we employ the proposed RCIG as an interpretation model to interpret the semantics of a RCSL formula. Our verification technique is based on the generation and analysis of all possible interaction patterns. Performance evaluation results, provided in this paper, show that our proposition is implementable for the real world applications. The key advantages of the proposed approach are: (i) it does not require explicit system modeling as in model checking based approaches, (ii) it captures primitive characteristics of Web service interaction patterns, such as recursive composition, sequential and parallel flow, etc, and (iii) it supports automatic composition of services.

show abstract

“…Table 4 presents the time consumption (measured in seconds) in the process of WSCGs generation for the three absolute composition requests shown in Figure 17, 18, and 19. [25][26][27][28][29] We investigated these algebras and found that they are capturing the various composition notions such as sequential, parallel, and choice, but our proposed algebra (RCA) differs from these algebras in the consideration The composition request graph, used in this paper, is inspired from the workflow modeling language Yet Another Workflow Language (YAWL). Based on the data provided in the Table 4 Various flavors of Web service algebras are available in the literature.…”

Section: Scalabilitymentioning

confidence: 99%

“…Various flavors of Web service algebras are available in the literature. () We investigated these algebras and found that they are capturing the various composition notions such as sequential, parallel, and choice, but our proposed algebra (RCA) differs from these algebras in the consideration of recursive composition. Given a service, message, or service‐message tuple, the RCA generates a recursive composition graph automatically, which captures all the possible dependencies among services in order to realize the input.…”

Section: Related Workmentioning

confidence: 99%

Verifying compositional equivalence between web service composition graphs

Gopal

Gangadharan

2018

Concurrency and Computation

View full text Add to dashboard Cite

Given a composition request, the formation of possible Web Service Composition Graphs (WSCGs) depends on the set of available services. Since the availability of Web services is dynamic, at any time, a new service can join or an existing service can leave the set of available services. A change in the set may bring the structural change in a previously formed WSCG. However, it is not always the case that a structural change in the WSCG brings the semantic change. In this paper, our aim is to verify the compositional equivalence between two WSCGs formed before and after the structural change caused by the change in the set of available services. Our proposed solution is based on an algebraic formalism, and by using the formalism, directed acyclic WSCGs are formed for a given composition request. Then, by using WSCGs, we propose the concept of composition expression and canonical composition expression. On the basis of the proposed concept of canonical composition expression, we verify compositional equivalence between two WSCGs. The advantage of our approach is that it reduces the equivalence verification to the subsumption checking between two algebraic expressions instead of directly using the WSCGs and solving a subgraph matching problem. The proposed mechanism is implemented and evaluated for the exhaustive possibilities in a travel agency case study with respect to a given composition request. INTRODUCTIONService-oriented computing is a well-established computing paradigm developed over time and still passing through phases of technological refinements day by day. Nowadays, automatic and dynamic Web service composition is in focus of the service-oriented computing research. 1,2 As far as automatic and dynamic service composition is concerned, the dynamic reconfiguration of services is a key factor worth considering because the availability of candidate Web services cannot be specified before the runtime. Thus, the dynamic availability of services greatly affects the formation of a composition plan (made for a composition request). In this paper, our focus is on the graphical composition plans (say, Web service composition graph).In general, by means of a Web Service Composition Graph (WSCG), we refer to the graphical representation of how a set of Web services compose with each other in order to realize a composition request (composition request is formally defined in the Section 4). A WSCG depends on the set of available services. Therefore, a change in the set may bring the structural change in the previously formed WSCG. However, this is not always the case that a structural change in the WSCG brings the semantic change. For an illustration of the problem of compositional equivalence between two WSCGs, let us consider three services TA1, TA2, and HB1, where TA1 and TA2 are composite services and HB1 is a basic service. The all three services accept request for hotel booking. Suppose a user requests TA1 for the hotel booking (written as ⟨TA1, H_Book⟩). Since TA1 is a composite service, it has to take the he...

show abstract

Algebraic Structure of Web Services

Cited by 10 publications

References 8 publications

Algebraic Modeling and Verification of Web Service Composition

Algebraic Modeling and Verification of Web Service Composition

Web Service Interaction Modeling and Verification Using Recursive Composition Algebra

Verifying compositional equivalence between web service composition graphs

Contact Info

Product

Resources

About