Complexity Analysis for Petri Net-Based Business Process in Web Service Composition
Complexity Analysis for Petri Net-Based Business Process in Web Service Composition
复制标题
DOI：
10.1109/sose.2010.24
复制
发表时间：
2010-06
期刊：
影响因子：
--
通讯作者：
Chengying Mao
中科院分区：
文献类型：
--
作者：
Chengying Mao
Web服务技术提供了一种将网络上分布的服务单元集成到一个协调的系统中的方法。与传统的企业应用集成（EAI）技术相比，它为数据交换和应用调用提供了更好的互操作性。因此，它已被广泛用于构建分布式应用程序。由于Web服务单元的代码不可见性和分布式执行，如何精确度量Web服务组合的控制复杂度是一个非常困难的任务。本文主要研究Web服务组合中基于Petri网的业务流程复杂性度量问题。通过分析工作流中WSC的执行逻辑和依赖关系，提出了两个度量集。第一种是基于计数的度量集，包括库位数、平均转移度、每服务转移数和圈复杂度等七个度量。第二种是基于执行路径的度量集，其中典型的是平均执行路径复杂度（AEPC）。此外，我们的度量集的可用性和有效性已被验证的一个真实世界的Web服务组合。
Web services technology provides a way to integrate some distributed service units over the network into a coordinative system. Compared with the traditional enterprise application integration (EAI) techniques, it provides better interoperability for data exchange and application invocation. Therefore, it has been widely adopted for constructing distributed applications. Due to code invisibility and distributed execution of Web service unit, how to precisely measure the control complexity of Web service composition (WSC) is a very difficult task. In the paper, we mainly concern on the complexity measurement of Petri net-based business process in Web service composition. Two metric sets are presented through analyzing the WSC’s execution logics and dependency relations in workflow. The first one is count-based metric set, and includes seven metrics such as number of place, average degree of transition, transfer number per service and cyclomatic complexity. The second is an execution path-based metric set, in which the typical one is average execution path complexity (AEPC). In addition, The usability and effectiveness of our metric sets have been validated by a real-world Web service composition.