1 Search Results for "Lédl, Jakub"


Document
ω-Forest Algebras and Temporal Logics

Authors: Achim Blumensath and Jakub Lédl

Published in: LIPIcs, Volume 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)


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.

Cite as

Achim Blumensath and Jakub Lédl. ω-Forest Algebras and Temporal Logics. In 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 202, pp. 19:1-19:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)


Copy BibTex To Clipboard

@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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.19},
  URN =		{urn:nbn:de:0030-drops-144594},
  doi =		{10.4230/LIPIcs.MFCS.2021.19},
  annote =	{Keywords: forest algebras, temporal logics, bisimulation}
}
  • Refine by Author
  • 1 Blumensath, Achim
  • 1 Lédl, Jakub

  • Refine by Classification
  • 1 Theory of computation → Logic

  • Refine by Keyword
  • 1 bisimulation
  • 1 forest algebras
  • 1 temporal logics

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2021

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail