上下文无关的服务替换的行为兼容性分析

Jun Jin, Jingjing Hu, Yuanda Cao, Jingxia Wang
{"title":"上下文无关的服务替换的行为兼容性分析","authors":"Jun Jin, Jingjing Hu, Yuanda Cao, Jingxia Wang","doi":"10.1109/ChinaGrid.2012.33","DOIUrl":null,"url":null,"abstract":"Service composition and substitution are major research fields in Service Oriented Computing (SOC). Behavioral compatibility is very important. This paper proposes a context-dependent behavioral substitutability analysis approach. Web service processes are modeled by Petri nets. By analyzing the partial orders of transitions for the substituted service, several algorithms are given for temporal constraints generation. And this paper proves that if new services satisfy the temporal constraints, the new composite service must be sound and deadlock-free. To explain the algorithms clearly, a detailed example is shown. The results and algorithms can be used to improve the existing methods of service substitution verification.","PeriodicalId":371382,"journal":{"name":"2012 Seventh ChinaGrid Annual Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Behavioral Compatibility Analysis for Context-independent Service Substitution\",\"authors\":\"Jun Jin, Jingjing Hu, Yuanda Cao, Jingxia Wang\",\"doi\":\"10.1109/ChinaGrid.2012.33\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Service composition and substitution are major research fields in Service Oriented Computing (SOC). Behavioral compatibility is very important. This paper proposes a context-dependent behavioral substitutability analysis approach. Web service processes are modeled by Petri nets. By analyzing the partial orders of transitions for the substituted service, several algorithms are given for temporal constraints generation. And this paper proves that if new services satisfy the temporal constraints, the new composite service must be sound and deadlock-free. To explain the algorithms clearly, a detailed example is shown. The results and algorithms can be used to improve the existing methods of service substitution verification.\",\"PeriodicalId\":371382,\"journal\":{\"name\":\"2012 Seventh ChinaGrid Annual Conference\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Seventh ChinaGrid Annual Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ChinaGrid.2012.33\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Seventh ChinaGrid Annual Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ChinaGrid.2012.33","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

服务组合与替代是面向服务计算(SOC)的主要研究领域。行为兼容性是非常重要的。本文提出了一种情境相关的行为可替代性分析方法。Web服务流程由Petri网建模。通过对替代服务转换的偏序分析,给出了几种生成时间约束的算法。并证明了如果新服务满足时间约束,则新组合服务必须是健全的、无死锁的。为了清楚地解释算法,给出了一个详细的例子。研究结果和算法可用于改进现有的服务替代验证方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Behavioral Compatibility Analysis for Context-independent Service Substitution
Service composition and substitution are major research fields in Service Oriented Computing (SOC). Behavioral compatibility is very important. This paper proposes a context-dependent behavioral substitutability analysis approach. Web service processes are modeled by Petri nets. By analyzing the partial orders of transitions for the substituted service, several algorithms are given for temporal constraints generation. And this paper proves that if new services satisfy the temporal constraints, the new composite service must be sound and deadlock-free. To explain the algorithms clearly, a detailed example is shown. The results and algorithms can be used to improve the existing methods of service substitution verification.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信