An Algorithm for Determining Firing Sequence of Safe Petri Net Using its Matrix Equation

Safe Petri Net의 상태천이행렬식에 의한 비연속시스템의 점화순서 결정 알고리즘

This paper deals with the determination of a firing sequence of transitions in the reachability problem of Safe Petri Net. The determination problem of a firing sequence is very important from the point of practical view, especially in the control of the discrete systems modelled by Safe Petri Net. The determination method of a firing sequence of transitions by means of the matrix equation for the discrete systems modelled by Safe Petri Net is proposed. First, a construction method of the indicence matrix and the firing rule for Safe Petri Net with self-loop are presented by defining the permissive arc in place of self-loop. Next, we develop a method that can find the enable transitions of Safe Petri Net by means of the matrix equation of Safe Petri Net. Finally, by using this method, we propose an algorithm that determines the firing sequence of transitions of Safe Petri Net.