{"title":"同步与异步通信中进程组合的最佳适配器创建","authors":"Zhe Shan, Akhil Kumar","doi":"10.1145/2229156.2229160","DOIUrl":null,"url":null,"abstract":"A key issue in process-aware e-commerce collaboration is to orchestrate business processes of multiple business partners throughout a supply chain network in an automated and seamless way. Since each partner has its own internal processes with different control flow structures and message interfaces, the real challenge lies in verifying the correctness of process collaboration, and reconciling conflicts in an automated manner to make collaboration successful. The purpose of business process adaptation is to mediate the communication between independent processes to overcome their mismatches and incompatibilities. The goal of this article is to develop and compare efficient approaches of optimal adapter (i.e. one that minimizes the number of messages to be adapted) creation for multiple interacting processes under both synchronous and asynchronous communication. We start with an analysis of interactions of each message pair, and show how to identify incompatible cases and their adaptation elements for both types of communication. Then, we show how to extend this analysis into more general cases involving M messages and N processes (M, N > 2). Further, we present optimal adapter creation algorithms for both scenarios based on our analysis technique. The algorithms were implemented in a Java-based prototype system, and results of two experiments are reported. We compare and discuss the insights gained about adapter creation in these two scenarios.","PeriodicalId":178565,"journal":{"name":"ACM Trans. Manag. Inf. Syst.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Optimal Adapter Creation for Process Composition in Synchronous vs. Asynchronous Communication\",\"authors\":\"Zhe Shan, Akhil Kumar\",\"doi\":\"10.1145/2229156.2229160\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A key issue in process-aware e-commerce collaboration is to orchestrate business processes of multiple business partners throughout a supply chain network in an automated and seamless way. Since each partner has its own internal processes with different control flow structures and message interfaces, the real challenge lies in verifying the correctness of process collaboration, and reconciling conflicts in an automated manner to make collaboration successful. The purpose of business process adaptation is to mediate the communication between independent processes to overcome their mismatches and incompatibilities. The goal of this article is to develop and compare efficient approaches of optimal adapter (i.e. one that minimizes the number of messages to be adapted) creation for multiple interacting processes under both synchronous and asynchronous communication. We start with an analysis of interactions of each message pair, and show how to identify incompatible cases and their adaptation elements for both types of communication. Then, we show how to extend this analysis into more general cases involving M messages and N processes (M, N > 2). Further, we present optimal adapter creation algorithms for both scenarios based on our analysis technique. The algorithms were implemented in a Java-based prototype system, and results of two experiments are reported. We compare and discuss the insights gained about adapter creation in these two scenarios.\",\"PeriodicalId\":178565,\"journal\":{\"name\":\"ACM Trans. Manag. Inf. Syst.\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Trans. Manag. Inf. Syst.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2229156.2229160\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Trans. Manag. Inf. Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2229156.2229160","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
摘要
流程感知电子商务协作中的一个关键问题是以自动化和无缝的方式在整个供应链网络中编排多个业务合作伙伴的业务流程。由于每个合作伙伴都有自己的内部流程,具有不同的控制流结构和消息接口,因此真正的挑战在于验证流程协作的正确性,并以自动化的方式协调冲突以使协作成功。业务流程适应的目的是调解独立流程之间的通信,以克服它们的不匹配和不兼容。本文的目标是开发和比较为同步和异步通信下的多个交互流程创建最佳适配器(即最小化要适应的消息数量)的有效方法。我们首先分析每个消息对的交互,并展示如何识别不兼容的情况及其对两种通信类型的适应元素。然后,我们展示了如何将此分析扩展到涉及M个消息和N个进程(M, N > 2)的更一般的情况。此外,我们基于我们的分析技术为这两种场景提供了最佳适配器创建算法。在基于java的原型系统中实现了该算法,并给出了两个实验结果。我们比较并讨论了在这两种场景中关于适配器创建的见解。
Optimal Adapter Creation for Process Composition in Synchronous vs. Asynchronous Communication
A key issue in process-aware e-commerce collaboration is to orchestrate business processes of multiple business partners throughout a supply chain network in an automated and seamless way. Since each partner has its own internal processes with different control flow structures and message interfaces, the real challenge lies in verifying the correctness of process collaboration, and reconciling conflicts in an automated manner to make collaboration successful. The purpose of business process adaptation is to mediate the communication between independent processes to overcome their mismatches and incompatibilities. The goal of this article is to develop and compare efficient approaches of optimal adapter (i.e. one that minimizes the number of messages to be adapted) creation for multiple interacting processes under both synchronous and asynchronous communication. We start with an analysis of interactions of each message pair, and show how to identify incompatible cases and their adaptation elements for both types of communication. Then, we show how to extend this analysis into more general cases involving M messages and N processes (M, N > 2). Further, we present optimal adapter creation algorithms for both scenarios based on our analysis technique. The algorithms were implemented in a Java-based prototype system, and results of two experiments are reported. We compare and discuss the insights gained about adapter creation in these two scenarios.