Example Models for APNN-ToolBox




Dekker's mutex Algorithm

This Net is divided into two sections(Left-section (refered as l) and Right-section (refered as r)). The following algorithm is a variant of Peterson's algorithm (13.7). It employs the same two flags finished_l and finished_r, and likewise shares a token, that is either on at l or at r at any time. The essential difference to 13.7 is the time at which the sharde token is adjusted: the token is moved to at l before l becomes critical in 13.7, whereas the token is moved to at l after l has been critical in 13.8. In case the site_r has not raised its flag finished_r, the step from pend1_l to critical_l with action d depends not only on the shared token in at_r but also on the local state pend1_r of site r.



Download APNN Description of the model.

Back to main page