可分解非对称选择网的活性和有界性

Liveness and Boundedness of Decomposable Asymmetric Choice Nets

活性和有界性是网系统的重要行为特性.从分解以及尽可能简单分解的角度得到了非对称选择网的一个子类,可分解非对称选择网(简称DAC网),证明了DAC网系统活性的充分必要条件,同时给出了DAC网系统活性有界性的充分必要条件,也进一步讨论了判定一个Petri网系统是否是活的有界的DAC网系统的多项式算法.

Liveness and boundedeness are important behavioral properties of net systems. 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.