IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2013y2013i1n315894.html

Supervisor Reconfiguration for Deadlock Prevention by Resources Reallocation

Author

Listed:
  • Miao Liu
  • Shouguang Wang
  • Zhiwu Li

Abstract

Analysis and control of deadlocks play an important role in the design and operation of automated flexible manufacturing systems (FMSs). In FMS, deadlocks are highly undesirable situations, which always cause unnecessary cost. The design problem of an optimal supervisor is in general NP‐hard. A computationally efficient method often ends up with a suboptimal one. This paper develops a deadlock prevention policy based on resources reallocation and supervisor reconfiguration. First, given a plant model, we reallocate the marking of each resource place to be one, obtaining a net model whose reachable states are much less than that of the original one. In this case, we find a controlled system for it by using the theory of regions. Next, the markings of the resource places in the controlled system are restored to their original ones. Without changing the structure of the obtained controlled system, we compute the markings of the monitors gradually, which can be realized by two algorithms proposed in this paper. Finally, we decide a marking for each monitor such that it makes the controlled system live with nearly optimal permissive behavior. Two FMS examples are used to illustrate the application of the proposed method and show its superior efficiency.

Suggested Citation

  • Miao Liu & Shouguang Wang & Zhiwu Li, 2013. "Supervisor Reconfiguration for Deadlock Prevention by Resources Reallocation," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).
    • Handle: RePEc:wly:jnljam:v:2013:y:2013:i:1:n:315894
    DOI: 10.1155/2013/315894
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2013/315894
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/315894?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
    ---><---

    References listed on IDEAS

    as
    1. P. K. Mishra, 2004. "Lower and upper bounds of shortest paths in reachability graphs," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2004, pages 1-14, January.
    2. Behnam Barzegar & Homayun Motameni & Hossein Bozorgi, 2012. "Solving Flexible Job-Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net," Journal of Applied Mathematics, Hindawi, vol. 2012, pages 1-20, August.
    3. Behnam Barzegar & Homayun Motameni & Hossein Bozorgi, 2012. "Solving Flexible Job‐Shop Scheduling Problem Using Gravitational Search Algorithm and Colored Petri Net," Journal of Applied Mathematics, John Wiley & Sons, vol. 2012(1).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Juan-Ignacio Latorre-Biel & Emilio Jiménez-Macías & Mercedes Pérez de la Parte & Julio Blanco-Fernández & Eduardo Martínez-Cámara, 2014. "Control of Discrete Event Systems by Means of Discrete Optimization and Disjunctive Colored PNs: Application to Manufacturing Facilities," Abstract and Applied Analysis, John Wiley & Sons, vol. 2014(1).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Juan-Ignacio Latorre-Biel & Emilio Jiménez-Macías & Mercedes Pérez de la Parte & Julio Blanco-Fernández & Eduardo Martínez-Cámara, 2014. "Control of Discrete Event Systems by Means of Discrete Optimization and Disjunctive Colored PNs: Application to Manufacturing Facilities," Abstract and Applied Analysis, John Wiley & Sons, vol. 2014(1).

    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:wly:jnljam:v:2013:y:2013:i:1:n:315894. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

    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.