Skip to Main content Skip to Navigation
Conference papers

A Stepwise Development of the Peterson's Mutual Exclusion Algorithm Using B Abstract Systems

Abstract : We present a stepwise formal development of the Petersonrsquos mutual exclusion algorithm using Event B. We use a bottom-up approach where we introduce the parallel composition of subsystems which are separately specified. First, we specify subsystems as B abstract systems; then we compose the subsystems to get a first abstract solution for the mutual exclusion. This solution is improved to obtain the Petersonrsquos algorithm. This is achieved by refinement and composition of the former abstract subsystems. Therefore the result is formally proved on the basis of correctness (safety) properties added to the invariant. Atelier B (a B prover) is used to check completely the development.
Document type :
Conference papers
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-00421161
Contributor : Christian Attiogbe Connect in order to contact the contributor
Submitted on : Wednesday, September 30, 2009 - 11:51:00 PM
Last modification on : Wednesday, April 27, 2022 - 4:10:33 AM

Links full text

Identifiers

Citation

J. Christian Attiogbe. A Stepwise Development of the Peterson's Mutual Exclusion Algorithm Using B Abstract Systems. ZB 2005: Formal Specification and Development in Z and B, Apr 2005, Guildford, United Kingdom. pp.124-141, ⟨10.1007/b135596⟩. ⟨hal-00421161⟩

Share

Metrics

Record views

24