Mathematical programming approach to the Petri nets reachability problem

Mathematical programming approach to the Petri nets reachability problem

0.00 Avg rating0 Votes
Article ID: iaor20084620
Country: Netherlands
Volume: 177
Issue: 1
Start Page Number: 176
End Page Number: 197
Publication Date: Feb 2007
Journal: European Journal of Operational Research
Authors: , ,
Keywords: programming: mathematical
Abstract:

This paper focuses on the resolution of the reachability problem in Petri nets, using the mathematical programming paradigm. The proposed approach is based on an implicit traversal of the Petri net reachability graph. This is done by constructing a unique sequence of Steps that represents exactly the total behaviour of the net. We propose several formulations based on integer and/or binary linear programming, and the corresponding sets of adjustments to the particular class of problem considered. Our models are validated on a set of benchmarks and compared with standard approaches from IA and Petri nets community.

Reviews

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