Timed Colored Logical Petri Net

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.

Keywords

• petri net; timestamp; colored token; logical transition