A Petri net perspective on the resource allocation problem in software engineering
DOI10.1007/978-3-642-29072-5_8zbMATH Open1350.68061OpenAlexW64544204MaRDI QIDQ2889618FDOQ2889618
Authors: Juan-Pablo López-Grao, José-Manue Colom 
Publication date: 8 June 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29072-5_8
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
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) 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)
Cited In (6)
- Title not available (Why is that?)
- Complexity of the deadlock problem for Petri nets modeling resource allocation systems
- Title not available (Why is that?)
- Program task scheduling in multiprocessor computer systems using the mechanism of resource Petri nets
- High-level Petri-net model for a resource-sharing problem
- Resource Allocation Systems: Some Complexity Results on the S4PR Class
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)
