D. Dolev, M. Klawe, and M. Rodeh, "An O(n log n) unidirectional distributed algorithm for extrema finding in a circle," Journal of Algorithms, Vol 3. (1982), pp. 245-260.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....able to access which queues. Exclusive send and receive access, in our implementation, is therefore entered into the PROMELA specification as a logical assertion, which can be checked at runtime. The Appendix shows an example of a complete PROMELA specification for a leader election protocol from [DKR82], with the exclusive send and receive assertions added. It can easily be shown that the validity of an assertion of this type can be proven by both the non reduced and the reduced search, even when the reduction is based on an invalid assertion of this type. The intuition behind this is that the ....

D. Dolev, M. Klawe, and M. Rodeh, "An O(n log n) unidirectional distributed algorithm for extrema finding in a circle," Journal of Algorithms, Vol 3. (1982), pp. 245-260.

....of the partial order reduction method can be a reduction in the number of reachable system states by several orders of magnitude. Figure 2 shows a measurement of the number of reachable states that has to be generated to complete the verification for a formal model of a leader election algorithm [DKR82]. It illustrates a best case performance of the reduction algorithm, where an exponential growth in complexity is reduced to a linear growth, with growing numbers of processes participating in the protocol. An important characteristic of the partial order reduction method implemented in SPIN is ....

....10000 100000 1e 06 Number of States (log) Number of Processes in Ring . Search With P.O. Reduction Figure 2 Effect of Partial Order Reduction in SPIN (Leader election protocol for a uni directional ring [DKR82]) available, inevitably the verifier will run out of memory after generating M S states. If the total number of reachable states R M S states, then the problem coverage of that verification run is M (R S) This means that if M is 10 8 bytes, S is 10 3 bytes, and R is 10 6 states, then the ....

D. Dolev, M. Klawe, and M. Rodeh, `An O(n log n) unidirectional distributed algorithm for extrema finding in a circle,' Journal of Algorithms , Vol 3. (1982), pp. 245-260.

....able to access which queues. Exclusive send and receive access, in our implementation, is therefore entered into the PROMELA specification as a logical assertion, which can be checked at runtime. The Appendix shows an example of a complete PROMELA specification for a leader election protocol from [DKR82], with the exclusive send and receive assertions added. It can easily be shown that the validity of an assertion of this type can be proven by both the non reduced and the reduced search, even when the reduction is based on an invalid assertion of this type. The intuition behind this is that the ....

D. Dolev, M. Klawe, and M. Rodeh, "An O(n log n) unidirectional distributed algorithm for extrema finding in a circle," Journal of Algorithms, Vol 3. (1982), pp. 245-260.

....is performed. This static reduction method avoids the runtime overhead that has plagued partial order reduction strategies in the past. Fig. 5 shows a measurement of the number of reachable states that has to be generated to complete the verification for a model of a leader election algorithm [18], discussed in more detail in Section 4.2 and in Appendix B. It illustrates a bestcase performance of the reduction algorithm, where exponential growth in the number of processes participating in the protocol is reduced to linear growth. In more typical cases, the reduction in the state space size ....

....of SPIN to the verification of concurrent systems, we discuss three different types of problems. The first is a protocol for scheduling processes in a distributed operating system, as discussed in [64] The second example is the algorithm for leader election in a unidirectional ring, as given in [18], 63] The third example is a standard flow control protocol, as given in [71] For a tutorial introduction to the way in which design models such as these can be constructed, we refer to [36] 38] We conclude this section with a summary of other significant applications of SPIN, concentrating ....

[Article contains additional citation context not shown here]

D. Dolev, M. Klawe, and M. Rodeh, "An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle," J. Algorithms, vol. 3, pp. 245-260, 1982.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC