Two Sufficient Conditions on Refactorizability of Acyclic Extended Free Choice Workflow Nets to Acyclic Well-Structured Workflow Nets and Their Application

Ichiro TOYOSHIMA; Shingo YAMAGUCHI; Yuki MURAKAMI

doi:10.1587/transfun.E98.A.635

Two Sufficient Conditions on Refactorizability of Acyclic Extended Free Choice Workflow Nets to Acyclic Well-Structured Workflow Nets and Their Application

Ichiro TOYOSHIMA, Shingo YAMAGUCHI, Yuki MURAKAMI

Full Text Views

0

Share
Cite this

Summary :

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 tackled a problem, named acyclic EFC WF-net refactorizability problem, that decides whether a given sound acyclic EFC WF-net is refactorable to an acyclic WS WF-net. We gave two sufficient conditions on the problem, and constructed refactoring procedures based on the conditions. Furthermore, we applied the procedures to a sample workflow, and confirmed usefulness of the procedures for the enhancement of the readability and the analysis power of acyclic EFC WF-nets.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E98-A No.2 pp.635-644

Publication Date: 2015/02/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E98.A.635

Type of Manuscript: Special Section PAPER (Special Section on Mathematical Systems Science and its Applications)

Category

Authors

Ichiro TOYOSHIMA
  Yamaguchi University
Shingo YAMAGUCHI
  Yamaguchi University
Yuki MURAKAMI
  Yamaguchi University

Keyword

workflow net, extended free choice WF-net, well-structured WF-net, refactorizability, PT-handle, TP-handle

Cite this

Copy

Ichiro TOYOSHIMA, Shingo YAMAGUCHI, Yuki MURAKAMI, "Two Sufficient Conditions on Refactorizability of Acyclic Extended Free Choice Workflow Nets to Acyclic Well-Structured Workflow Nets and Their Application" in IEICE TRANSACTIONS on Fundamentals, vol. E98-A, no. 2, pp. 635-644, February 2015, doi: 10.1587/transfun.E98.A.635.
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 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 tackled a problem, named acyclic EFC WF-net refactorizability problem, that decides whether a given sound acyclic EFC WF-net is refactorable to an acyclic WS WF-net. We gave two sufficient conditions on the problem, and constructed refactoring procedures based on the conditions. Furthermore, we applied the procedures to a sample workflow, and confirmed usefulness of the procedures for the enhancement of the readability and the analysis power of acyclic EFC WF-nets.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E98.A.635/_p

Copy

@ARTICLE{e98-a_2_635,
author={Ichiro TOYOSHIMA, Shingo YAMAGUCHI, Yuki MURAKAMI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Two Sufficient Conditions on Refactorizability of Acyclic Extended Free Choice Workflow Nets to Acyclic Well-Structured Workflow Nets and Their Application},
year={2015},
volume={E98-A},
number={2},
pages={635-644},
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 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 tackled a problem, named acyclic EFC WF-net refactorizability problem, that decides whether a given sound acyclic EFC WF-net is refactorable to an acyclic WS WF-net. We gave two sufficient conditions on the problem, and constructed refactoring procedures based on the conditions. Furthermore, we applied the procedures to a sample workflow, and confirmed usefulness of the procedures for the enhancement of the readability and the analysis power of acyclic EFC WF-nets.},
keywords={},
doi={10.1587/transfun.E98.A.635},
ISSN={1745-1337},
month={February},}

Copy

TY - JOUR
TI - Two Sufficient Conditions on Refactorizability of Acyclic Extended Free Choice Workflow Nets to Acyclic Well-Structured Workflow Nets and Their Application
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 635
EP - 644
AU - Ichiro TOYOSHIMA
AU - Shingo YAMAGUCHI
AU - Yuki MURAKAMI
PY - 2015
DO - 10.1587/transfun.E98.A.635
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E98-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2015
AB - 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 tackled a problem, named acyclic EFC WF-net refactorizability problem, that decides whether a given sound acyclic EFC WF-net is refactorable to an acyclic WS WF-net. We gave two sufficient conditions on the problem, and constructed refactoring procedures based on the conditions. Furthermore, we applied the procedures to a sample workflow, and confirmed usefulness of the procedures for the enhancement of the readability and the analysis power of acyclic EFC WF-nets.
ER -