{"title":"基于变量依赖的BPEL流程子流程发现算法","authors":"Deng Min, Deng Na, Peng Yong, Cheng Bo","doi":"10.1109/CMC.2010.271","DOIUrl":null,"url":null,"abstract":"The Web Services Business Process Language (BPEL) is widely used in service composition and orchestration, but sometimes it is time consuming and unnecessary to construct a BPEL process from scratch. It absolutely has the need to seek a way to realize the reuse of BPEL sub-processes. This paper advances an algorithm to solve this problem based on mapping process to a multi-tree and variable dependence. At the end of this paper, a BPEL process instance proves this algorithm’s validity.","PeriodicalId":296445,"journal":{"name":"2010 International Conference on Communications and Mobile Computing","volume":"217 0 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"The Algorithm of Sub-process Discovery for BPEL Process Based on Variable Dependence\",\"authors\":\"Deng Min, Deng Na, Peng Yong, Cheng Bo\",\"doi\":\"10.1109/CMC.2010.271\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Web Services Business Process Language (BPEL) is widely used in service composition and orchestration, but sometimes it is time consuming and unnecessary to construct a BPEL process from scratch. It absolutely has the need to seek a way to realize the reuse of BPEL sub-processes. This paper advances an algorithm to solve this problem based on mapping process to a multi-tree and variable dependence. At the end of this paper, a BPEL process instance proves this algorithm’s validity.\",\"PeriodicalId\":296445,\"journal\":{\"name\":\"2010 International Conference on Communications and Mobile Computing\",\"volume\":\"217 0 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Communications and Mobile Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMC.2010.271\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Communications and Mobile Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMC.2010.271","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
摘要
Web服务业务流程语言(Web Services Business Process Language, BPEL)广泛用于服务组合和编排，但有时从头开始构建BPEL流程既耗时又不必要。它绝对需要寻找一种方法来实现BPEL子流程的重用。本文提出了一种基于多树映射过程和变量依赖的算法来解决该问题。在本文的最后，通过一个BPEL流程实例验证了该算法的有效性。
The Algorithm of Sub-process Discovery for BPEL Process Based on Variable Dependence
The Web Services Business Process Language (BPEL) is widely used in service composition and orchestration, but sometimes it is time consuming and unnecessary to construct a BPEL process from scratch. It absolutely has the need to seek a way to realize the reuse of BPEL sub-processes. This paper advances an algorithm to solve this problem based on mapping process to a multi-tree and variable dependence. At the end of this paper, a BPEL process instance proves this algorithm’s validity.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
