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

    Title: Searching Strict Minimal Siphons for SNC-Based Resource Allocation Systems
    Authors: 趙玉
    Chao, Daniel Yuh
    Contributors: 資管系
    Keywords: Petri nets;siphons;traps;FMS;algorithm;liveness;deadlock
    Date: 2007-05
    Issue Date: 2015-01-12 15:35:59 (UTC+8)
    Abstract: For a flexible manufacturing system (FMS) or Resource Allocation System (RAS) which can be decomposed into a number of synchronized choice nets interconnected by resource places, we propose to efficiently extract strict minimal siphons (SMS) in an incremental fashion rather than the traditional global approach. Only a subset of all SMS needs to be searched. The rest SMS can be found by adding and deleting common sets of places from existing ones.
    Relation: Journal of Information Science and Engineering,23(3),855-869
    Data Type: article
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    853-867.pdf516KbAdobe PDF715View/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