An Algorithm to Decide Liveness and Liveness Monotonicity of Asymmetric Choice Nets
判定非对称选择网活性及活性单调性的一个算法

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.