Liveness and Boundedness of Decomposable Asymmetric Choice Nets
可分解非对称选择网的活性和有界性

Liveness and safeness are important behavioral properties of net systems. In this paper, a subclass of AC nets which are called decomposable asymmetric choice nets are obtained. A necessary and sufficient condition of liveness for decomposable AC systems is also proved. Moreover, a polynomial-time algorithm is presented to decide whether a Petri net system is live and bounded decomposable AC system.