IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v53y2015i15p4492-4498.html
   My bibliography  Save this article

Revision on ‘Maximally permissive deadlock prevention via an Invariant Controlled Method’

Author

Listed:
  • Daniel Yuh Chao

Abstract

All current design approaches of maximally permissive supervisors assume that forbidden and legal markings are linearly separable. Based on that implicit assumption, Liu et al. propose a novel method of optimal control of a problematic siphon to synthesise maximally permissive controllers. However, there are counter examples for which we could not produce optimal solutions. This occurs when forbidden and legal markings are not linearly separable even though it rarely happens. Verifying linear separability involves solving a large set of linear inequalities and is quite time consuming. This paper aims to relieve this problem via enhancing our critical-siphon approach. Specifically, we propose to: (1) find an efficient method to detect linear inseparability; (2) construct best suboptimal control models; (3) find all lost legal markings; and (4) identify the linear equations that violate linear separability. Each above contribution is unique and pioneering.

Suggested Citation

  • Daniel Yuh Chao, 2015. "Revision on ‘Maximally permissive deadlock prevention via an Invariant Controlled Method’," International Journal of Production Research, Taylor & Francis Journals, vol. 53(15), pages 4492-4498, August.
    • Handle: RePEc:taf:tprsxx:v:53:y:2015:i:15:p:4492-4498
    DOI: 10.1080/00207543.2014.949897
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2014.949897
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2014.949897?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:tprsxx:v:53:y:2015:i:15:p:4492-4498. 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/TPRS20 .

    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.