A Petri net perspective on the resource allocation problem in software engineering
From MaRDI portal
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Recommendations
- Complexity of the deadlock problem for Petri nets modeling resource allocation systems
- Resource Allocation Systems: Some Complexity Results on the S4PR Class
- Structural methods for the control of discrete event dynamic systems -- the case of the resource allocation problem
- scientific article; zbMATH DE number 978207
- Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
Cited in
(6)- Complexity of the deadlock problem for Petri nets modeling resource allocation systems
- Resource Allocation Systems: Some Complexity Results on the S4PR Class
- scientific article; zbMATH DE number 978207 (Why is no real title available?)
- scientific article; zbMATH DE number 1156812 (Why is no real title available?)
- Program task scheduling in multiprocessor computer systems using the mechanism of resource Petri nets
- High-level Petri-net model for a resource-sharing problem
This page was built for publication: A Petri net perspective on the resource allocation problem in software engineering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889618)