%0 Journal Article
%T An Algorithm to Decide Liveness and Liveness Monotonicity of Asymmetric Choice Nets<br>判定非对称选择网活性及活性单调性的一个算法
%A SONG Wen
%A LU Wei-Ming
%A <br>宋文
%A 陆维明
%J 计算机科学
%D 2005
%I 
%X Liveness is one of the important behavioral properties of Petri nets. The aim of this contribution is to draw a more powerful algorithm to decide liveness of asymmetric choice nets (AC). Firstly, this paper presents difinitions of Pre-induced subnet and Post-induced subnet of the minimal siphon. And then the idea of Divide and Conquer is intro- duced to transform the targeted problems into the counterpart of FC(free choice nets). Finally, a polymial-time algo- rithm to decide liveness and liveness monotonicity of AC is presented.
%K Asymmetric choice net
%K Liveness
%K Liveness monotonicity
%K Algorithm<br>非对称选择网
%K 活性
%K 活性单调性
%K Petri网
%K 分析算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=7674DD387DB0F171&yid=2DD7160C83D0ACED&vid=9971A5E270697F23&iid=9CF7A0430CBB2DFD&sid=13553B2D12F347E8&eid=A04140E723CB732E&journal_id=1002-137X&journal_name=计算机科学&referenced_num=1&reference_num=11