Exploiting Petri net graph to model the FSM of modulo-P counter

Traditionally, the basic abstract of a system is described by the general static machine. If we want to model the transactions of the discrete-event system (DES), the finite state machine model does not clearly and evidently to illustrate the state transition. For illustrating and modeling a high-performance state transition system, we can use the Petri nets (PNs) graph to replace the concepts of traditional finite state machine (FSM). In this paper, we issue some novel kinds of elements of the Petri net to replace the FSM, furthermore, to illustrate the state transition. In order to make the focal points stand, we give an example, in which we use the Petri net graph to illustrate the combination logic control circuit of Modulo-p counter, to prove our assumption