Handbook of theoretical computer science (vol. B)
Relations and graphs: discrete mathematics for computer scientists
Relations and graphs: discrete mathematics for computer scientists
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
Information Processing Letters - Special issue on the calculational method
ACM Transactions on Programming Languages and Systems (TOPLAS)
Handbook of formal languages, vol. 3
Computation calculus bridging a formalization gap
Science of Computer Programming - Special issue on mathematics of program construction
Dynamic Logic
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Mathematical Structures in Computer Science
Some results in dynamic model theory
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
Algebras of modal operators and partial correctness
Theoretical Computer Science - Algebraic methodology and software technology
ACM Transactions on Computational Logic (TOCL)
RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
Omega algebra, demonic refinement algebra and commands
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Semiring Neighbours: An Algebraic Embedding and Extension of Neighbourhood Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Knowledge and games in modal semirings
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Lazy semiring neighbours and some applications
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
| Hi-index | 0.00 |
We propose 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 a multiplication that preserves arbitrary joins in its left argument and is isotone in its right argument. Over 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/ω-algebra.