Polynomial Time Solvability of Response Property for Sound Acyclic Free Choice Workflow Nets

被引：0
|
作者：
Ohta, Atsushi [1 ]
Fujii, Ryosuke [1 ]
Tsuji, Kohkichi [1 ]
机构：
[1] Aichi Prefectural Univ, Nagakute, Aichi, Japan
来源：
2019 34TH INTERNATIONAL TECHNICAL CONFERENCE ON CIRCUITS/SYSTEMS, COMPUTERS AND COMMUNICATIONS (ITC-CSCC 2019) | 2019年
关键词：
Petri net; response property; computational complexity;
D O I：
10.1109/itc-cscc.2019.8793354
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Petri net is a mathematical tool for concurrent discrete event systems. This paper studies computational complexity to decide whether the transition A responds to B, given a pair of transitions A and B. This problem is shown to be verified in deterministic polynomial time for sound acyclic free choice workflow nets.
引用
收藏
页码：182 / 185
页数：4
相关论文
共 38 条
1234