Notes on Liveness and Boundedness of Extended Strong Asymmetric Choice Nets Ⅱ  

作　　者：焦莉 陆维明 

机构地区：[1]DivisionofComputerScience,InstituteofMathematics,AcademyofMathematicsandSystemScienceTheChineseAcademyofSciences,Beijing100080,P.R.China [2]DivisionofComputerScience,InstituteofMath

出　　处：《Journal of Computer Science & Technology》2001年第5期426-433,共8页计算机科学技术学报（英文版）

基　　金：the National Natural Science Foundation of China (No.60073013) and the NKBRSF of China (No.G1998030416).

摘　　要：In this paper, the Extended Strong Asymmetric Choice Nets Ⅱ (ESACN Ⅱ), a subclass of Asymmetric Choice Nets (ACN) including Extended Free Choice Nets (EFCN) and Strong Asymmetric Choke Nets Ⅱ (SACN Ⅱ, is presented. A necessary and sufficient condition for liveness of ESACN Ⅱ is proposed. Moreover, a criterion is introduced, which is necessary and sufficient for judgement of liveness and boundedness of ESACN Ⅱ. Meanwhile a polynomial time algorithm is given to decide liveness and boundedness for ESACN Ⅱ.In this paper, the Extended Strong Asymmetric Choice Nets Ⅱ (ESACN Ⅱ), a subclass of Asymmetric Choice Nets (ACN) including Extended Free Choice Nets (EFCN) and Strong Asymmetric Choke Nets Ⅱ (SACN Ⅱ, is presented. A necessary and sufficient condition for liveness of ESACN Ⅱ is proposed. Moreover, a criterion is introduced, which is necessary and sufficient for judgement of liveness and boundedness of ESACN Ⅱ. Meanwhile a polynomial time algorithm is given to decide liveness and boundedness for ESACN Ⅱ.

关 键 词：asymmetric choice net (ACN) extended strong asymmetric choice nets Ⅱ (ESACN Ⅱ) LIVENESS BOUNDEDNESS algorithm polynomial time 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]