Algebra for infinite forests with an application to the temporal logic ef

16Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We define an extension of forest algebra for ω-forests. We show how the standard algebraic notions (free object, syntactic algebra, morphisms, etc.) extend to the infinite case. To prove its usefulness, we use the framework to get an effective characterization of the ω-forest languages that are definable in the temporal logic that uses the operator EF (exists finally). © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Bojańczyk, M., & Idziaszek, T. (2009). Algebra for infinite forests with an application to the temporal logic ef. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5710 LNCS, pp. 131–145). https://doi.org/10.1007/978-3-642-04081-8_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free