E-timed Workflow Nets

2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 1900-01-01 DOI:10.1109/SYNASC.2006.33

F. Ţiplea, G. I. Macovei

引用次数: 11

Abstract

In this paper, e-timed workflow nets are introduced, and a characterization of the soundness property for them is provided. This characterization is based on boundedness and liveness as for classical workflow nets. It is shown that the properties of boundedness and liveness for e-timed Petri nets can be reduced to the same properties for Petri nets with zero-tests on bounded places. As these two properties are decidable for Petri nets with zero-tests on bounded places, the soundness property for e-timed workflow nets is decidable

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

e -time工作流网

本文介绍了电子定时工作流网络，并给出了其稳健性的表征。这种特性是基于经典工作流网络的有界性和活动性。证明了e-time Petri网的有界性和活动性可以简化为在有界位置上具有零检验的Petri网的相同性质。由于这两个性质对于Petri网在有界位置上具有零测试是可确定的，因此e-time工作流网的稳健性是可确定的

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

求助全文

约1分钟内获得全文去求助

来源期刊

2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

自引率

0.00%

发文量

期刊最新文献

Algorithms and Results in Content-Based Visual Query of the Image Databases Resulting from Dicom Files A New k-means Based Clustering Algorithm in Aspect Mining A Framework for Scheduling Image Processing Applications in MedioGRID HTML Pattern Generator--Automatic Data Extraction from Web Pages Incremental Deterministic Planning