AHWCI: A Prototype Tool for Identifying High-Level Workflow Changes

Fangfei Chen, Wei Song, Chengzhen Zhang, Xuansong Li, Pengcheng Zhang
{"title":"AHWCI: A Prototype Tool for Identifying High-Level Workflow Changes","authors":"Fangfei Chen, Wei Song, Chengzhen Zhang, Xuansong Li, Pengcheng Zhang","doi":"10.1109/APSECW.2017.20","DOIUrl":null,"url":null,"abstract":"Identifying a minimum sequence of high-level workflowchanges is required in many application scenarios suchas workflow retrieval, comparison, and merging, etc. However, this problem has been proved to be NP-hard. In this paper, we utilize an A* like algorithm and a set of pruning rules to address this problem. The performance evaluation demonstrates the advantages of our approach over the state-of-the-art approach.","PeriodicalId":172357,"journal":{"name":"2017 24th Asia-Pacific Software Engineering Conference Workshops (APSECW)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 24th Asia-Pacific Software Engineering Conference Workshops (APSECW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APSECW.2017.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Identifying a minimum sequence of high-level workflowchanges is required in many application scenarios suchas workflow retrieval, comparison, and merging, etc. However, this problem has been proved to be NP-hard. In this paper, we utilize an A* like algorithm and a set of pruning rules to address this problem. The performance evaluation demonstrates the advantages of our approach over the state-of-the-art approach.
AHWCI:用于识别高级工作流变更的原型工具
在许多应用程序场景中,例如工作流检索、比较和合并等,都需要确定高级工作流更改的最小序列。然而,这个问题已被证明是np困难的。在本文中,我们利用一个类A*算法和一组剪枝规则来解决这个问题。性能评估证明了我们的方法优于最先进的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信