Petri Net Simulation Arithmetic of the Shortest Directional Path in Transportation Net
Bing Li · Nanjing Hangkong Hangtian Daxue xuebao · 2002
With the development of the research in comprehensive traffic system and intelligent traffic system, the technical problem to transportation requirement analysis and network analysis is supposed to be resolved firstly. On the other hand, all the existing mature theory and methods are only for directional network, but not suitable for non directional transportation network. This paper presents how to convert the non directional transportation net into Petri net denoted directional graph with the help of Petri net theory and Petri net simulator, meanwhile finding the corresponding shortest path of the transportation network. In this paper, Petri net is defined by net graph, and by introducing the time place and token, Petri net becomes enlarged Perti net (EPN). According to the running rules and steps, Petri net simulator can convert the nondirectional transportation net into EPN model and then work out its shortest path automatically. Finally, simulational results return to the user in form of screen displaying or printed reports.