Search strategies for automatic web service composition

被引：14

作者：

Milanovic, Nikola ^{[1
]}

Malek, Miroslaw ^{[1
]}

机构：

[1] Humboldt Univ, D-1086 Berlin, Germany

来源：

INTERNATIONAL JOURNAL OF WEB SERVICES RESEARCH | 2006年 / 3卷 / 02期

关键词：

automatic composition; Web Services;

D O I：

10.4018/jwsr.2006040101

中图分类号：

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

学科分类号：

0812 ;

摘要：

This paper investigates architectural properties required for supporting automatic service composition. First, composable service architecture will be described, based on modeling Web Services as abstract machines supported by formally defined composition operators. Based on the proposed infrastructure, we give several options for achieving automatic service composition by treating it as a search problem. Namely, basic heuristic, probabilistic, learning-based, decomposition and bidirectional automatic composition mechanisms will be presented and compared. Finally, it discusses the impact and outlook for automatic composition.

引用

页码：1 / 32

页数：32

共 53 条

[1]

Abrial J.-R., 1996, The B-Book

[2]

Aggarwal R, 2004, P IEEE I C SERV COMP, P23

[3]

Aho A. V., 1987, COMPILERS PRINCIPLES

[4]

Andrews T., 2004, BUSINESS PROCESS EXE

[5]

ANKOLEKAR A, 2002, P 1 INT SEM WEB C, P348, DOI DOI 10.1007/3-540-48005-6_27

[6]

[Anonymous], P INT WORKSH WEB SER

[7]

[Anonymous], 2002, 8th International Conference on Principles and Knowledge Representation and Reasoning

[8]

[Anonymous], 1991, Linear Programming, DOI [10.1007/978-0-8176-4844-2, DOI 10.1007/978-0-8176-4844-2]

[9]

BALLINGER K, 2001, WEBSERVICES INSPECTI

[10]

Berardi D, 2003, LECT NOTES COMPUT SC, V2910, P43

← 1 2 3 4 5 6 →