Resource Allocation Systems: Some Complexity Results on the S4PR Class

DOI10.1007/11888116_24zbMath1225.68128OpenAlexW1850839557MaRDI QIDQ3613079

José-Manuel Colom, Juan-Pablo López-Grao

Publication date: 11 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11888116_24

Mathematics Subject Classification ID

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

Cites Work

• Deadlock Prediction: Easy and Difficult Cases
• Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
• Unnamed Item
• Unnamed Item

This page was built for publication: Resource Allocation Systems: Some Complexity Results on the S4PR Class