Modelling integer linear programs with petri nets

DOI10.1051/RO:2000115MaRDI QIDQ4528236zbMATH OpenOpenAlexFDO

Authors

Publication date 31 January 2001

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=RO_2000__34_3_305_0/, https://eudml.org/doc/197827

zbMATH Keywords

Petri netsinteger linear progrmming

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Integer linear programming and the analysis of some Petri net problems
• Petri net representation and reachability analysis of 0--1 integer linear programming problems
• Symbolic Reachability Analysis of Integer Timed Petri Nets
• Verifying time Petri nets by linear programming
• scientific article; zbMATH DE number 3896317

Cited in

(3)

• Integer linear programming and the analysis of some Petri net problems
• Petri net representation and reachability analysis of 0--1 integer linear programming problems
• Optimal legal firing sequence of Petri nets using linear programming

This page was built for publication: Modelling integer linear programs with petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4528236)