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

    Title: Recursive solution of number of reachable states of a simple subclass of FMS
    Authors: 趙玉
    Chao, Daniel Yuh
    Contributors: 資管系
    Keywords: reachability;S3PR;flexible manufacturing systems;Petri nets
    Date: 2014
    Issue Date: 2014-06-30 18:23:56 (UTC+8)
    Abstract: This paper aims to compute the number of reachable (forbidden, live and deadlock) states for flexible manufacturing systems (FMS) without the construction of reachability graph. The problem is nontrivial and takes, in general, an exponential amount of time to solve. Hence, this paper focusses on a simple version of Systems of Simple Sequential Processes with Resources (S3PR), called kth-order system, where each resource place holds one token to be shared between two processes. The exact number of reachable (forbidden, live and deadlock) states can be computed recursively.
    Relation: International Journal of Systems Science, 45(3), 702-710
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1080/00207721.2012.745240
    DOI: 10.1080/00207721.2012.745240
    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