Integer linear programming and the analysis of some Petri net problems

DOI10.1007/S002240000127zbMATH Open0934.68065OpenAlexW2084957010MaRDI QIDQ1293552FDOQ1293552

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

zbMATH Keywords

Petri nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (4)

• Modelling integer linear programs with petri nets
• On minimal elements of upward-closed sets
• A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming
• Optimal legal firing sequence of Petri nets using linear programming

   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 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Verifying time Petri nets by linear programming 👍 👎

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)