Products of tree automata with an application to temporal logic

Zoltán Ésik, Szabolcs Iván

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

We introduce the notion of the Moore product of tree automata as a special case of the cascade product. We give an algebraic characterization of the expressive power of certain CTL-like temporal logics based on the notion of varieties of finite tree automata closed under the Moore product.

Original languageEnglish
Pages (from-to)61-78
Number of pages18
JournalFundamenta Informaticae
Volume82
Issue number1-2
Publication statusPublished - 2008

Fingerprint

Tree Automata
Temporal logic
Temporal Logic
Expressive Power
Finite Automata
Cascade
Closed

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Applied Mathematics
  • Safety, Risk, Reliability and Quality

Cite this

Products of tree automata with an application to temporal logic. / Ésik, Zoltán; Iván, Szabolcs.

In: Fundamenta Informaticae, Vol. 82, No. 1-2, 2008, p. 61-78.

Research output: Contribution to journalArticle

@article{dea60f96db294ee88aa8ab3c82291889,
title = "Products of tree automata with an application to temporal logic",
abstract = "We introduce the notion of the Moore product of tree automata as a special case of the cascade product. We give an algebraic characterization of the expressive power of certain CTL-like temporal logics based on the notion of varieties of finite tree automata closed under the Moore product.",
author = "Zolt{\'a}n {\'E}sik and Szabolcs Iv{\'a}n",
year = "2008",
language = "English",
volume = "82",
pages = "61--78",
journal = "Fundamenta Informaticae",
issn = "0169-2968",
publisher = "IOS Press",
number = "1-2",

}

TY - JOUR

T1 - Products of tree automata with an application to temporal logic

AU - Ésik, Zoltán

AU - Iván, Szabolcs

PY - 2008

Y1 - 2008

N2 - We introduce the notion of the Moore product of tree automata as a special case of the cascade product. We give an algebraic characterization of the expressive power of certain CTL-like temporal logics based on the notion of varieties of finite tree automata closed under the Moore product.

AB - We introduce the notion of the Moore product of tree automata as a special case of the cascade product. We give an algebraic characterization of the expressive power of certain CTL-like temporal logics based on the notion of varieties of finite tree automata closed under the Moore product.

UR - http://www.scopus.com/inward/record.url?scp=38349162850&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38349162850&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:38349162850

VL - 82

SP - 61

EP - 78

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

SN - 0169-2968

IS - 1-2

ER -