Petri net simulation algorithm of maximum flow in transportation network

With the development of the research about comprehensive traffic system and intelligent traffic system, the technical problem of transportation requirement analysis and network analysis is supposed to be resolved firstly. Petri net theory can be used to solve the maximum flow problem in the ransportation network.Petri net and Petri net model of directional network are first introduced, then, a more applied method of seeking the maximum flow is given out.With the use of Petri net simulator, nondirectional transportation network is converted into a directional network, and its dual graph, denoted by DG, is converted into its Petri net model, then automatically get the maximum flow of the transportation network by seeking the DG's shortest path, i.e. the G's minimum cut capacity. This visual and intuitionistic method is more convenient and faster than the existing methods.