A Logical Reasoning Approach to Automatic Composition of Stateless Components
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Automated generation of composite web services based on functional semantics
Web Semantics: Science, Services and Agents on the World Wide Web
Automatic composition of stateless components: a logical reasoning approach
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
A Bidirectional Heuristic Search for web service composition with costs
International Journal of Web and Grid Services
A refined service relationships graph generation algorithm for web services composition
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 3
A bidirectional heuristic search technique for web service composition
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV
Service Oriented Computing and Applications
QoS-aware automatic service composition: a graph view
Journal of Computer Science and Technology - Special issue on Community Analysis and Information Recommendation
A Logical Reasoning Approach to Automatic Composition of Stateless Components
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
An Optimal and Complete Algorithm for Automatic Web Service Composition
International Journal of Web Services Research
| Hi-index | 0.00 |
During the past few years, web services composition has been one of the ongoing research activities in the software engineering area. It is simply defined as finding a composition of available web services that provides a requested behavior. In this paper, we study this problem for stateless web services; i.e. web services with a two-step workflow: receiving some inputs and returning some outputs as the result. Using a graph model we represent the behavior of available web services in terms of their input-output information, as well as semantic information about the web data. We also introduce a process algebra to specify the behavior of composite web services based on the behavior of simpler ones. Using the graph and the process algebra, we explain how to find useful web services for a request and how to compose them to obtain the expected behavior. We discuss the complexity of this approach and show that although it is a naturally complex process, by applying some simplifications, a reasonable overall complexity can be achieved.