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

    Title: Extended Synchronized choice Nets
    Authors: 趙玉;Jose A. Nicdao
    Date: 2004
    Issue Date: 2009-01-17 16:34:33 (UTC+8)
    Abstract: Unlike traditional classification by output conditions of places, synchronized choice nets (SNCs) were defined as a new class of nets where all first-order structures (FOSs) are symmetric. SNCs are extended to deal with nets with asymmetric first-order structures (AFOSs). A subclass called extended SNCs (ESNCs) can be converted to a general Petri net, called a weighted SNC (WSNC). A WSNC is an SNC if all its arc weights are one. We apply existing theory to check if a WSNC is structural live and bounded. If it is, we derive the sufficient and necessary marking condition (the weighted marking $W(M_0)>0$) for liveness. Thus, it is live when invariant-controlled. We then enhance it in three aspects and apply it to flexible manufacturing systems with resource sharing. Extensions to ESNCs are also discussed.
    Relation: Computer Journal, 46(5), 505-523
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1093/comjnl/46.5.505
    DOI: 10.1093/comjnl/46.5.505
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File SizeFormat
    62.pdf1389KbAdobe PDF1137View/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