IEICE TRANSACTIONS on Fundamentals
Parallel Degree of Well-Structured Workflow Nets
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E93-A No.12 pp.2730-2739
- Publication Date
- 2010/12/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E93.A.2730
- Type of Manuscript
- Special Section PAPER (Special Section on Theory of Concurrent Systems and its Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
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
Copy
@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},}
Copy
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 -
English
