A temporal logic based on actions rather than on states is presented and interpreted over labelled transition systems. It is proved that it has essentially the same power as CTL*, a temporal logic interpreted over Kripke structures. The relationship between the two logics is established by introducing two mappings from Kripke structures to labelled transition systems and viceversa and two transformation functions between the two logics which preserve truth. A branching time version of the action based logic is also introduced. This new logic for transition systems can play an important role as an intermediate between Hennessy-Milner Logic and the modal μ-calculus. It is sufficiently expressive to describe safety and liveness properties but ...
In this paper we present an embedding of the most common branching time logics (CTL/CTL*) in an exte...
Although less studied than purely action or state based logics, state/event based logics are becomin...
Preface We examine modal and temporal logics for processes. In section 1 we introduce concurrent pro...
Model checkers for systems represented by labelled transition systems are not as extensively used as...
Although less studied than purely action or state based logics, state/event based logics are becomin...
Temporal logic has developed over the last 30 years into a powerful formal setting for the specifica...
A system is described which supports proving both behavioural and logical properties of concurrent s...
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the ...
A system is described which supports proving both behavioural and logical properties of concurrent s...
Three temporal logics are introduced that induce on labeled transition systems the same identificati...
A system is described which supports proofs of both behavioural and logical properties of concurrent...
In this paper we present an embedding of the most common branching time logics (CTL/CTL*) in an exte...
In this paper we present an embedding of the most common branching time logics (CTL/CTL*) in an exte...
michal,bezem¡ We discuss briefly the duality (or rather, complementarity) of system descriptions bas...
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the ...
In this paper we present an embedding of the most common branching time logics (CTL/CTL*) in an exte...
Although less studied than purely action or state based logics, state/event based logics are becomin...
Preface We examine modal and temporal logics for processes. In section 1 we introduce concurrent pro...
Model checkers for systems represented by labelled transition systems are not as extensively used as...
Although less studied than purely action or state based logics, state/event based logics are becomin...
Temporal logic has developed over the last 30 years into a powerful formal setting for the specifica...
A system is described which supports proving both behavioural and logical properties of concurrent s...
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the ...
A system is described which supports proving both behavioural and logical properties of concurrent s...
Three temporal logics are introduced that induce on labeled transition systems the same identificati...
A system is described which supports proofs of both behavioural and logical properties of concurrent...
In this paper we present an embedding of the most common branching time logics (CTL/CTL*) in an exte...
In this paper we present an embedding of the most common branching time logics (CTL/CTL*) in an exte...
michal,bezem¡ We discuss briefly the duality (or rather, complementarity) of system descriptions bas...
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the ...
In this paper we present an embedding of the most common branching time logics (CTL/CTL*) in an exte...
Although less studied than purely action or state based logics, state/event based logics are becomin...
Preface We examine modal and temporal logics for processes. In section 1 we introduce concurrent pro...