Abstract
This work present a new class of Petri nets extended from systems of simple sequential processes with resources (S/sup 3/PR)[J, Ezpeleta et al., 1995] for modeling manufacturing systems where only parts can interact with resources, and resources alone cannot interact with one another. The new class of net that is called ES/sup 3/PR where deadlocks are related to unmarked siphons. ES/sup 3/PR properly includes S/sup 3/PR, augmented marked graphs and sub-classes of RCN merged nets where firing a transition may only generate parallel process for parts. As a result, ES/sup 3/PR can model far more complex manufacturing process flows and resource sharing than these nets. We also present an algorithm of deadlock prevention for the class of Petri nets. The proposed method is an iterative approach by adding two kinds of control places called ordinary control place and weighted control place to the original model to prevent siphons from being unmarked. One is added a control place to an original net with its related arcs such that the controlled net is still an ordinary Petri net; the other is added a control place to the net with its related arcs such the controlled net become to a generalized Petri net. In addition, the weighted control place assures that there are no new unmarked siphons generated. We have obtained the relation of the proposed algorithm and the liveness and reversibility of the controlled net. Finally, a flexible manufacturing example is presented for illustrating the method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.