Volume 34, Number 3, July September 2000
|Page(s)||305 - 312|
|Published online||15 August 2002|
Modelling integer linear programs with petri nets*
École Nationale Supèrieure de Mécanique
et d'Aérotechnique, Laboratoire d'Informatique
Scientifique et Industrielle, Téléport 2 - BP. 109,
86960 Futuroscope Cedex, France.
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.
Key words: Petri nets / integer linear programming.
© EDP Sciences, 2000
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.