Author： Richard P.
Publisher： Edp Sciences
E-ISSN： 1290-3868|34|3|305-312
ISSN： 0399-0559
Source： RAIRO - Operations Research, Vol.34, Iss.3, 2010-03, pp. : 305-312
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
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.
Related content
Business Process Modelling based on Petri nets
MATEC Web of conference, Vol. 139, Iss. issue, 2017-12 ,pp. :
Access to resources
Recommend
Access to resources
The methodology of multicriterial assessment of Petri nets’ apparatus
MATEC Web of conference, Vol. 44, Iss. issue, 2016-02 ,pp. :