Abstract

This paper proposes an improved algorithm for enumerating siphons and minimal siphons of Petri nets (PNs) in the framework of [18]. First, the logical equation of each transition is converted into a matrix equation by using the semi-tensor product (STP) of matrices, and then the matrix equation group of the PNs is obtained. Second, an improved algorithm is proposed to calculate the siphons and minimal siphons, respectively. Finally, two illustrative examples are presented to show the efficiency and application of the improved algorithm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call