一种基于Petri网的无固定容量队列的算法

An Arithmetic of Unfixed Capability Queue Based On Petri Net

队列是一种先进先出的数据结构 ,其特点是当一个数据入队后 ,必须穿过整个列才能出队 ,效率不高 ;当容量改变时 ,使用它的应用程序必须在入口或出口作相应的改变。本文设计的无固定容量的队列克服了这个缺点 ,即当它的容量改变时 ,使用它的应用程序不必改变 ,并且不必穿过整个队列才出队 ,提高了效率。并用 Petri网模拟了它的系统行为 ,设计出它的算法 ,为使用这种数据结构的应用程序提供了方便。

Queue is a datum structure with first in first out. When a datum enters the queue, it must travers the entire queue before coming out, so the efficiency is low. When the queue's capacity is changed,its application program must be changed at its entry or exit.The queue with unfixed capacity designed in this paper conquers this shortcoming. The queue's system actions is simulated and its algorithms is designed with Petri net.Thus it offers convenience for its application program.