DMCA
On the Random Walk Method for Protocol Testing (1994)
| Venue: | In Proc. Computer-Aided Verification (CAV 1994), volume 818 of LNCS |
| Citations: | 22 - 0 self |
BibTeX
@INPROCEEDINGS{Mihail94onthe,
author = {Milena Mihail and Christos H. Papadimitriou},
title = {On the Random Walk Method for Protocol Testing},
booktitle = {In Proc. Computer-Aided Verification (CAV 1994), volume 818 of LNCS},
year = {1994},
pages = {132--141},
publisher = {Springer, LNCS}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
An important method for testing large and complex protocols repeatedly generates and tests a part of the reachable state space by following a random walk; the main advantage of this method is that it has minimal memory requirements. We use the coupling technique from Markov chain theory to show that short trajectories of the random walk sample accurately the reachable state space of a nontrivial family of protocols, namely, the symmetric dyadic flip-flops. This is the first evidence that the random walk method is amenable to rigorous treatment. Following West's original reasoning, efficient sampling of the reachable state space by random walk suffices to ensure effectiveness of testing. Is, however, efficient sampling of the random walk necessary for the effectiveness of the random walk method? In the context of Markov chain theory, "small cover time" can be thought of as a simpler justification for the effectiveness of testing by random walk; all symmetric (reversible) protocols posse...
Keyphrases
random walk method protocol testing reachable state space random walk markov chain theory efficient sampling short trajectory main advantage minimal memory requirement rigorous treatment small cover time symmetric dyadic flip-flop random walk suffices important method simpler justification complex protocol original reasoning nontrivial family first evidence coupling technique
