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

    Title: A new liveness characterization for S 3PGR 2
    Authors: Chao, Daniel Yuh;Chen, Jiun-Ting
    Contributors: 資管系
    Keywords: deadlocks;General Petri nets;Hot research topics;Liveness;Sequential process;Sufficient and necessary condition;Synchronized choice nets;weakly live;Computer science;Petri nets
    Date: 2011-06
    Issue Date: 2015-10-08 17:52:33 (UTC+8)
    Abstract: It has been a hot research topic to find the sufficient and necessary condition of liveness for S 3PGR 2 (systems of simple sequential processes with general resources requirement) modeled by general Petri nets (GPN). This paper proposes a solution. © 2011 IEEE.
    Relation: Proceedings - 2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011,3,論文編號 5952651, 137-141
    Data Type: conference
    DOI 連結: http://dx.doi.org/10.1109/CSAE.2011.5952651
    DOI: 10.1109/CSAE.2011.5952651
    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