Uppaal models of Mutual Exclusion Algorithms

Mutual Exclusion

Here are Uppaal models of the mutual exclusion algorithms discussed in Appendix A of William Stallings, Operating Systems: Internals and Design Principles, Seventh Edition, Pearson Education Limited 2012:

the incorrect "first attempt" from page A-2: Attempt1.q and Attempt1.xml
the incorrect "second attempt" from page A-2: Attempt2.q and Attempt2.xml
the incorrect "third attempt" from page A-2: Attempt3.q and Attempt3.xml
the incorrect "fourth attempt" from page A-2: Attempt4.q and Attempt4.xml
Dekker's algorithm, page A-6: dekker.q and dekker.xml
Peterson's algorithm, page A-7: Peterson.q and Peterson.xml
a timed model of Peterson's algorithm: Peterson_timed.q and Peterson_timed.xml

Test and set

Here is a model of the use of the compare and swap instruction for mutual exclusion, as described by Stallings on pages 230-231:

testset.q and testset.xml