In: RAIRO, Rech. Oper., Vol. 23, No. 1, pages 43-50. 1989.
Abstract: The algebraic representation of polyhedral sets is an alternative tool for the analysis of structural and local properties of Petri nets. Some aspects of the issues of reachability, boundedness and liveness of a net are analyzed and characterized by the means of a linear system of inequalities. In most cases, linear programming instead of integer programming can be used to check these properties therefore enabling the validation of very large nets.
Keywords: linear programming; reachability; boundedness; liveness; large net.