English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 93244/123616 (75%)
Visitors : 27866425      Online Users : 452
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/72846
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/72846

    Title: An Incremental Approach to Extracting Minimal Bad Siphons
    Authors: 趙玉
    Chao, Daniel Yuh
    Contributors: 資管系
    Keywords: Petri nets;siphons;traps;FMS;algorithm;liveness;deadlock
    Date: 2007-01
    Issue Date: 2015-01-12 15:36:35 (UTC+8)
    Abstract: Finding all minimal bad siphons is essential for deadlock control. However, the number of siphons grows exponentially with the size of the system. Deadlock occurs due to inappropriate resource sharing. Hence most research focused on the problem of minimal siphon extraction covering a set of places representing resources — an NP-Complete problem for arbitrary Petri Nets. We develop the theory for efficient extraction of minimal bad siphons for S3PR (systems of simple sequential processes) proposed by Ezpeletaet al. The number of minimal bad siphons that needs to be searched is linear to the number of resources. The rest can be found by adding and deleting common sets of places from existing ones significantly reducing the search time. It is very interesting that both nets and siphons can be synthesized by first locating a circuit followed by adding handles.
    Relation: Journal of Information Science and Engineering,23(1),203-214
    Data Type: article
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    203-214.pdf472KbAdobe PDF764View/Open

    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