Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems (Q4368693): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/9.633824 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2150974097 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:04, 19 March 2024
scientific article; zbMATH DE number 1094903
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems |
scientific article; zbMATH DE number 1094903 |
Statements
Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems (English)
0 references
4 December 1997
0 references
deadlock avoidance policies
0 references
sequential resource allocation
0 references
large-scale flexibly automated manufacturing systems
0 references
