Generalised nonblocking is a property of discrete-event systems which verifies liveness. It was introduced to overcome the weaknesses of standard nonblocking. Verifying generalised nonblocking of real-world models often involves exploring state-spaces which will exceed available memory. A compositional verification approach has been developed to achieve verification for models of a much larger size. For this project, we have developed the first implementation for compositionally verifying generalised nonblocking. In addition, we have experimented with the techniques used in compositional verification, and analysed their performance. Our algorithm has successfully verified a large set of industrial-size models, including at least one large model which had not been verified before.