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 whi...
This paper introduces Chronolog(Z), a logic programming language based on a discrete linear-time tem...
Summary. This article provides the definition of linear temporal logic (LTL) and its properties rele...
As specifications and verifications of concurrent systems employ Linear Temporal Logic (LTL), it is ...
Abstract. Since Z, being a state-based language, describes a system in terms of its state and potent...
One way to verify the correctness of an implementation under refinement in formal specifications is ...
In this paper we present a new way of reconciling Event-B refinement with linear temporal logic (LTL...
This paper presents a systematic approach to proving temporal properties of arbitrary Z specificatio...
Abstract. This paper presents a systematic approach to proving tem-poral properties of arbitrary Z s...
AbstractAn assumption/guarantee specification of a system consists of an assumption part, which spec...
Refinement in Event-B supports the development of systems via proof based step-wise refinement of ev...
In this paper we present a new way of reconciling Event-B refinement with linear temporal logic (LTL...
Model checking is a powerful method widely explored in formal verification to check the (state-trans...
In this paper, we consider how refinements between state-based specifications (e.g., written in Z) c...
Real-Time Logic is a formal notation for reasoning about temporal behaviour. Z is a general purpose ...
A predicate linear temporal logic LTL = without quantifiers but with predicate -abstraction mechanis...
This paper introduces Chronolog(Z), a logic programming language based on a discrete linear-time tem...
Summary. This article provides the definition of linear temporal logic (LTL) and its properties rele...
As specifications and verifications of concurrent systems employ Linear Temporal Logic (LTL), it is ...
Abstract. Since Z, being a state-based language, describes a system in terms of its state and potent...
One way to verify the correctness of an implementation under refinement in formal specifications is ...
In this paper we present a new way of reconciling Event-B refinement with linear temporal logic (LTL...
This paper presents a systematic approach to proving temporal properties of arbitrary Z specificatio...
Abstract. This paper presents a systematic approach to proving tem-poral properties of arbitrary Z s...
AbstractAn assumption/guarantee specification of a system consists of an assumption part, which spec...
Refinement in Event-B supports the development of systems via proof based step-wise refinement of ev...
In this paper we present a new way of reconciling Event-B refinement with linear temporal logic (LTL...
Model checking is a powerful method widely explored in formal verification to check the (state-trans...
In this paper, we consider how refinements between state-based specifications (e.g., written in Z) c...
Real-Time Logic is a formal notation for reasoning about temporal behaviour. Z is a general purpose ...
A predicate linear temporal logic LTL = without quantifiers but with predicate -abstraction mechanis...
This paper introduces Chronolog(Z), a logic programming language based on a discrete linear-time tem...
Summary. This article provides the definition of linear temporal logic (LTL) and its properties rele...
As specifications and verifications of concurrent systems employ Linear Temporal Logic (LTL), it is ...