A CSP Account of Event-B Refinement

Steve Schneider
(University of Surrey)
Helen Treharne
(University of Surrey)
Heike Wehrheim
(University of Paderborn)

Event-B provides a flexible framework for stepwise system development via refinement. The framework supports steps for (a) refining events (one-by-one), (b) splitting events (one-by-many), and (c) introducing new events. In each of the steps events can moreover possibly be anticipated or convergent. All such steps are accompanied with precise proof obligations. Still, it remains unclear what the exact relationship - in terms of a behaviour-oriented semantics - between an Event-B machine and its refinement is. In this paper, we give a CSP account of Event-B refinement, with a treatment for the first time of splitting events and of anticipated events. To this end, we define a CSP semantics for Event-B and show how the different forms of Event-B refinement can be captured as CSP refinement.

In John Derrick, Eerke Boiten and Steve Reeves: Proceedings 15th International Refinement Workshop (Refine 2011), Limerick, Ireland, 20th June 2011, Electronic Proceedings in Theoretical Computer Science 55, pp. 139–154.
Published: 17th June 2011.

ArXived at: https://dx.doi.org/10.4204/EPTCS.55.9 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org