调度问题的压缩Petri网（RePN）模型研究  

AN APPROACH TO REDUCED PETRI NETS MODEL

作　　者：于达[1] 张钹[1] 陈陈 

机构地区：[1]清华大学计算机科学与技术系

出　　处：《计算机学报》1997年第6期562-566,共5页Chinese Journal of Computers

基　　金：国家863高科技基金

摘　　要：本文提出了一种新的Ｐｅｔｒｉ网模型──压缩Ｐｅｔｒｉ网（ＲｅＰＮ）模型，用于调度问题的建模和求解．与以前的模型相比，ＲｅＰＮ模型不仅具有较强的分析能力，而且大大减少了节点数，使可达集相应减小，从而为搜索调度问题的最优解或近忧解提供了方便．In order to model and solve scheduling problem, a new Petri nets model-reduced Petri nets model is introduced. Compared with previous Petri nets model of scheduling problem, RePN model not only has strong abilities of analysis but also reduces the number of nodes greatly. So that the reachable set of RePN model is much smaller, which makes it more convenient to search the optimal on near optimal solution of scheduling.

关 键 词：调度 标识图 压缩Petri网 PETRI网 模型 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]