Liveness, fairness, and recurrence in Petri nets

被引：18

作者：

Kindler, E ^{[1
]}

van der Aalst, W

机构：

[1] Humboldt Univ, Inst Informat, D-10099 Berlin, Germany

[2] Eindhoven Univ Technol, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands

来源：

INFORMATION PROCESSING LETTERS | 1999年 / 70卷 / 06期

关键词：

concurrency; distributed systems; Petri nets; theory of computation;

D O I：

10.1016/S0020-0190(99)00074-5

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In Petri net theory, recurrence implies liveness. In this study, the reverse implication of this reverse direction is examined. First, a class of Petri nets for which liveness implies recurrence is characterized. Following this, extended asymmetric choice nets are defined. It is shown that liveness also implies recurrence for this class. The results show that for extended asymmetric choice nets, soundness guarantees termination. Detailed analysis of workflow processes show that all workflows encountered can be modeled by extended asymmetric choice nets.

引用

页码：269 / 274

页数：6

共 16 条

[1] DEFINING LIVENESS [J].