Title | ||
---|---|---|
Sufficient Condition on Refactorizability of Acyclic Extended Free Choice Workflow Nets to Acyclic Well-Structured Workflow Nets |
Abstract | ||
---|---|---|
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 a cyclic WS is a subclass of a cyclic EFC but has more analysis methods. A sound a cyclic EFC WF-net may be transformed to an a cyclic 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 a cyclic EFC WF-net is refactorable to an a cyclic WS WF-net. We give a sufficient condition on the problem, i.e. a sound a cyclic EFC WF-net is refactorable to an a cyclic 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 a cyclic EFC WF-nets. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1109/CANDAR.2013.106 | Computing and Networking |
Keywords | Field | DocType |
sufficient condition,acyclic well-structured workflow nets,refactorizability problem,cyclic efc,analysis method,acyclic extended free choice,cyclic efc wf-net,cyclic ws wf-net,cyclic ws,cyclic efc wf-nets,analysis power,efc wf-nets,petri nets | Observable,Petri net,Computer science,Algorithm,Theoretical computer science,Workflow nets,Time complexity,Code refactoring,Workflow | Conference |
ISBN | Citations | PageRank |
978-1-4799-2795-1 | 0 | 0.34 |
References | Authors | |
5 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yuki Murakami | 1 | 45 | 4.44 |
Ichiro Toyoshima | 2 | 6 | 2.42 |
shingo | 3 | 64 | 31.04 |