One Novel and Optimal Deadlock Recovery Policy for Flexible Manufacturing Systems Using Iterative Control Transitions Strategy

<table class="fixed-width table-group" id="tab3"><tr><td><table class="table"><colgroup><col style="width:26.33em"/></colgroup><tr><td class="thead-hr" colspan="1"><hr/></td></tr><tr class="thead"><td class="align_left">Maximally Permissive Deadlock Recovery Policy</td></tr><tr><td class="thead-hr" colspan="1"><hr/></td></tr><tr><td class="align_left">(i) Input: one deadlock S<sup>3</sup>PR PNM.</td></tr><tr><td class="align_left">(1) Identify the saturated number of tokens in idle places.</td></tr><tr><td class="align_left">(2) Identify the crucial dead markings from reachability graph.</td></tr><tr><td class="align_left">(3) Calculate all control transitions.</td></tr><tr><td class="align_left">(4) Add all control transitions into original PNM.</td></tr><tr><td class="align_left">(ii) Output: one live S<sup>3</sup>PR PNM.</td></tr><tr class="table-tr"><td colspan="1"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

<div>The flow step of our novel deadlock recovery policy.</div>

Mathematical Problems in Engineering

tab3

Table 3

Table 3: One Novel and Optimal Deadlock Recovery Policy for Flexible Manufacturing Systems Using Iterative Control Transitions Strategy 