scientific article; zbMATH DE number 4045096

MaRDI QIDQ3782733zbMATH OpenFDO

Authors M. Taa

Publication date 1987

zbMATH Keywords

deadlocksplace/transition netsresource allocation problems

Mathematics Subject Classification ID

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

Recommendations

• Resource Allocation Systems: Some Complexity Results on the S4PR Class
• scientific article; zbMATH DE number 978207
• Complexity of the deadlock problem for Petri nets modeling resource allocation systems
• scientific article; zbMATH DE number 1156812
• scientific article; zbMATH DE number 3874587

Cited in

(12)

• Fast decentralized algorithms for resolving conflicts and deadlocks in resource allocation in data processing and control systems
• Editorial: Deadlock analysis and control in resource allocation systems
• Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks
• Optimal linear separation of the safe and unsafe subspaces of sequential resource allocation systems as a set-covering problem: algorithmic procedures and geometric insights
• On optimal management of resources in distributed networks
• scientific article; zbMATH DE number 3874587 (Why is no real title available?)
• Resource Allocation Systems: Some Complexity Results on the S4PR Class
• scientific article; zbMATH DE number 3989087 (Why is no real title available?)
• scientific article; zbMATH DE number 3990882 (Why is no real title available?)
• Random Resource Allocation Graphs and the Probability of Deadlock
• Revisiting deadlock prevention: a probabilistic approach
• Safe states in banker-like resource allocation problems

This page was built for publication:

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