%0 Journal Article
%T A Polynomial Algorithm to Decide Liveness and Boundedness of ESAC Nets<br>关于ESAC网活性和有界性的一个多项式算法
%A JIAO Li
%A LU Wei-ming
%A <br>焦莉
%A 陆维明
%J 软件学报
%D 2002
%I 
%X 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.
%K ESAC nets
%K structural liveness
%K structural boundedness
%K polynomial algorithm<br>扩展强化非对称选择网(ESAC网)
%K 结构活
%K 结构有界
%K 多项式算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=BBD7DEC3D4EA3AFB&yid=C3ACC247184A22C1&vid=FC0714F8D2EB605D&iid=DF92D298D3FF1E6E&sid=FD947B5A26542F64&eid=08DDB398556FE547&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=15