摘要： 提出一种IOQ模型及在该模型下求解构成复杂服务的各个子服务的算法，将该类服务组合问题转化为简单问题，即在满足QoS约束的服务集合中，已知服务的输入集合和输出集合，利用输出集合倒序查找各子服务及其输入集合。针对该类服务组合问题，给出算法模型及求解问题算法的伪代码。

关键词: Web服务, 原子服务, 服务组合

Abstract: This paper presents an IOQ model and the algorithm for a complex services from the various element services. The composition of such services is transformed into more simple question, which is reverse inquiry of element service and services discovery of input set from the input set and output set of known services, in the services set of meeting the quality of service constraints. Algorithm model and pseudo-code of the services composition are proposed which aims at the services composition.

Key words: Web service, element service, service composition

中图分类号: 

• TP393