任务调度问题的Petri网模型及其分析

Petri Net Model and Analysis of Task Schedule Problem

提出任务调度问题的Petri网模型及其构造方法,给出了求解该Petri网模型的主任务线的方法,提出了并发段的概念,在此基础上计算出该任务调度问题所需处理机的最小台数.

A Petri net model of task schedule problem and its construction method is presented in this paper.Regarding the Petri net model,the solving method of main task line is addressed and the notion of concurrent segment is given. On this basis,the minimum of processors needed in the task schedule problem is calculated.