Published in

Springer Verlag, Lecture Notes in Computer Science, p. 260-274

DOI: 10.1007/978-3-642-16265-7_19

Links

Tools

Export citation

Search in Google Scholar

A CSP Approach to Control in Event-B

Journal article published in 2010 by Steve Schneider, Helen Treharne, Heike Wehrheim
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

Event-B has emerged as one of the dominant state-based formal techniques used for modelling control-intensive applications. Due to the blocking semantics of events, their ordering is controlled by their guards. In this paper we explore how process algebra descriptions can be defined alongside an Event-B model. We will use CSP to provide explicit control flow for an Event-B model and alternatively to provide a way of separating out requirements which are dependent on control flow information. We propose and verify new conditions on combined specifications which establish deadlock freedom. We discuss how combined specifications can be refined and the challenges arising from this. The paper uses Abrial's Bridge example as the basis of a runningexample to illustrate the framework.