Petri net representation and reachability analysis of 0--1 integer linear programming problems

DOI10.1016/J.INS.2017.03.014MaRDI QIDQ2293169zbMATH OpenOpenAlexFDO

Authors Akito Kodama, Tatsushi Nishi

Publication date 7 February 2020

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2017.03.014

zbMATH Keywords

0--1 integer linear programming problemAGV systemsdiscrete event systemsoptimal transition firing sequence problemsPetri netreachability analysis

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Traffic problems in operations research (90B20) Integer programming (90C10) Combinatorial optimization (90C27)

Recommendations

• Modelling integer linear programs with petri nets
• Integer linear programming and the analysis of some Petri net problems
• Optimal legal firing sequence of Petri nets using linear programming
• Using linear programming in Petri net analysis
• An Algorithm for the General Petri Net Reachability Problem

Cites work

• A novel method for deadlock prevention of AMS by using resource-oriented Petri nets
• Applications and Theory of Petri Nets 2005
• Coloured timed Petri net model for real-time control of automated guided vehicle systems
• Conflict-free shortest-time bidirectional AGV routeing
• Deadlock avoidance in an automated guidance vehicle system using a coloured Petri net model
• Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
• Deadlock prevention policy based on Petri nets and siphons
• Decomposition of Petri nets and Lagrangian relaxation for solving routing problems for agvs
• Design of a maximally permissive liveness-enforcing supervisor with a compressed supervisory structure for flexible manufacturing systems
• Feedback control of Petri nets based on place invariants
• Mathematical programming approach to the Petri nets reachability problem
• On liveness and controlled siphons in Petri nets
• On the enforcement of a class of nonlinear constraints on Petri nets
• Optimal legal firing sequence of Petri nets using linear programming
• Polynomial-time algorithm for the legal firing sequences problem of a type of synchronous composition Petri nets
• Scheduling and routing of automated guided vehicles: A hybrid approach

Cited in

(5)

• Integer linear programming and the analysis of some Petri net problems
• Optimal legal firing sequence of Petri nets using linear programming
• Decomposition of Petri nets and Lagrangian relaxation for solving routing problems for agvs
• scientific article; zbMATH DE number 2079763 (Why is no real title available?)
• Modelling integer linear programs with petri nets

This page was built for publication: Petri net representation and reachability analysis of 0--1 integer linear programming problems

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