Predicting and Learning Executability of Composite Web Services

Authors:
Masahiro Tanaka;Toru Ishida
Affiliations:
Department of Social Informatics, Kyoto University, Kyoto, Japan 606-8501;Department of Social Informatics, Kyoto University, Kyoto, Japan 606-8501
Venue:
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
Year:
2008

Citing 6
Cited 0

Simulation, verification and automated composition of web services

Proceedings of the 11th international conference on World Wide Web
An overview of CAFE specification environment-an algebraic approach for creating, verifying, and maintaining formal specifications over networks

ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
Analysis of interacting BPEL web services

Proceedings of the 13th international conference on World Wide Web
Language Grid: An Infrastructure for Intercultural Collaboration

SAINT '06 Proceedings of the International Symposium on Applications on Internet
Query-driven constraint acquisition

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Towards a formal verification of OWL-S process models

ISWC'05 Proceedings of the 4th international conference on The Semantic Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

Configuring a composite Web service by setting endpoints reduces the cost of development, but raises the probability of a request message triggering runtime execution failures. Previous works on validation of composite Web services are not useful because the application developer cannot modify atomic/composite services and the specifications needed for validation are not always available. Therefore, in this paper, we address two issues: predicting the executability of composite Web services for each request message, and acquiring input specifications to improve the prediction. To resolve these issues, we model atomic/composite services in a formal specification. Moreover, we apply constraint acquisition algorithm to acquire input specifications of atomic Web services. We conduct an experiment in which the proposed method is applied to a composite Web service in practical use. The result shows that our method can detect almost all messages that will trigger execution failure at a rather early stage of specification acquisition.