Modelling integer linear programs with petri nets
From MaRDI portal
Publication:4528236
DOI10.1051/RO:2000115zbMATH Open0962.90029OpenAlexW2114218015MaRDI QIDQ4528236FDOQ4528236
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/
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
Programming involving graphs or networks (90C35) Integer programming (90C10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (3)
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)