Efficient constraint verification in service composition design and execution

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Most methods that have been proposed to solve the problem of web service composition only consider input and output parameters of services in order to solve the composition problem. However, there are other factors that affect composition and execution of composite services such as constraints. Constraints can be used to express customer requirements on services features. Additionally, most real-world web services have constraints that specify their limitations and use restrictions. Constraint verification has significant impact on composition and execution of composite services. In particular, run time verification of service constraints can result in the failure of the execution of composite services and eventually waste computational resources. Such failures can not always be predicted as the verification of some services depends on execution effects of other services inside a composite plan. In this paper, we focus on verification of constraints during the composition and execution of composite services.

Cite

CITATION STYLE

APA

Laleh, T., Paquet, J., Mokhov, S. A., & Yan, Y. (2016). Efficient constraint verification in service composition design and execution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10033 LNCS, pp. 445–455). Springer Verlag. https://doi.org/10.1007/978-3-319-48472-3_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free