a system is in a deadlock state &lt;=&gt; the wait-for graph has a cycle.  looks for cycles periodically to detect deadlock.
a system is in a deadlock state &lt;=&gt; the wait-for graph has a cycle.  looks for cycles periodically to detect deadlock.
handled by the construction of wait-for graph which shows transaction dependencies; deadlock exists if the wfg contains a cycle