文章基本信息

标题：Modeling Web Services Composition with Constraints
本地全文：下载
作者：Eric Monfroy ; Olivier Perrin ; Christophe Ringeissen 等
期刊名称：Revista Avances en Sistemas e Informática
印刷版ISSN：1657-7663
电子版ISSN：1909-0056
出版年度：2008
卷号：5
期号：1
页码：173-179
语种：English
出版社：Universidad Nacional de Colombia
摘要：In this paper we consider the composition problem of Web ser vices. Our fr amewor k is based on the existence of an abstract composition, i.e, the way some services of different types can be combined together in order to achieve a given task. Our approach consists in instantiating this abstract representation of a composite Web service by selecting the most appropriate concrete Web ser vices. T his instantiation is based on constraint programming techniques which allow us to match the Web services according to a given query. The composition is bu ilt in an incremental way propagating some constraints attached to Web ser vices. Then, the instantiation can be dynamically updated d ur in g execu tion via a monitor in g p h ase. O ur a pp r oa ch is illustr ated on a Web omposition descr ibing the behavior of a photolab portal. On this example, we use constraint techniques to dynamically manage and compute the estimated execution times (a n n ou n ced b y ser vices) to fulfill a n d a ch ieve on time th e r equested tasks.
其他摘要：In this paper we consider the composition problem of Web ser vices. Our fr amewor k is based on the existence of an abstract composition, i.e, the way some services of different types can be combined together in order to achieve a given task. Our approach consists in instantiating this abstract representation of a composite Web service by selecting the most appropriate concrete Web ser vices. T his instantiation is based on constraint programming techniques which allow us to match the Web services according to a given query. The composition is bu ilt in an incremental way propagating some constraints attached to Web ser vices. Then, the instantiation can be dynamically updated d ur in g execu tion via a monitor in g p h ase. O ur a pp r oa ch is illustr ated on a Web omposition descr ibing the behavior of a photolab portal. On this example, we use constraint techniques to dynamically manage and compute the estimated execution times (a n n ou n ced b y ser vices) to fulfill a n d a ch ieve on time th e r equested tasks.
关键词：Web Ser vices; Composition Problem; Constr aint Reasoning . Servicios Web; Problema de la Composición; Razonamiento con Verificación de Restricciones.