Using linear programming in Petri net analysis

Using linear programming in Petri net analysis

0.00 Avg rating0 Votes
Article ID: iaor19891099
Country: France
Volume: 23
Issue: 1
Start Page Number: 43
End Page Number: 50
Publication Date: Feb 1989
Journal: RAIRO Operations Research
Authors: ,
Keywords: petri nets
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 linear systems 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.

Reviews

Required fields are marked *. Your email address will not be published.