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

    Title: 最小吸虹之合成
    Other Titles: Synthesis of Minimal Deadlocks
    Authors: 趙玉
    Keywords: 派萃網路;彈性製造系統;死結;同步選擇
    Petri nets;FMS;Deadlock;Synchronized choice
    Date: 2001
    Issue Date: 2007-04-18 16:40:11 (UTC+8)
    Publisher: 臺北市:國立政治大學資訊管理學系
    Abstract: Lautenbach's marking condition for liveness [7](where all minimal siphons are invariant-controlled) has been successfully applied to FMS. However, there are two exceptions with no solutions in literatures. We have uncovered these mysteries and extends the above models to all types of resource-sharing based on the concept of synthesis of minimal siphons. Different structures in the synthesis result in different classes of nets. Each class is maximal in the sense that it covers various classes of nets in the literature. Lautenbach's marking condition for liveness (MCL) is extended to more general cases and we are able to offer a more intuitive insight as to the structural cause for the above exceptions. It also helps to discover new TP-PT generation rules for our proprietary Knitting technique [2-3]. We have studeid each of the above maximal classes and derive its marking condition for liveness. We also propose a procedure to find the S-invariant that controls a minimal siphon.
    Description: 核定金額:414700元
    Data Type: report
    Appears in Collections:[資訊管理學系] 國科會研究計畫

    Files in This Item:

    File Description SizeFormat
    902213E004004.pdf150KbAdobe PDF925View/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