时间工作流网络的强广义稳健性

2015 15th International Conference on Application of Concurrency to System Design Pub Date : 2015-06-21 DOI:10.1109/ACSD.2015.22

H. Boucheneb, Kamel Barkaoui

{"title":"时间工作流网络的强广义稳健性","authors":"H. Boucheneb, Kamel Barkaoui","doi":"10.1109/ACSD.2015.22","DOIUrl":null,"url":null,"abstract":"We consider here the time Workflow nets [11], [17] with an arbitrary large number, denoted ω of tokens in their source places and investigate the verification of their soundness. We first revisit the notion of (strong) soundness in the context of permanent and concurrent evolutions of process instances. Then, we show how to verify (strong) ω-soundness of time workflow nets, using a forward reachability analysis.","PeriodicalId":162527,"journal":{"name":"2015 15th International Conference on Application of Concurrency to System Design","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Strongly Generalized Soundness of Time Workflow Nets\",\"authors\":\"H. Boucheneb, Kamel Barkaoui\",\"doi\":\"10.1109/ACSD.2015.22\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider here the time Workflow nets [11], [17] with an arbitrary large number, denoted ω of tokens in their source places and investigate the verification of their soundness. We first revisit the notion of (strong) soundness in the context of permanent and concurrent evolutions of process instances. Then, we show how to verify (strong) ω-soundness of time workflow nets, using a forward reachability analysis.\",\"PeriodicalId\":162527,\"journal\":{\"name\":\"2015 15th International Conference on Application of Concurrency to System Design\",\"volume\":\"86 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 15th International Conference on Application of Concurrency to System Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSD.2015.22\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 15th International Conference on Application of Concurrency to System Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSD.2015.22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们在这里考虑时间工作流网[11]，[17]具有任意大的数量，在其源位置表示ω的令牌，并研究其可靠性的验证。我们首先在流程实例的永久和并发演化的上下文中重新审视(强)可靠性的概念。然后，我们展示了如何验证(强)ω-健全的时间工作流网络，使用前向可达性分析。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Strongly Generalized Soundness of Time Workflow Nets

We consider here the time Workflow nets [11], [17] with an arbitrary large number, denoted ω of tokens in their source places and investigate the verification of their soundness. We first revisit the notion of (strong) soundness in the context of permanent and concurrent evolutions of process instances. Then, we show how to verify (strong) ω-soundness of time workflow nets, using a forward reachability analysis.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2015 15th International Conference on Application of Concurrency to System Design

自引率

0.00%

发文量