Communicating sequential processes
Communicating sequential processes
Stepwise refinement of communicating systems
Science of Computer Programming
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Compositional Reasoning Using the Assumption-Commitment Paradigm
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
A Theory of Generalised Substitutions
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Introducing Dynamic Constraints in B
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
The Safe Machine: A New Specification Construct for B
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Temporal Verification of Simulation and Refinement
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Decentralization of process nets with centralized control
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
A Mechanically Proved Development Combining B Abstract Systems and Spin
QSIC '04 Proceedings of the Quality Software, Fourth International Conference
Formal derivation of spanning trees algorithms
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
| Hi-index | 0.00 |
We present a stepwise formal development of the Peterson's 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 Peterson's 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.