English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113648/144635 (79%)
Visitors : 51580729      Online Users : 1003
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 商學院 > 資訊管理學系 > 期刊論文 >  Item 140.119/80756
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/80756


    Title: Development of Critical-Siphon Theory to Fastest Deadlock Controller for Flexible Manufacturing Systems and Computer-Integrated Manufacturing
    Authors: 姜國輝
    Chiang, Johannes K.;Chao, Kiekang
    Contributors: 資管系
    Date: 2015-12
    Issue Date: 2016-01-25 11:12:00 (UTC+8)
    Abstract: Since decades, Flexible Manufacturing System (FMS) is a significant part of automated production and manufacturing. In the development of FMS, deadlock prevention becomes a crucial point. This paper present a critical-siphon theory to demonstrate exactly one monitor for quality FMS is required for the set of siphons in the family of a 2-compound siphons and how to assign its initial markings. The theory is aiming to avoid redundant monitors in FMS and the unnecessary associated computational burden so that the quality of a class of Flexible Manufacturing Systems can be assured latest in the run-time. Neither reachability graph nor minimal siphon needs to be computed achieving polynomial complexity- essential for large systems. This paper redevelops the theory more formally and further applies this approach to two well-known S3PR to obtain a controller full or near maximally permissive in the context of deadlock resolution and Quality Assurance. This paper further categorizes mixture siphons into partial and full ones and the sequence among them to add monitors associated with one or different 2-compound siphons. As a result, there is no need to enumerate all siphons and the time complexity involved is polynomial. This is the first of its kind of works among all current results on the benchmark.
    Relation: MATEC Web of Conferences, Vol.48, No.7, pp.0-0
    Data Type: article
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    408787.pdf269KbAdobe PDF2417View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback