Derrick, J. and Smith, G. (2004) Linear temporal logic and Z refinement. In: Rattray, C. and Maharaj, S. and Shankland, C., eds. Linear temporal logic and Z refinement. Lecture Notes in Computer Science, 3116. Springer pp. 117-131. ISBN 3-540-22381-9 .
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
Since Z, being a state-based language, describes a system in terms of its state and potential state changes, it is natural to want to describe properties of a specified system also in terms of its state. One means of doing this is to use Linear Temporal Logic (LTL) in which properties about the state of a system over time can be captured. This, however, raises the question of whether these properties are preserved under refinement. Refinement is observation preserving and the state of a specified system is regarded as internal and, hence, non-observable. In this paper, we investigate this issue by addressing the following questions. Given that a Z specification A is refined by a Z specification C, and that P is a temporal logic property which holds for A, what temporal logic property Q can we deduce holds for C? Furthermore, under what circumstances does the property Q preserve the intended meaning of the property P? The paper answers these questions for LTL, but the approach could also be applied to other temporal logics over states such as CTL and the mu-calculus.
|Item Type:||Conference or workshop item (Paper)|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||24 Nov 2008 18:02|
|Last Modified:||12 Jun 2012 13:00|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/14126 (The current URI for this page, for reference purposes)|
- Depositors only (login required):