About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Protocol validation - principles and applications
Abstract
We describe two techniques that have been developed for automated protocol validation, reachability analysis and random walk validation. A number of case studies are presented in order to demonstrate how the techniques can be applied to protocols of varying complexity. The effectiveness of automated protocol validation is discussed in terms of a simple model that shows why analysis of a restricted sample of the states in the reachable state space is sufficient to identify most errors when the latter are limited complexity. © 1992.