Creative Commons Attribution 4.0 license (CC BY 4.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2021.19
URN: urn:nbn:de:0030-drops-144594
URL: https://drops.dagstuhl.de/opus/volltexte/2021/14459/
Blumensath, Achim ; Lédl, Jakub
ω-Forest Algebras and Temporal Logics
| pdf-format: |
|
Abstract
We use the algebraic framework for languages of infinite trees introduced in [A. Blumensath, 2020] to derive effective characterisations of various temporal logics, in particular the logic EF (a fragment of CTL) and its counting variant cEF.
BibTeX - Entry
@InProceedings{blumensath_et_al:LIPIcs.MFCS.2021.19,
author = {Blumensath, Achim and L\'{e}dl, Jakub},
title = {{\omega-Forest Algebras and Temporal Logics}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {19:1--19:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14459},
URN = {urn:nbn:de:0030-drops-144594},
doi = {10.4230/LIPIcs.MFCS.2021.19},
annote = {Keywords: forest algebras, temporal logics, bisimulation}
}
| Keywords: | forest algebras, temporal logics, bisimulation | |
| Seminar: | 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) | |
| Issue date: | 2021 | |
| Date of publication: | 18.08.2021 |
