Refactoring Problem of Acyclic Extended Free-Choice Workflow Nets to Acyclic Well-Structured Workflow Nets

この論文にアクセスする

この論文をさがす

著者

抄録

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; Acyclic WS is a subclass of acyclic EFC but has more analysis methods. An acyclic EFC WF-net may be transformed to an acyclic WS WF-net without changing the external behavior of the net. We name such a transformation <i>Acyclic EFC WF-net refactoring</i>. We give a formal definition of acyclic EFC WF-net refactoring problem. We also give a necessary condition and a sufficient condition for solving the problem. Those conditions can be checked in polynomial time. These result in the enhancement of the analysis power of acyclic EFC WF-nets.

収録刊行物

  • IEICE transactions on information and systems

    IEICE transactions on information and systems 95(5), 1375-1379, 2012-05-01

    一般社団法人 電子情報通信学会

参考文献:  5件中 1-5件 を表示

各種コード

  • NII論文ID(NAID)
    10030942858
  • NII書誌ID(NCID)
    AA10826272
  • 本文言語コード
    ENG
  • 資料種別
    SHO
  • ISSN
    09168532
  • データ提供元
    CJP書誌  J-STAGE 
ページトップへ