组织间逻辑工作流网络的合理性验证与分析

Wei Liu, Yuyue Du, Haichun Sun, Chun Yan
{"title":"组织间逻辑工作流网络的合理性验证与分析","authors":"Wei Liu, Yuyue Du, Haichun Sun, Chun Yan","doi":"10.1109/ETCS.2010.466","DOIUrl":null,"url":null,"abstract":"Soundness is a vital property of Interorganizational Logical Workflow Nets (ILWN) which can efficiently model cooperative systems. But even though each logical workflow net(LWN) is sound, soundness of arbitrary ILWN is hard to decide. This study analyzes the causes of leading to deadlocks of interface transitions and unboundedness of interface data places: the incorrect order of transitions related to interface data places, conditional routing construct and accumulation of tokens in interface data places. Based on the analysis, this paper defines the concept of T-fair LWNs and proposes an important subclass of ILWNs: T-fair ILWNs. For T-fair ILWNs, this study presents the inheritable conditions of soundness and gives a rigorous analysis approach according to their static net structures only. And then an approach of verifying the soundness of ILWNs composed of n T-fair LWNs is proposed. The concepts and techniques proposed in this study are illustrated with a useful example: an online bookstore and customer system. In addition, This paper discusses some cases which have fewer requirements for interface data. Based on that, a rather simple criteria condition is provided for T-fair ILWNs which are marked by restricted logical expressions.","PeriodicalId":193276,"journal":{"name":"2010 Second International Workshop on Education Technology and Computer Science","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Soundness Verification and Analysis of Interorganizational Logical Workflow Nets\",\"authors\":\"Wei Liu, Yuyue Du, Haichun Sun, Chun Yan\",\"doi\":\"10.1109/ETCS.2010.466\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Soundness is a vital property of Interorganizational Logical Workflow Nets (ILWN) which can efficiently model cooperative systems. But even though each logical workflow net(LWN) is sound, soundness of arbitrary ILWN is hard to decide. This study analyzes the causes of leading to deadlocks of interface transitions and unboundedness of interface data places: the incorrect order of transitions related to interface data places, conditional routing construct and accumulation of tokens in interface data places. Based on the analysis, this paper defines the concept of T-fair LWNs and proposes an important subclass of ILWNs: T-fair ILWNs. For T-fair ILWNs, this study presents the inheritable conditions of soundness and gives a rigorous analysis approach according to their static net structures only. And then an approach of verifying the soundness of ILWNs composed of n T-fair LWNs is proposed. The concepts and techniques proposed in this study are illustrated with a useful example: an online bookstore and customer system. In addition, This paper discusses some cases which have fewer requirements for interface data. Based on that, a rather simple criteria condition is provided for T-fair ILWNs which are marked by restricted logical expressions.\",\"PeriodicalId\":193276,\"journal\":{\"name\":\"2010 Second International Workshop on Education Technology and Computer Science\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-03-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International Workshop on Education Technology and Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ETCS.2010.466\",\"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 Second International Workshop on Education Technology and Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ETCS.2010.466","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

健全性是组织间逻辑工作流网络(ILWN)的一个重要特性,它能有效地对协作系统进行建模。但是,即使每个逻辑工作流网络(LWN)都是健全的,但任意逻辑工作流网络的健全性很难确定。本研究分析了导致接口转换死锁和接口数据位置无边界的原因:与接口数据位置相关的转换顺序不正确、条件路由构造和接口数据位置中令牌的积累。在此基础上,本文定义了t -公平LWNs的概念,并提出了ILWNs的一个重要子类:t -公平LWNs。对于T-fair型ILWNs,本文提出了稳健性的可遗传条件,并仅根据其静态网络结构给出了严格的分析方法。然后提出了一种验证由n个T-fair LWNs组成的ILWNs的可靠性的方法。本研究中提出的概念和技术以一个有用的例子来说明:一个在线书店和客户系统。此外,本文还讨论了一些对接口数据要求较低的情况。在此基础上,对用受限逻辑表达式标记的T-fair ILWNs提供了一个相当简单的准则条件。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Soundness Verification and Analysis of Interorganizational Logical Workflow Nets
Soundness is a vital property of Interorganizational Logical Workflow Nets (ILWN) which can efficiently model cooperative systems. But even though each logical workflow net(LWN) is sound, soundness of arbitrary ILWN is hard to decide. This study analyzes the causes of leading to deadlocks of interface transitions and unboundedness of interface data places: the incorrect order of transitions related to interface data places, conditional routing construct and accumulation of tokens in interface data places. Based on the analysis, this paper defines the concept of T-fair LWNs and proposes an important subclass of ILWNs: T-fair ILWNs. For T-fair ILWNs, this study presents the inheritable conditions of soundness and gives a rigorous analysis approach according to their static net structures only. And then an approach of verifying the soundness of ILWNs composed of n T-fair LWNs is proposed. The concepts and techniques proposed in this study are illustrated with a useful example: an online bookstore and customer system. In addition, This paper discusses some cases which have fewer requirements for interface data. Based on that, a rather simple criteria condition is provided for T-fair ILWNs which are marked by restricted logical expressions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信