A Polynomial Algorithm to Decide Liveness and Boundedness of ESAC Nets
关于ESAC网活性和有界性的一个多项式算法

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.