On transforming Petri net model to Moore machine

The absence of satisfactory methods for verifying the liveness and fairness properties limits the analysis power of Petri net theories. An approach is introduced to connect the Petri net model with the Model Checker. A translator is used to transform the reachability graph of the Petri net to the Moore machine. The Moore machine and the behaviors specified by temporal logic are the inputs of the Model Checker, which is able to verify the properties of liveness and fairness. During the transformation, local and global behaviors of the Petri net model are separated, which means that a certain modularity can be achieved. An optimization technique is presented to trim the unnecessary local information from the local reachability graphs. The space complexity of manipulating the global reachability graph, which is generated by combing the trimmed local reachability graph, can be reduced. Moreover, a new approach is proposed to verify the concurrency behavior by using the Model Checker.<>