Abstract
Petri net can represent discrete event systems graphically and mathematically. For the purpose of analysis of 0-1 integer programming problems, we propose the convertion algorithm for 0-1 integer programming problems into an optimal firing sequence problem of Petri net. We compare the solution of 0-1 integer programming problems with that of the optimal firing sequence problem of Petri net. The results show that the solutions for both problems are the same for a variety of instances. Moreover, we propose the algorithm to extract decomposable structure of Petri net into two subnets. The performance of the decomposition is evaluated in order to extract effective decomposable structure. The validity of this algorithm is shown by using Petri net decomposition algorithm.
