微信服务号

微信订阅号

Home > Archive>Volume 3, Issue 1, 1992 >23-29
PDF HTML XML Export Cite reminder
AN ALGORITHM. FOR CONSTRUCTING A. BOUNDED PETRJ NET ACCORDING TO ITS REACHABLE MARKING-GRAPH
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
    • |
  • Figures
    • |
  • Metrics
    • |
  • Reference
    • |
  • Related
    • |
  • Cited by
    • |
  • Materials
    • |
  • Comments
    Abstract:

    An algorithm for constructing a bounded Petri Net according to its reachable marking graph is presented in this paper. A proof of correctness and a valuation of complexity for the algorithm are also given. We show that the algorithm is of polynomial complexity, hence it is a valid algorithm.

    Reference
    Related
    Cited by
Get Citation

吴哲辉,蒋昌俊.有界Petri网的可达图到网图的转换算法.软件学报,1992,3(1):23-29

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:January 30,1990
  • Revised:June 05,1990
  • Adopted:
  • Online:
  • Published:
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063