Reachability analysis of logic Petri nets using incidence matrix

Logic Petri nets (LPNs) can simplify the net-structure and mitigate the problem of state space explosion. To directly investigate the properties of LPNs, a new analysis method of LPNs is introduced in this paper based on incidence matrix. The enabled conditions of transitions are given, and reachable markings are calculated based on the constructed incidence matrix of LPNs. The state equation of LPNs is defined, and the reachability of LPNs is analysed. Compared with the previous work, the incidence matrix in this paper can contain more information and describes the logic expressions and arcs of LPNs. The computational complexity of LPNs is lower. Finally, the validity, reliability and effectiveness of the proposed method are illustrated by analysing an actual case. The theoretical and practical values of LPNs are enhanced.