Computational Complexity and Polynomial Time Procedure of Response Property Problem in Workflow Nets

被引：2
|
作者：
Bin Ab Malek, Muhammad Syafiq [1 ]
Bin Ahmadon, Mohd Anuaruddin [1 ]
Yamaguchi, Shingo [1 ]
机构：
[1] Yamaguchi Univ, Grad Sch Sci & Technol Innovat, Ube, Yamaguchi 7558611, Japan
来源：
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | 2018年 / E101D卷 / 06期
关键词：
the response property Petri net; process tree; computational complexity; polynomial time algorithm; VERIFICATION;
D O I：
10.1587/transinf.2017FOP0008
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Response property is a kind of liveness property. Response property problem is defined as follows: Given two activities alpha and beta whenever alpha is executed, is beta always executed after that? In this paper, we tackled the problem in terms of Workflow Petri nets (WF-nets for short). Our results are (i) the response property problem for acyclic WF-nets is decidable, (ii) the problem is intractable for acyclic asymmetric choice (AC) WF-nets, and (iii) the problem for acyclic bridge-less well-structured WF-nets is solvable in polynomial time. We illustrated the usefulness of the procedure with an application example.
引用
收藏
页码：1503 / 1510
页数：8
相关论文
共 29 条
123