Process completing sequences for resource allocation systems with synchronization

DOI10.1155/2012/424051zbMath1248.93060OpenAlexW2125647292WikidataQ58907963 ScholiaQ58907963MaRDI QIDQ446469

Song Foh Chew, Mark A. Lawley, Shengyong Wang

Publication date: 6 September 2012

Published in: Journal of Control Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/424051

zbMATH Keywords

Petri netspolynomial methodsNP-completecapacity boundsGeneralized Augmented Marked Graphslive resource allocationprocess completing sequences

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems
• Robustness analysis of non-ordinary Petri nets for flexible assembly systems

This page was built for publication: Process completing sequences for resource allocation systems with synchronization