A Polynomial Algorithm to Decide Liveness and Boundedness of ESAC Nets
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    It has been an important direction of Petri net applications to find practical and efficient polynomial algorithms. In this paper, an algorithm is given to decide the structural liveness and structural boundedness of extended strong asymmetric choice (ESAC) nets. This algorithm can also decide whether an initial marking of a structurally live and structurally bounded ESAC net is a live marking or not. Since the class of ESAC nets contains free choice (FC) nets, this algorithm shows large area of applications.

    Reference
    Related
    Cited by
Get Citation

焦莉,陆维明.关于ESAC网活性和有界性的一个多项式算法.软件学报,2002,13(7):1257-1263

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:September 18,2000
  • Revised:April 25,2002
  • Adopted:
  • Online:
  • Published:
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