Mixed integer programming-based liveness test for FMS with full routing flexibility

DOI10.1155/2014/319281zbMath1442.93024DBLPjournals/jam/DongCZY14OpenAlexW2072161639WikidataQ59050876 ScholiaQ59050876MaRDI QIDQ2336334

Yanyan Li

Publication date: 19 November 2019

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/319281

Mathematics Subject Classification ID

Mixed integer programming (90C11) Discrete event control/observation systems (93C65)

Cites Work

• Concurrency bugs in multithreaded software: modeling and analysis using Petri nets
• Deadlock prevention policy based on Petri nets and siphons
• Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
• A Class of Well Structured Petri Nets for Flexible Manufacturing Systems

This page was built for publication: Mixed integer programming-based liveness test for FMS with full routing flexibility