English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 112721/143689 (78%)
Visitors : 49608100      Online Users : 682
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/72837
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/72837


    Title: Minimal strict siphons extraction for S3PMR
    Authors: 趙玉
    Chao, Daniel Yuh
    Contributors: 資管系
    Date: 2010-11
    Issue Date: 2015-01-12 15:34:04 (UTC+8)
    Abstract: A siphon is an important structure object for deadlock control. Insufficiently marked siphons lead to deadlocks. Deadlock occurs due to inappropriate resource sharing. Hence most of the research focuses on the minimal siphon extraction problem covering a set of places representing resources, which, for general Petri Nets is known to be an NP‐Complete problem. Control places and arcs are often added to the original net to prevent a siphon from becoming insufficiently marked. The number of siphons grows rapidly with the size of the net leading to very complicated control nets. Efficient enumeration of problematic siphons is an urgent research topic. Earlier, we proposed fast algorithms to find all such siphons for both S3PR and S2CPR (System of Synchronized Choice Processes with Resources). However, it was assumed that siphons occur between adjacent processes. This paper removes this assumption and develops an algorithm for S3PMR which is more powerful than S3PR by allowing a state to use more than one resource and than S2CPR by allowing more than one state to use the same resources. Comparisons with previously published work have been made.
    Relation: Journal of the Chinese Institute of Engineers,33(7),995-1004
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1080/02533839.2010.9671688
    DOI: 10.1080/02533839.2010.9671688
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML21002View/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