A graph-based approach to web services composition

被引：46

作者：

Hashemian, SV ^{[1
]}

Mavaddat, F ^{[1
]}

机构：

[1] Univ Waterloo, Sch Comp Sci, Waterloo, ON N2L 3G1, Canada

来源：

2005 SYMPOSIUM ON APPLICATIONS AND THE INTERNET, PROCEEDINGS | 2005年

关键词：

D O I：

10.1109/SAINT.2005.4

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Automatic composition of web services has drawn a great deal of attention recently. By composition, we mean taking advantage of currently existing web services to provide a new service that does not exist on its own. Therefore, in order to have a more complex service, we can use some semantically related simpler web services and execute them in such a way that the whole set provides the desired service. There are web service specification languages that specify semantic properties of web services. These languages are helpful in searching for those web services that can participate in a composition. This work is aimed at searching among web services in order to find those whose composition provides a specific behavior. Those web services found after this search are incrementally composed together to build a new service that realizes that behavior. Our technique takes advantage of graph structures and also a particular formalism called interface automata.

引用

页码：183 / 189

页数：7