IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v51y2020i5p771-785.html
   My bibliography  Save this article

A deadlock control algorithm using control transitions for flexible manufacturing systems modelling with Petri nets

Author

Listed:
  • Li Shaoyong
  • Zhao Chunrun

Abstract

This paper develops a concept of control transition equation (CTE) and the corresponding deadlock control algorithm (DCA) using control transitions (CTs) to eliminate deadlocks in Petri nets. By analysing the reachability graph (RG) of an original net $(N_0,M_0) $(N0,M0) with deadlocks, this DCA firstly find all deadlock markings (DMs) and then the corresponding CTs are solved on the basis of the proposed CTE. Secondly, a linear programming problem that can minimise the number of CTs is applied to these CTs. In addition, in order to furtherly simplify the structure of these CTs, the reconstruction of the necessarily added CTs is performed by a circulating sequence number method. Finally, a live controlled system $(N^{C},M^{ C}) $(NC,MC) with the simpler structure is obtained by adding the desired CTs to $(N_0,M_0) $(N0,M0), which can reach the same number of states as the original plant model $(N_0,M_0) $(N0,M0), i. e. live maximally reachable number. The proposed DCA is different from deadlock prevention policies using control places (CPs) in most existing literature and whose correctness and efficiency are verified via the theoretical analysis and the relevant several examples.

Suggested Citation

  • Li Shaoyong & Zhao Chunrun, 2020. "A deadlock control algorithm using control transitions for flexible manufacturing systems modelling with Petri nets," International Journal of Systems Science, Taylor & Francis Journals, vol. 51(5), pages 771-785, April.
    • Handle: RePEc:taf:tsysxx:v:51:y:2020:i:5:p:771-785
    DOI: 10.1080/00207721.2020.1737268
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2020.1737268
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2020.1737268?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tsysxx:v:51:y:2020:i:5:p:771-785. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.