Using linear programming in Petri net analysis
From MaRDI portal
Recommendations
Cited in
(15)- Integer linear programming and the analysis of some Petri net problems
- Optimal legal firing sequence of Petri nets using linear programming
- Petri net representation and reachability analysis of 0--1 integer linear programming problems
- Characterizing stable inequalities of Petri nets
- scientific article; zbMATH DE number 1216193 (Why is no real title available?)
- scientific article; zbMATH DE number 1302045 (Why is no real title available?)
- scientific article; zbMATH DE number 1302046 (Why is no real title available?)
- scientific article; zbMATH DE number 1822236 (Why is no real title available?)
- scientific article; zbMATH DE number 1836396 (Why is no real title available?)
- On the Use of Linear Combination in PWCP-Nets
- A linear programming approach to general dataflow process network verification and dimensioning
- Characterizing stable and deriving valid inequalities of Petri nets
- Parameterized reachability trees for algebraic Petri nets
- Approach for Transforming Linear Constraints on Petri Nets
- Minimal generating sets for semiflows
This page was built for publication: Using linear programming in Petri net analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3826378)