Using linear programming in Petri net analysis
暂无分享,去创建一个
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, boundness and liveness of a net are analyzed and characterized by the means of 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
[1] J. Lasserre. Consistency of a linear system of inequalities , 1986 .
[2] Kurt Lautenbach,et al. Use of Petri Nets for Proving Correctness of Concurrent Process Systems , 1974, IFIP Congress.
[3] Larry L. Kinney,et al. REDUCTION OF PETRI NETS. , 1976 .
[4] T. Murata. State equation, controllability, and maximal matchings of petri nets , 1977 .
[5] G. Berthelot,et al. Reduction of Petri-Nets , 1976, MFCS.