Hostname: page-component-cb9f654ff-9knnw Total loading time: 0 Render date: 2025-08-25T01:17:26.510Z Has data issue: false hasContentIssue false
  • English
  • Français

Modelling integer linear programs with petri nets*

Published online by Cambridge University Press:  15 August 2002

P. Richard
P. Richard*
Affiliation:
É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.
Get access

Abstract

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

Keywords

Petri netsinteger linear programming.

Information

Type
Research Article
Information
RAIRO - Operations Research , Volume 34 , Issue 3 , July 2000 , pp. 305 - 312
Copyright
© EDP Sciences, 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

* This work was done while the author was in the Laboratoire d'Informatique, E3I/Université de Tours, 64 avenue J. Portalis, 37200 Tours, France.