Abstract. 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 µ-calculus.
Derrick and Smith REF explore the use of temporal logics to express properties about the state of systems over time, and how those properties are preserved under refinement.
Linear temporal logic and Z refinement
Algebraic Methodology and Software Technology (AMAST 2004), volume 3116 of LNCS
Computer Science