Liberalising Event B without changing it



Paper Title: Liberalising Event B without changing it
Authored By:S. Reeves and D. Streader
Number:07/2006
Publisher:Department of Computer Science, The University of Waikato
Publication Date:2006
Pages:1-13
Abstract:We transfer a process algebraic notion of refinement to the B method by using the well-known bridge between the relational semantics underlying the B machines and the labelled transition system semantics of processes. Thus we define delta refinement on Event B systems. We then apply this new refinement to a problem from the literature that previously could only be solved by retrenchment.
Keywords:process refinement, automatic verification, frame refinement, Event B


Show/Hide Record