Academia.eduAcademia.edu

Figure from:A Pattern-based deadlock-freedom analysis strategy for concurrent systems

See full PDFdownloadDownload figure
Figure 14: DiningPhilosophers’ communication graph and essential-components panel.

Figure 14 DiningPhilosophers’ communication graph and essential-components panel.

Related Figures (13)

Figure 2: Communication graph and snapshot graph for symmetric dining philosophers.
Figure 2: Communication graph and snapshot graph for symmetric dining philosophers.
Figure 3: Communication graph and snapshot graphs for states 01, 72, and a3, respectively (left to right, top to bottom), for our examples.
Figure 3: Communication graph and snapshot graphs for states 01, 72, and a3, respectively (left to right, top to bottom), for our examples.
Figure 4: Communication graph for RingBuffer network with 3 storage cells and example of conflicts that could arise, respectively.
Figure 4: Communication graph for RingBuffer network with 3 storage cells and example of conflicts that could arise, respectively.
Figure 5: Chain of ungranted requests and cycle of ungranted requests coinci- dence with >pa.
Figure 5: Chain of ungranted requests and cycle of ungranted requests coinci- dence with >pa.
Figure 6: Communication graph and snapshot graph for asymmetric dining philosophers.
Figure 6: Communication graph and snapshot graph for asymmetric dining philosophers.
Figure 7: Chain of ungranted requests and cycle of ungranted requests coinci- dence with >og.
Figure 7: Chain of ungranted requests and cycle of ungranted requests coinci- dence with >og.
Figure 9: Chain of ungranted requests and cycle of ungranted requests coinci- dence with > 4p.
Figure 9: Chain of ungranted requests and cycle of ungranted requests coinci- dence with > 4p.
Figure 10: DFA’s interface.
Figure 10: DFA’s interface.
Figure 11: Descriptions-list and network-elements-list panels, respectively.
Figure 11: Descriptions-list and network-elements-list panels, respectively.
Figure 12: Atom-info panel. After presenting how our tool can be used to model a network, we move on to propose and discuss our verification method. The DPA (Decomposition and Pattern Adherence) method essentially relies on two main phases: firstly, it de- composes the network, then it proves that the essential subnetworks are deadlock free. In the following, we detail all smaller steps that are necessary to carry out both of DPA’s two main phases. We discuss how the steps can be implemented
Figure 12: Atom-info panel. After presenting how our tool can be used to model a network, we move on to propose and discuss our verification method. The DPA (Decomposition and Pattern Adherence) method essentially relies on two main phases: firstly, it de- composes the network, then it proves that the essential subnetworks are deadlock free. In the following, we detail all smaller steps that are necessary to carry out both of DPA’s two main phases. We discuss how the steps can be implemented
Figure 13: DFA’s menu and RingBuffer’s decomposed communication graph.
Figure 13: DFA’s menu and RingBuffer’s decomposed communication graph.
3FDR is currently in its fourth version (FDR4). Version 3 was a complete rewrite of FDR2 which largely improved it. This version (and subsequent ones), however, does not implement the stable-revivals model, which is an essential part of our method’s conflict-freedom analysis.
3FDR is currently in its fourth version (FDR4). Version 3 was a complete rewrite of FDR2 which largely improved it. This version (and subsequent ones), however, does not implement the stable-revivals model, which is an essential part of our method’s conflict-freedom analysis.
Table 5: Results of evaluation. n is a parameter used to configure the size of the systems tested. We measure in seconds the time taken to check deadlock freedom for each system. - means that the method could not prove deadlock freedom for the system: either the (incomplete) method is unable to prove so, or it took longer than 1 hour, or an error, such as running out of memory, occurred. + means that no efficient compression technique could be found.
Table 5: Results of evaluation. n is a parameter used to configure the size of the systems tested. We measure in seconds the time taken to check deadlock freedom for each system. - means that the method could not prove deadlock freedom for the system: either the (incomplete) method is unable to prove so, or it took longer than 1 hour, or an error, such as running out of memory, occurred. + means that no efficient compression technique could be found.