Sufficient Condition on Refactorizability of Acyclic Extended Free Choice Workflow Nets to Acyclic Well-Structured Workflow Nets

被引：1

作者：

Murakami, Yuki ^{[1
]}

Toyoshima, Ichiro ^{[1
]}

Yamaguchi, Shingo ^{[1
]}

机构：

[1] Yamaguchi Univ, Yamaguchi, Japan

来源：

2013 FIRST INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR) | 2013年

关键词：

PETRI NETS;

D O I：

10.1109/CANDAR.2013.106

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A workflow net (WF-net for short) is a Petri net which represents a workflow. There are two important subclasses of WF-nets: extended free choice (EFC for short) and well-structured (WS for short). It is known that most actual workflows can be modeled as EFC WF-nets; and acyclic WS is a subclass of acyclic EFC but has more analysis methods. A sound acyclic EFC WF-net may be transformed to an acyclic WS WF-net without changing the observable behavior of the net. Such a transformation is called refactoring. In this paper, we tackle a problem, named refactorizability problem, that decides whether a given sound acyclic EFC WF-net is refactorable to an acyclic WS WF-net. We give a sufficient condition on the problem, i.e. a sound acyclic EFC WF-net is refactorable to an acyclic WS WF-net if its short-circuited net has no PT-handle. Based on the condition, we construct a polynomial time procedure for solving the problem. This results in the enhancement of the analysis power of acyclic EFC WF-nets.

引用

页码：592 / 596

页数：5

共 8 条

[1]

BEST E, 1983, LECT NOTES COMPUT SC, V159, P141

[2]

Esparza J., 1990, LECT NOTES COMPUTER, V483, P210

[3]

Kuroda Y., 2009, P ITC CSCC 2009, P875

[4] PETRI NETS - PROPERTIES, ANALYSIS AND APPLICATIONS [J].