A two-level distributed detection algorithm of AND/OR deadlocks
From MaRDI portal
Cited in
(4)- A priority dynamics for generalized drinking philosophers
- And/or-convexity: a graph convexity based on processes and deadlock models
- Deadlock resolution in wait-for graphs by vertex/arc deletion
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem
This page was built for publication: A two-level distributed detection algorithm of AND/OR deadlocks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1898181)