A CSP Account of Event-B Refinement
Tools
Tools
Tools
Schneider, SA, Treharne, H and Wehrheim, H (2011) A CSP Account of Event-B Refinement In: REFINE 2011, 2011-06-20 - 2011-06-20, Limerick.
![[img]](/style/images/fileicons/application_pdf.png)
| PDF - Accepted Version Available under License : See the attached licence file. 242Kb | |
![[img]](/style/images/fileicons/text_plain.png) | Plain Text (licence) 1516b |
Official URL: http://dx.doi.org/10.4204/EPTCS.55.9
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Divisions: | Faculty of Engineering and Physical Sciences > Computing Science |
| ID Code: | 7180 |
| Deposited By: | Symplectic Elements |
| Deposited On: | 29 Sep 2011 10:07 |
| Last Modified: | 03 Feb 2013 14:55 |
Document Downloads
Repository Staff Only: item control page