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.
Publisher
Trans Tech Publications, Ltd.
Reference15 articles.
1. E. Clarke, O. Grumberg, and D. Peled. Model Checking. The MIT Press, Cambridge, MA, (1999).
2. C. Baier and J. P. Katoen. Principles of model checking. The MIT Press, Cambridge, MA, (2008).
3. E. Clarke, W. Klieber, M. Nováček, and P. Zuliani. Model Checking and the State Explosion Problem. Tools for Practical Software Verification. Lecture Notes in Computer Science Volume 7682, pages 1-30, (2012).
4. J. R. Burch, E. M. Clarke, and K. L. McMillan. Symbolic model checking: 1020 states and beyond. Information and Computation, 98: 142-170, (1992).
5. K. L. McMillan. Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic Publishers, (1993).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fair Mutual Exclusion for N Processes;Communications in Computer and Information Science;2024