Recently, it is difficult to simulate, analyze and control a real knowledge-based system using the correspondence Petri net (PN) when there exist many current states. To overcome the state explosion problem of PN, an efficient decomposition algorithm is presented to divide a large-scale PN into a series of corresponding sub-PNs by keeping the consistency of dynamic properties. In this novel decomposition approach, an index function is defined to judge the subnet needs to be decomposed or not. Furthermore, an exhaustive analysis on the consistency of related dynamic properties is also discussed between the original PN and the corresponding sub-PNs. Finally, a case study is carried out to illustrate the feasibility and validity of the proposed approach