University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Managing LTL properties in Event-B refinement

Schneider, S, Treharne, H, Wehrheim, H and Williams, D (2014) Managing LTL properties in Event-B refinement Lecture Notes in Computer Science. pp. 221-237.

Available under License : See the attached licence file.

Download (223kB) | Preview
Text (licence)
Available under License : See the attached licence file.

Download (33kB) | Preview


Refinement in Event-B supports the development of systems via proof based step-wise refinement of events. This refinement approach ensures safety properties are preserved, but additional reasoning is required in order to establish liveness and fairness properties. In this paper we present results which allow a closer integration of two formal methods, Event-B and linear temporal logic. In particular we show how a class of temporal logic properties can carry through a refinement chain of machines. Refinement steps can include introduction of new events, event renaming and event splitting. We also identify a general liveness property that holds for the events of the initial system of a refinement chain. The approach will aid developers in enabling them to verify linear temporal logic properties at early stages of a development, knowing they will be preserved at later stages. We illustrate the results via a simple case study.

Item Type: Article
Divisions : Faculty of Engineering and Physical Sciences > Computing Science
Authors :
Schneider, S
Treharne, H
Wehrheim, H
Williams, D
Date : 25 June 2014
Related URLs :
Additional Information : The original publication is available at
Depositing User : Symplectic Elements
Date Deposited : 03 Oct 2014 12:47
Last Modified : 25 Jun 2015 01:08

Actions (login required)

View Item View Item


Downloads per month over past year

Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800