A Petri Net Modeling Approach Based on Boolean Function Transition

A Petri Net is a mathematical modeling language for the description of distributed systems. A Petri net is a directed bipartite graph, in which the elements consist of place, transition, and arc. A Petri Net offers a kind of graphical notation for stepwise processes which include choice, iteration, and concurrent execution. However, when the system is getting large, the complexity of Petri Nets will be increased more quickly. In this paper, we propose a new Petri Net modeling language which is based on the Boolean Function Transition (BFT-PN, for short). Via combining the function with Boolean mathematic, it can describe both of PTP (Place-Transition-Place) table and the state transition of system more easily. BFT-PN can also reduce the complexity of transition of system on when the system is getting large and having a lot of events. In the other words, it can be dealt with very complex transition states by stepwise process not only more easily but also very clearly.