A CSP account of event-B refinement

7Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Schneider, S., Treharne, H., & Wehrheim, H. (2011). A CSP account of event-B refinement. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 55, pp. 139–154). Open Publishing Association. https://doi.org/10.4204/EPTCS.55.9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free