The paper is a tutorial on some formal methods for verification of communication protocols. We focus on methods to show that a proposed communication protocol meets its specification by proving safety and liveness properties. Emphasis is put on finite state spaces for which algorithms are available which can be used to mechanise property proving.