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
A Procedure for Probabilistic Protocol Verification and Evaluation
Abstract
This paper presents a new dynamic state exploration algorithm which is applied to probabilistic protocol verification and performance evaluation for synchronous as well as asynchronous models of a protocol. Properties of the technique are analyzed and proposed to further enhance the verification and evaluation procedure. The procedure based on this technique: 1) evaluates the importance of states in the dynamic course of a global reachability graph generation, 2) explores only the most probable subset of states based on their dynamically computed importance, and 3) quantifies and bounds important reliability and performance measures such as mean time to failure and turnaround time. Properties of the algorithm are demonstrated via the call establishment phase of the X.75 protocol. © 1992 IEEE