The pursuit of deadlock freedom (Q580970)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4018367
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The pursuit of deadlock freedom |
scientific article; zbMATH DE number 4018367 |
Statements
The pursuit of deadlock freedom (English)
0 references
1987
0 references
We introduce some combinatorial techniques for establishing the deadlock freedom of concurrent systems which are similar to the variant/invariant method of proving loop termination. Our methods are based on the local analysis of networks, which is combinatorially far easier than analysing all global states. They are illustrated by proving numerous examples to be free of deadlock, some of which are useful classes of network.
0 references
concurrent systems
0 references
loop termination
0 references
local analysis of networks
0 references
0.8427226543426514
0 references
0.8070469498634338
0 references
0.7911989092826843
0 references
0.7863460779190063
0 references
