The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
본 논문에서는 잘 구조화된 워크플로우 넷, 즉 WF-net의 병렬 정도에 대해 논의합니다. 먼저, 평행도의 정의를 제시합니다. PARAdeg, WF-net의 경우. 둘째, 우리는 가치를 계산하는 것이 다루기 어렵다는 것을 보여줍니다. PARAdeg 비순환적으로 잘 구조화된 WF-net의 경우. 다음으로 값을 계산하기 위해 두 가지 경험적 알고리즘을 구성합니다. 첫 번째 알고리즘은 중첩 구조에 초점을 맞추고 두 번째 알고리즘은 가장 긴 경로에 초점을 맞춥니다. 마지막으로 두 알고리즘을 비교하는 실험을 수행한 결과 네스트 구조를 기반으로 한 첫 번째 알고리즘의 정확도가 가장 잘 구조화된 WF-net의 가장 긴 경로를 기반으로 한 두 번째 알고리즘의 정확도보다 높았으며 정확도도 더 높았습니다. 잘 구조화된 워크플로우 넷이 주로 병렬 구조로 구성된 경우에만 두 번째 것이 첫 번째 것보다 낫습니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Nan QU, Shingo YAMAGUCHI, Qi-Wei GE, "Parallel Degree of Well-Structured Workflow Nets" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 12, pp. 2730-2739, December 2010, doi: 10.1587/transfun.E93.A.2730.
Abstract: In this paper, we discuss the parallel degree of well-structured workflow nets, WF-nets, for short. First, we give the definition of parallel degree, PARAdeg, for WF-nets. Second, we show it is intractable to compute the value of PARAdeg for acyclic well-structured WF-nets. Next we construct two heuristic algorithms to compute the value. The first algorithm is focused on nest structure and the second one is focused on the longest path. Finally, we perform an experiment to compare the two algorithms and the result is that the accuracy of the first algorithm based on nest structure was higher than that of the second one based on the longest path for most well-structured WF-nets and the accuracy of the second one is better than that of first one only when the well-structured workflow nets are mainly composed by the parallel structures.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.2730/_p
부
@ARTICLE{e93-a_12_2730,
author={Nan QU, Shingo YAMAGUCHI, Qi-Wei GE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Parallel Degree of Well-Structured Workflow Nets},
year={2010},
volume={E93-A},
number={12},
pages={2730-2739},
abstract={In this paper, we discuss the parallel degree of well-structured workflow nets, WF-nets, for short. First, we give the definition of parallel degree, PARAdeg, for WF-nets. Second, we show it is intractable to compute the value of PARAdeg for acyclic well-structured WF-nets. Next we construct two heuristic algorithms to compute the value. The first algorithm is focused on nest structure and the second one is focused on the longest path. Finally, we perform an experiment to compare the two algorithms and the result is that the accuracy of the first algorithm based on nest structure was higher than that of the second one based on the longest path for most well-structured WF-nets and the accuracy of the second one is better than that of first one only when the well-structured workflow nets are mainly composed by the parallel structures.},
keywords={},
doi={10.1587/transfun.E93.A.2730},
ISSN={1745-1337},
month={December},}
부
TY - JOUR
TI - Parallel Degree of Well-Structured Workflow Nets
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2730
EP - 2739
AU - Nan QU
AU - Shingo YAMAGUCHI
AU - Qi-Wei GE
PY - 2010
DO - 10.1587/transfun.E93.A.2730
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2010
AB - In this paper, we discuss the parallel degree of well-structured workflow nets, WF-nets, for short. First, we give the definition of parallel degree, PARAdeg, for WF-nets. Second, we show it is intractable to compute the value of PARAdeg for acyclic well-structured WF-nets. Next we construct two heuristic algorithms to compute the value. The first algorithm is focused on nest structure and the second one is focused on the longest path. Finally, we perform an experiment to compare the two algorithms and the result is that the accuracy of the first algorithm based on nest structure was higher than that of the second one based on the longest path for most well-structured WF-nets and the accuracy of the second one is better than that of first one only when the well-structured workflow nets are mainly composed by the parallel structures.
ER -