Integer linear programming and the analysis of some Petri net problems
From MaRDI portal
Publication:1293552
DOI10.1007/S002240000127zbMATH Open0934.68065OpenAlexW2084957010MaRDI QIDQ1293552FDOQ1293552
Authors: K. Appert 
Publication date: 28 June 1999
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002240000127
Recommendations
- Modelling integer linear programs with petri nets
- Petri net representation and reachability analysis of 0--1 integer linear programming problems
- Using linear programming in Petri net analysis
- scientific article; zbMATH DE number 1836391
- Mathematical programming approach to the Petri nets reachability problem
- On \(\mathcal K\)-diagnosability of Petri nets via integer linear programming
- Verification of bounded Petri nets using integer programming
- scientific article; zbMATH DE number 1216193
- scientific article; zbMATH DE number 1302046
- Verifying time Petri nets by linear programming
Cited In (11)
- Modelling integer linear programs with petri nets
- Characterizing stable inequalities of Petri nets
- Title not available (Why is that?)
- Mathematical programming approach to the Petri nets reachability problem
- On minimal elements of upward-closed sets
- Petri net representation and reachability analysis of 0--1 integer linear programming problems
- Characterizing stable and deriving valid inequalities of Petri nets
- A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming
- Petri nets with simple circuits
- Optimal legal firing sequence of Petri nets using linear programming
- Using linear programming in Petri net analysis
This page was built for publication: Integer linear programming and the analysis of some Petri net problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293552)
