IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/8687035.html
   My bibliography  Save this article

A Multistep Look-Ahead Deadlock Avoidance Policy for Automated Manufacturing Systems

Author

Listed:
  • Chao Gu
  • Zhiwu Li
  • Abdulrahman Al-Ahmari

Abstract

For an automated manufacturing system (AMS), it is a computationally intractable problem to find a maximally permissive deadlock avoidance policy (DAP) in a general case, since the decision on the safety of a reachable state is NP-hard. This paper focuses on the deadlock avoidance problem for systems of simple sequential processes with resources (S 3 PR) by using Petri nets structural analysis theory. Inspired by the one-step look-ahead DAP that is an established result, which is of polynomial complexity, for an S 3 PR without one-unit-capacity resources shared by two or more resource-transition circuits (in the Petri net model) that do not include each other, this research explores a multiple-step look-ahead deadlock avoidance policy for a system modeled with an S 3 PR that contains a shared one-unit-capacity resource in resource-transition circuits. It is shown that the development of an optimal DAP for the considered class of Petri nets is also of polynomial complexity. It is indicated that the steps needed to look ahead in a DAP depend on the structure of the net model. A number of examples are used to illustrate the proposed method.

Suggested Citation

  • Chao Gu & Zhiwu Li & Abdulrahman Al-Ahmari, 2017. "A Multistep Look-Ahead Deadlock Avoidance Policy for Automated Manufacturing Systems," Discrete Dynamics in Nature and Society, Hindawi, vol. 2017, pages 1-16, August.
    • Handle: RePEc:hin:jnddns:8687035
    DOI: 10.1155/2017/8687035
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/DDNS/2017/8687035.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/DDNS/2017/8687035.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2017/8687035?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
    ---><---

    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:hin:jnddns:8687035. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.