![Mathematical programming approach to the Petri nets reachability problem [An article from: European Journal of Operational Research]](https://www.ebooknetworking.net/books/B00/0PB/bigB000PBZS92.jpg)
Mathematical programming approach to the Petri nets reachability problem [An article from: European Journal of Operational Research]
Book Details
Author(s)T. Bourdeaud'huy, S. Hanafi, P. Yim
PublisherElsevier
ISBN / ASINB000PBZS92
ISBN-13978B000PBZS95
MarketplaceFrance 🇫🇷
Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2007. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
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.
Description:
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.
