A Stepwise Development of the Peterson's Mutual Exclusion Algorithm Using B Abstract Systems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

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

Résumé

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.

Dates et versions

hal-00421161 , version 1 (30-09-2009)

Identifiants

Citer

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⟩
28 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More