English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 94001/124455 (76%)
Visitors : 29059305      Online Users : 234
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: http://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

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

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback