Resource Allocation Systems: Some Complexity Results on the S4PR Class
From MaRDI portal
Recommendations
- Complexity of the deadlock problem for Petri nets modeling resource allocation systems
- A Petri net perspective on the resource allocation problem in software engineering
- Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
- Structural methods for the control of discrete event dynamic systems -- the case of the resource allocation problem
- scientific article; zbMATH DE number 4045096
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3359777 (Why is no real title available?)
- Deadlock Prediction: Easy and Difficult Cases
- Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
Cited in
(9)- On the siphon-based characterization of liveness in sequential resource allocation systems
- Complexity of the deadlock problem for Petri nets modeling resource allocation systems
- Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks
- scientific article; zbMATH DE number 4045096 (Why is no real title available?)
- Process completing sequences for resource allocation systems with synchronization
- Structural methods for the control of discrete event dynamic systems -- the case of the resource allocation problem
- A Petri net perspective on the resource allocation problem in software engineering
- An algorithm to compute the minimal siphons in \(S^4 PR\) nets
- scientific article; zbMATH DE number 3874587 (Why is no real title available?)
This page was built for publication: Resource Allocation Systems: Some Complexity Results on the S4PR Class
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613079)