Modeling and analysis of colored petri net based on the semi-tensor product of matrices

This paper applies the model petri net method based on the semi-tensor product of matrices to colored petri net. Firstly, we establish the marking evolution equation for colored petri net by using the semitensor product of matrices. Then we define the concept of controllability and the control-marking adjacency matrix for colored petri net. Based on the marking evolution equation and control-marking adjacency matrix, we give the necessary and sufficient condition of reachability and controllability for colored petri net. The algorithm to verify the reachability of colored petri net is given, and we analyze the computational complexity of the algorithm. Finally, an example is given to illustrate the effectiveness of the proposed theory. The significance of the paper lies in the application of the model petri net method based on the semitensor product of matrices to colored petri net. This is a convenient way of verifying whether one marking is reachable from another one as well as finding all firing sequences between any two reachable markings. Additionally, the method lays the foundations for the analysis of other properties of colored petri net.