Modelling Peterson Mutual Exclusion Algorithm in DVE Language and Verifying LTL Properties

Abstract

Peterson mutual exclusion algorithm is a concurrent programming algorithm for mutual exclusion that allows two processes to share a single-use resource without conflict, using only shared memory for communication. DiVinE is a LTL model checker, and DVE is the specification language. In this paper, we implement the DVE model of Peterson mutual exclusion algorithm, and verify LTL properties of Peterson mutual exclusion algorithms using DiVinE model checker. The experimental results show that the LTL formula structure is relevant to the costs of LTL verification.