We provide an algebraic semantics for the temporal logic CTL* and simplify it for its sublogics CTL and LTL. We abstractly represent state and path formulas over transition systems in Boolean left quantales. These are complete lattices with an operation of multiplication that is completely disjunctive in its left argument and isotone in its right argument. On these quantales, the semantics of CTL* formulas can be encoded via finite and infinite iteration operators, the CTL and LTL operators can be related to domain operators. This yields interesting new connections between representations as known from the modal "mü"-calculus and Kleene/"omega"-algebraic ones
We generalize the operators of classical linear time temporal logic to partial orders, such as the o...
Suitable extensions of monadic second-order theories of k successors have been proposed in the liter...
In this paper we prove decidability of two kinds of branching time temporal logics. First we show th...
We provide an algebraic semantics for the temporal logic CTL* and simplify it for its sublogics CTL ...
34 pagesInternational audienceThis paper presents a range of quantitative extensions for the tempora...
A temporal logic based on actions rather than on states is presented and interpreted over labelled t...
We define extensions of the full branching-time temporal logic CTL ∗ in which the path quantifiers a...
Although data values are available in almost every computer system, reasoning about them is a challe...
AbstractThis paper gives a general coalgebraic account of temporal logics whose semantics involves a...
Temporal logic is two-valued: a property is either true or false. When applied to the analysis of st...
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the ...
Model checking and temporal logics are boolean. The answer to the model checking question does a sys...
AbstractWe show that ECTL+, the classical extension of CTL with fairness properties, is expressively...
Model checking and temporal logics are boolean. The answer to the model checking question does a sys...
In earlier papers we have presented algebraic semantics of CTL and CTL*. However, they were not full...
We generalize the operators of classical linear time temporal logic to partial orders, such as the o...
Suitable extensions of monadic second-order theories of k successors have been proposed in the liter...
In this paper we prove decidability of two kinds of branching time temporal logics. First we show th...
We provide an algebraic semantics for the temporal logic CTL* and simplify it for its sublogics CTL ...
34 pagesInternational audienceThis paper presents a range of quantitative extensions for the tempora...
A temporal logic based on actions rather than on states is presented and interpreted over labelled t...
We define extensions of the full branching-time temporal logic CTL ∗ in which the path quantifiers a...
Although data values are available in almost every computer system, reasoning about them is a challe...
AbstractThis paper gives a general coalgebraic account of temporal logics whose semantics involves a...
Temporal logic is two-valued: a property is either true or false. When applied to the analysis of st...
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the ...
Model checking and temporal logics are boolean. The answer to the model checking question does a sys...
AbstractWe show that ECTL+, the classical extension of CTL with fairness properties, is expressively...
Model checking and temporal logics are boolean. The answer to the model checking question does a sys...
In earlier papers we have presented algebraic semantics of CTL and CTL*. However, they were not full...
We generalize the operators of classical linear time temporal logic to partial orders, such as the o...
Suitable extensions of monadic second-order theories of k successors have been proposed in the liter...
In this paper we prove decidability of two kinds of branching time temporal logics. First we show th...