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

    Title: Virtual First-Order Structure
    Authors: 趙玉
    Chao, Daniel Yuh
    Contributors: 資管系
    Keywords: Petri nets;synchronized choice nets;siphons;traps;weakly live
    Date: 2007-02
    Issue Date: 2015-01-12 15:36:22 (UTC+8)
    Abstract: The proof of liveness for various new classes of nets is not intuitive and rather hard to understand. We propose to find the maximum class, called non-virtual-net (NV-net) that are live as long as all minimal siphons never get empty of tokens and the maximum class, called virtual-net (V-net) that may be weakly live if all minimal siphons never get empty of tokens. In the future, when a new system is developed, if it is an NV-net, then it is live as long as no siphons ever get empty. We show that weakly liveness is closely related to a structure called Virtual First Order Structure. We show that both Synchronized Choice Net and Extended Synchronized Choice Net belong to non-virtual-net.
    Relation: Journal of Information Science and Engineering,23(2),371-385
    Data Type: article
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    371-385.pdf538KbAdobe PDF810View/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