An introduction to Estelle: a specification language for distributed systems
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
A parallel database-driven protocol verification system prototype
Software—Practice & Experience
Computer Networks and ISDN Systems
Protocol verification made simple: a tutorial
Computer Networks and ISDN Systems - Special issue on protocol specification, testing and verification
Design and validation of protocols: a tutorial
Computer Networks and ISDN Systems - Special issue on protocol specification, testing and verification
VESAR: a pragmatic approach to formal specification and verification
Computer Networks and ISDN Systems - Special issue on tools for FDTs
Foreword: Special Issue on Tools for Computer Communication Systems
IEEE Transactions on Software Engineering
How Could Estelle Become a Better FDT?
Proceedings of the IFIP WG6.1 Seventh International Conference on Protocol Specification, Testing and Verification VII
Using Compositional Preorders in the Verification of Sliding Window Protocal
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Probabilistic Verification of Communication Protocols
Proceedings of the IFIP WG6.1 Seventh International Conference on Protocol Specification, Testing and Verification VII
Research: Probabilistic fuzzy timed protocol verification
Computer Communications
Research: Protocol validation by simultaneous reachability analysis
Computer Communications
A computer-aided protocol design by production systems approach
IEEE Journal on Selected Areas in Communications
Protocol verification using database technology
IEEE Journal on Selected Areas in Communications
Hi-index | 0.24 |
Protocol verification is a process for checking the correctness of communication protocols. However, verifying practical and complicated protocols always encounters the state explosion problem using global state reachability analysis. In this paper, we propose a probabilistic partial protocol verification scheme to verify communication protocols that are specified in the extended state transition model, i.e. the Extended Communicating Finite State Machine (ECFSM) model. Based on our probabilistic verification scheme, the occurrence probability of each global state is derived using the occurrence rates of communicating entities' transitions and the occurrence probabilities of channel entities' transitions. Then, only those global states whose occurrence probabilities are greater than a given threshold need to be explored. As a result, probabilistic partial protocol verification can be achieved. In order to calculate more reasonable communicating transitions' occurrence rates and channel transitions' occurrence probabilities, we analyze protocol operations to derive transitions' probabilities relationships. Based on these relations, a reasonable value can be assigned to each transition's probability, which can be used to delimit partial probabilistic protocol verification. Using our probabilistic partial protocol verification scheme and derivation of transitions probabilities relationships, an Estelle-based Probabilistic Partial Protocol verification system, which is called PPP (P^3), is developed on SUN SPARC workstations. This way, protocol designers can use P^3 to design and partially verify the Estelle-based protocol specifications.