Parallel Degree of Well-Structured Workflow Nets
スポンサーリンク
概要
- 論文の詳細を見る
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.
論文 | ランダム
- 賠償医学と弁護士の役割--法と医の双方に係るもの (賠償医学を巡る諸問題--交通事故を中心として)
- A new antibiotic,XK-46
- 外国の閉鎖性水域の環境・資源管理法制との比較 (特集 豊かな海と島づくり--里海を守り育てる人と法)
- 生きている細胞間接着装置 : 上皮の再編成による器官形成
- 気管形成を見る 柔らかな上皮:ショウジョウバエ気管形成の動的解析 (特集 ムービーで探る生体内の細胞動態)