Integer linear programming and the analysis of some Petri net problems
From MaRDI portal
Publication:1293552
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)- Characterizing stable inequalities of Petri nets
- A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming
- Modelling integer linear programs with petri nets
- Petri nets with simple circuits
- Mathematical programming approach to the Petri nets reachability problem
- On minimal elements of upward-closed sets
- Optimal legal firing sequence of Petri nets using linear programming
- Characterizing stable and deriving valid inequalities of 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 4059119 (Why is no real title available?)
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)