Compiler and Linker of Sleptsov Net Program

Sleptsov nets represent graphical language for concurrent programming. Some transitions in the Sleptsov net (SN) can be substituted by subnets, resulting in a hierarchical Sleptsov net, which we call the high-level Sleptsov net (HSN). In this way, we can facilitate the function extension on the basis of the existing net model. We formulate the file specification to represent the information of HSN and its mapping relationship with the subnets. In addition, we define data structures according to the composition information of the net and propose algorithms to complete the conversion of HSN to low-level Sleptsov net (LSN), which does not contain transition substitution. Through complexity analysis, we obtain that the algorithms run in polynomial time. Furthermore, the algorithms are implemented via C language programming, and the feasibility of the algorithms is verified through examples and benchmark tests.