Polynomial Time Verification of Protocol Inheritance between Acyclic Extended Free-Choice Workflow Nets and Their Subnets

被引:6
|
作者
Yamaguchi, Shingo [1 ]
Hirakawa, Tomohiro [1 ]
机构
[1] Yamaguchi Univ, Grad Sch Sci & Engn, Ube, Yamaguchi 7558611, Japan
关键词
workflow net; behavioral inheritance; protocol inheritance; necessary and sufficient condition; polynomial time procedure; PETRI NETS;
D O I
10.1587/transfun.E96.A.505
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A workflow net N may be extended as another workflow net N' by adding nodes and arcs. N' is intuitively called a subclass of N under protocol inheritance if we cannot distinguish those behaviors when removing the added transitions. Protocol inheritance problem is to decide whether N' is a subclass of N under protocol inheritance. It is known that the problem is decidable but is intractable. Even if N is a subnet of N', N' is not always a subclass of N under protocol inheritance. In this paper, limiting our analysis to protocol inheritance between acyclic extended free-choice workflow nets and their subnets, we gave a necessary and sufficient condition on the problem. Based on the condition, we also constructed a polynomial time procedure for solving the problem.
引用
收藏
页码:505 / 513
页数:9
相关论文
共 28 条