Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions

被引：0
|
作者：
Wehler, Joachim [1 ]
机构：
[1] Ludwig Maximilians Univ Munchen LMU Munich, Dept Math, Munich, Germany
来源：
FUNDAMENTA INFORMATICAE | 2021年 / 182卷 / 03期
关键词：
Free-choice system; CP-subnet; perpetuality; lucency;
D O I：
10.3233/FI-2021-2078
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Van der Aalst's theorem is an important result for the analysis and synthesis of process models. The paper proves the theorem by exhausting perpetual free-choice Petri nets by CP-subnets. The resulting T-systems are investigated by elementary methods.
引用
收藏
页码：363 / 393
页数：31
相关论文
共 4 条
1