By Topic

Verification of Bakery algorithm variants for two processes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
D. Dedic ; Nova Vizija d.o.o., Zalec, Slovenia ; R. Meolic

This paper is about Bakery algorithm for mutual exclusion. Three variants of the algorithm for two processes are discussed, formally modelled with a simple process algebra and then verified. Two methods of verification are given. In the first one, the processes representing behaviour of the algorithms are minimised with regard to testing equivalence and then examined. In the second approach, the properties are expressed with temporal logic ACTL and then verified using a model checker. Because we bounded the possible values of variables, the paper contributes new results and knowledge to the well-known facts about Bakery algorithm.

Published in:

EUROCON 2003. Computer as a Tool. The IEEE Region 8  (Volume:2 )

Date of Conference:

22-24 Sept. 2003