Modelling integer linear programs with petri nets*

P. Richard

RAIRO - Operations Research (2010)

  • Volume: 34, Issue: 3, page 305-312
  • ISSN: 0399-0559

Abstract

top
We show in this paper that timed Petri nets, with one resource shared by all the transitions, are directly connected to the modelling of integer linear programs (ILP). To an ILP can be automatically associated an equivalent Petri net. The optimal reachability delay is an optimal solution of the ILP. We show next that a net can model any ILP. I order to do this, we give a new sufficient reachability condition for the marking equation, which also holds for general Petri nets without timed transitions.

How to cite

top

Richard, P.. "Modelling integer linear programs with petri nets*." RAIRO - Operations Research 34.3 (2010): 305-312. <http://eudml.org/doc/197827>.

@article{Richard2010,
abstract = { We show in this paper that timed Petri nets, with one resource shared by all the transitions, are directly connected to the modelling of integer linear programs (ILP). To an ILP can be automatically associated an equivalent Petri net. The optimal reachability delay is an optimal solution of the ILP. We show next that a net can model any ILP. I order to do this, we give a new sufficient reachability condition for the marking equation, which also holds for general Petri nets without timed transitions. },
author = {Richard, P.},
journal = {RAIRO - Operations Research},
keywords = {Petri nets; integer linear programming.; integer linear progrmming},
language = {eng},
month = {3},
number = {3},
pages = {305-312},
publisher = {EDP Sciences},
title = {Modelling integer linear programs with petri nets*},
url = {http://eudml.org/doc/197827},
volume = {34},
year = {2010},
}

TY - JOUR
AU - Richard, P.
TI - Modelling integer linear programs with petri nets*
JO - RAIRO - Operations Research
DA - 2010/3//
PB - EDP Sciences
VL - 34
IS - 3
SP - 305
EP - 312
AB - We show in this paper that timed Petri nets, with one resource shared by all the transitions, are directly connected to the modelling of integer linear programs (ILP). To an ILP can be automatically associated an equivalent Petri net. The optimal reachability delay is an optimal solution of the ILP. We show next that a net can model any ILP. I order to do this, we give a new sufficient reachability condition for the marking equation, which also holds for general Petri nets without timed transitions.
LA - eng
KW - Petri nets; integer linear programming.; integer linear progrmming
UR - http://eudml.org/doc/197827
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.