Abstract: Aiming at the problems of weak expressive ability and narrow scope of application in extended colored logical Petri net, timed colored logical Petri net is proposed. Firstly, instantiating colors and using variables to build expressions on directed edges enables the model to transmit complex data flows. Secondly, concepts such as global time and timestamp are introduced to add time constraints to transition enabling rules, so that the model can be used to simulate real-time systems. Thirdly, place restriction functions are defined and constraints on the output places are added to the transition enabling rules, so that the model can be applied to scenes with limited storage resources. Next, a matrix matching method based on logical transition input-output matrix is proposed, which can reduce the calculation cost of the enable decision of the logic input transition and simplify the calculation process of the enable decision of the logic output transition. Then, this paper redefines the enabling rules for three types of transitions and the mark updating methods for three types of places, in order to solve the problem that the semantics of the old model is not applicable to the new model. Finally, an example is given to illustrate that the new Petri net model has stronger expression ability and scope of application, and it can be applied to systems that transmit complex data flows, with limited storage resources, real-time and with batch processing selection structures.

Key words: Petri net, timestamp, colored token, logical transition

摘要： 针对扩展着色逻辑Petri网存在的表达能力弱以及适用范围窄的问题，提出了一个新的Petri网模型，即带有时间戳的着色逻辑Petri网。首先，将颜色进行实例化以及将变量用于构建有向边上的表达式使得模型能够传递复杂的数据流。其次，引入全局时间以及令牌的时间戳等概念为变迁使能规则增加时间上的约束，使得模型能够用于模拟实时系统。再次，定义库所约束函数并为变迁使能规则增加输出库所上的约束，使得模型能够适用于存储资源有限的场景。接着，提出基于逻辑变迁输入输出矩阵的匹配法，降低逻辑输入变迁的使能判定计算开销并简化逻辑输出变迁的使能判定计算过程。然后，重新定义适用于三类变迁的使能判定条件以及适用于三类库所的标记更新方法，解决原有模型语义在新模型中不适用的问题。最后，通过实例说明新的Petri网模型具有更强的表达能力和适用范围，它能够适用于传递复杂数据流、存储资源有限、实时的且包含批处理选择结构的系统。

关键词: Petri网, 时间戳, 着色令牌, 逻辑变迁