Abstract The design and verification of communication protocols is one of the challenging problems. One approach to solve the problem is to use Petri Nets as an analytical tool. In this approach a protocol is modeled as a Petri Net (a graphical representation) and is analyzed by using the same techniques as for Petri Nets. The application of Petri Nets in the design, analysis and verification of communication protocols, has several advantages. First of all the overall behaviour of a protocol is often easier to understand due to the precise nature of the representation scheme. Secondly, Petri Net theory and its analysis techniques can be easily applied. Finally, since Petri Nets can be synthesized by using bottom-up or top-down approaches, it is possible to derive the overall model via a combination of subsystems whose behaviour is already known or can be easily verified. In this paper two major analysis techniques, namely, reachability tree and matrix analysis are explored. Since communication protocols are usually too complex to be analyzed, therefore, this paper describes a simulation program that simulates the dynamic behaviour of Petri Nets. The program points out all deadlock states, if any, and checks for boundedness of protocols.