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.
- （社）電子情報通信学会の論文
- 2010-12-01
著者
-
Ge Qi-wei
Faculty Of Education Yamaguchi University
-
YAMAGUCHI Shingo
Graduate School of Science and Engineering, Yamaguchi University
-
Qu Nan
Graduate School Of Science And Engineering Yamaguchi University
-
Yamaguchi Shingo
Graduate School Of Science And Engineering Yamaguchi University
関連論文
- An Optimal Two-Processor Scheduling for a Class of Program Nets via a Hybrid Priority List (特集 並列処理)
- A Flexible and Efficient Workflow Change Type : Selective Shift(Papers Selected from ITC-CSCC 2004)
- Modeling and Performance Evaluation on Change Time for Migrate Dynamic Workflow Changes(Special Section on Papers Selected from ITC-CSCC 2002)
- WF-Net Based Modeling and Soundness Verification of Interworkflows(Selected Papers from the 19th Workshop on Circuits and Systems in Karuizawa)
- Complexity and a Heuristic Algorithm of Computing Parallel Degree for Program Nets with SWITCH-Nodes(Concurrent Systems,Concurrent/Hybrid Systems: Theory and Applications)
- Performance Evaluation on Worst Change Time of Flush and SCO Dynamic Changes for State Machine WF-Nets(Papers Selected from 2005 International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2005))
- Dead Problem of Program Nets(Selected Papers from the 18th Workshop on Circuits and Systems in Karuizawa)
- Computation Methods of Maximum Throughput for MG/SMWF-Nets with Conflict-Free Resources(Concurrent Systems)(Concurrent Systems and Hybrid Systems)
- Parallel Degree of Well-Structured Workflow Nets
- Delay Time Determination for the Timed Petri Net Model of a Signaling Pathway Based on Its Structural Information
- MceSim : A Multi-Car Elevator Simulator
- A Model Checking Method of Soundness for Workflow Nets
- On Verification of Token Self-Cleanness of Data-Flow Program Nets (Special Section of Papers Selected from JTC-CSCC'95)
- Performance Evaluation of a Two-Processor Scheduling Method for Acyclic SWITCH-less Program Nets(Papers Selected from ITC-CSCC 2004)
- An Optimal Two-Processor Scheduling for a Class of SWITCH-less Program Nets with Combined OR-nodes(Special Section on Papers Selected from ITC-CSCC 2001)
- A Two-Processor Scheduling Method for a Class of Program Nets with Unity Node Firing Time (Special Section on Concurrent Systems Technology)
- A Method of Finding Legal Sequence Number for a Class of Extended Series-Parallel Digraphs (Special Section on Discrete Mathematics and Its Applications)
- Polynomial Time Verification of Behavioral Inheritance for Interworkflows Based on WfMC Protocol
- An Effective Dynamic Priority List for 2-Processor Scheduling of Program Nets(Special Section of Selected Papers from the 13th Workshop on Circuits and Systems in Karuizawa)
- Incorporation of Cycles and Inhibitory Arcs into the Timed Petri Net Model of Signaling Pathway