The Community for Technology Leaders
2010 Asia-Pacific Services Computing Conference (APSCC 2010) (2010)
Hangzhou
Dec. 6, 2010 to Dec. 10, 2010
ISBN: 978-1-4244-9396-8
pp: 237-244
ABSTRACT
Constructing Web service workflow faces huge challenges in the volatile, heterogeneous, distributed environment: it is necessary to consider the dynamic changes in web services, but also take into account the rapid method of modeling workflow. Comparing workflow modeling and artificial intelligence planning process, if the Web service as a planned action (or activity), then the modern AI planning and workflow modeling to integrate, so we can use AI planning technology to solve the distributed workflow modeling. This paper presents a distributed service workflow model based on user demand (DSWMoUD), which is composed of the web services organizations model, the business concept model, business logic model, user demand model, business scheduling model and business enactment model. In order to improve the retrieval efficiency of distributed service, our proposed distributed service organizations model made up of web service registration system(WSRS) and web service spanning tree (WSST), and we give a building algorithm for WSST and a business logic spanning graph algorithm. Introducing the artificial intelligence planning techniques into the distributed workflow modeling, we implement the prototype system, which is Self-Adaptive Web Contractual Computing Management System (SAWCM). Property analysis of the new model is also made, which leads to the conclusion that the DSWMoUD may be applied as an optimized approach towards efficient and effective distributed service workflow modeling.
INDEX TERMS
planning (artificial intelligence), user interfaces, Web services, workflow management software
CITATION

M. Yu, L. Jiang, L. Ye and R. Liang, "A Distributed Workflow Modeling Method Based on Users' Demand," 2010 Asia-Pacific Services Computing Conference (APSCC 2010)(APSCC), Hangzhou, 2011, pp. 237-244.
doi:10.1109/APSCC.2010.13
95 ms
(Ver 3.3 (11022016))