Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

A Graph-based Automatic Services Composition based on Cost Estimation Heuristic

Published

Author(s)

Boonserm Kulvatunyou, Yunsu Lee, Minchul Lee, Yun Peng, Nenad Ivezic

Abstract

Currently, software and hardware are being virtualized and offered as services on the internet. Companies have an opportunity to improve their workflow by composing these services that best suitable their requirements from both quality and cost objectives. However, as more services become available computer-aided services discovery and composition become essential. Traditional service representation and planning algorithms still have gaps to be filled, particularly related to consideration of non-functional characteristics, large number of similar operators (i.e., services), and limited number of objects (i.e., inputs and outputs per service). This paper analyzes existing works in automatic services composition, service representation and planning algorithm and proposes a new framework to fill those gaps. It proofs that the proposed framework provides an admissible heuristic based on cost estimation that guarantee a minimum cost solution, if one exists.
Citation
International Journal of Services Operations and Informatics

Keywords

automatic services composition, graph-based planning, smart manufacturing, service representation, function representation, AND/OR graph search

Citation

Kulvatunyou, B. , Lee, Y. , Lee, M. , Peng, Y. and Ivezic, N. (2019), A Graph-based Automatic Services Composition based on Cost Estimation Heuristic, International Journal of Services Operations and Informatics, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=927764 (Accessed October 26, 2021)
Created October 31, 2019, Updated September 24, 2019