TY  - JOUR
A1  - Möller, Bernhard
A1  - Höfner, Peter
A1  - Struth, Georg
T1  - Quantales and temporal logics
T2  - Lecture Notes in Computer Science
N2  - 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 μ-calculus and Kleene/ω-algebraic ones.
Y1  - 2006
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/35934
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-359342
SN  - 0302-9743
VL  - 4019
SP  - 263
EP  - 277
PB  - Springer
ER  -