Probabilistic testing of protocols

Authors:
D. P. Sidhu;C.-S. Chang
Affiliations:
Department of Computer Science, University of Maryland - BC, Baltimore, MD and Institute for Advanced Computer Studies, University of Maryland - CP, College Park, MD;Department of Computer Science, Iowa State University, Ames, IA
Venue:
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Year:
1989

Citing 5
Cited 2

Verification of multiprocess probabilistic protocols

Distributed Computing
A protocol test generation procedure

Computer Networks and ISDN Systems
Formal Methods for Protocol Testing: A Detailed Study

IEEE Transactions on Software Engineering
Communicating sequential processes

Communications of the ACM
Probabilistic Verification of Communication Protocols

Proceedings of the IFIP WG6.1 Seventh International Conference on Protocol Specification, Testing and Verification VII

Experience with formal methods in protocol development

ACM SIGCOMM Computer Communication Review
QE modeling and test selection based on PNFSM

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Test sequences are used for the conformance testing of communication protocols to standards. This paper discusses a new approach to generating test sequences. The approach is based on probabilistic concepts about protocol state transitions and communication channels. The novel feature of the test sequences generated by this technique is that the most probable states of a protocol will be tested more promptly.