English

$\omega$-Forest Algebras and Temporal Logics

Logic in Computer Science 2022-03-29 v1

Abstract

We use the algebraic framework for languages of infinite trees introduced in [4] to derive effective characterisations of various temporal logics, in particular the logic EF (a fragment of CTL) and its counting variant cEF.

Keywords

Cite

@article{arxiv.2203.13858,
  title  = {$\omega$-Forest Algebras and Temporal Logics},
  author = {Achim Blumensath and Jakub Lédl},
  journal= {arXiv preprint arXiv:2203.13858},
  year   = {2022}
}
R2 v1 2026-06-24T10:26:23.776Z