Optimal legal firing sequence of Petri nets using linear programming

DOI10.1023/B:OPTE.0000013633.35184.6DMaRDI QIDQ1826353zbMATH OpenOpenAlexFDO

Authors Ahmed Tarek, Noé Lopez-Benitez

Publication date 6 August 2004

Published in Optimization and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:opte.0000013633.35184.6d

zbMATH Keywords

legal firing sequencelinear programmingoptimizationPetri netsreachability analysis

Mathematics Subject Classification ID

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

Recommendations

• Petri net representation and reachability analysis of 0--1 integer linear programming problems
• Using linear programming in Petri net analysis
• Modelling integer linear programs with petri nets
• Integer linear programming and the analysis of some Petri net problems

Cited in

(6)

• Petri net representation and reachability analysis of 0--1 integer linear programming problems
• Approximated timed reachability graphs for the robust control of discrete event systems
• A heuristic algorithm FSDC based on avoidance of deadlock components in finding legal firing sequences of Petri nets
• scientific article; zbMATH DE number 5631271 (Why is no real title available?)
• Optimal trajectory generation for Petri nets
• Polynomial-time algorithm for the legal firing sequences problem of a type of synchronous composition Petri nets

This page was built for publication: Optimal legal firing sequence of Petri nets using linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1826353)