A method for finding a firing sequence for the reachability problem of Petri nets is proposed. By applying the integer programming to the matrix equations which describe marking transitions and firing conditions, a solution is reconstructed to realize the legal firing sequence. This method is suitable for solving relatively small size problems.
