In: Transactions of the Society of Instrument and Control Engineers Vol. 25, No. 6, pages 698-705. June 1989. In Japanese.
Abstract: The reachability problem of a Petri net can be solved by checking whether there exists a nonnegative integer solution such that the matrix equation of the net holds true. Even if the solution exists, however, there is still the problem of finding an appropriate firing sequence. A method for determining such a sequence is proposed: An algorithm to determine the firing sequence by tracing backwards from the final marking to the initial one on the places set is presented. The method proposed is applied to the failure diagnosis of a simple type of sequence control system.
Keywords: firing sequence (determination); reachability problem; failure diagnosis; sequence control system.
Back to the Petri Nets Bibliography