Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems (Q4368693)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems |
scientific article; zbMATH DE number 1094903
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9432331
0 references
0.9351229
0 references
0.9275024
0 references
0.91230476
0 references
0.90800107
0 references
0.9037198
0 references
0.89855134
0 references
0 references
0.87207377
0 references
