ω-Forest Algebras and Temporal Logics
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F21%3A00119652" target="_blank" >RIV/00216224:14330/21:00119652 - isvavai.cz</a>
Result on the web
<a href="https://drops.dagstuhl.de/opus/volltexte/2021/14459/" target="_blank" >https://drops.dagstuhl.de/opus/volltexte/2021/14459/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4230/LIPIcs.MFCS.2021.19" target="_blank" >10.4230/LIPIcs.MFCS.2021.19</a>
Alternative languages
Result language
angličtina
Original language name
ω-Forest Algebras and Temporal Logics
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA17-01035S" target="_blank" >GA17-01035S: Algebraic Language Theory for Infinite Trees</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia
ISBN
9783959772013
ISSN
1868-8969
e-ISSN
—
Number of pages
21
Pages from-to
1-21
Publisher name
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Place of publication
Dagstuhl, Germany
Event location
Tallinn
Event date
Aug 23, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—